Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
19
views
13
references
Top references
cited by
4
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,641
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
CONCUR 2005 – Concurrency Theory: 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005. Proceedings
A Ground-Complete Axiomatization of Finite State Processes in Process Algebra
other
Author(s):
Jos C. M. Baeten
,
Mario Bravetti
Publication date
(Print):
2005
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory
Most cited references
13
Record
: found
Abstract
: not found
Article
: not found
Algebra of communicating processes with abstraction
J.A. Bergstra
,
J.W. Klop
(1985)
0
comments
Cited
51
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A complete inference system for a class of regular behaviours
Robin Milner
(1984)
0
comments
Cited
34
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Process algebra with prepositional signals
J.C.M. Baeten
,
J.A. Bergstra
(1997)
0
comments
Cited
8
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 248-262
DOI:
10.1007/11539452_21
SO-VID:
8669fc4a-e974-49e4-a5d2-dbd1266233e7
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Static Analysis Versus Model Checking for Bug Finding
pp. 2
The Benefits of Exposing Calls and Returns
pp. 4
A Compositional Approach to the Stochastic Dynamics of Gene Networks
pp. 5
Games Other People Play
pp. 6
Type-Directed Concurrency
pp. 21
Multiport Interaction Nets and Concurrency
pp. 36
Model Checking for π-Calculus Using Proof Search
pp. 51
A Game Semantics of the Asynchronous π-Calculus
pp. 66
Efficient On-the-Fly Algorithms for the Analysis of Timed Games
pp. 81
Modal Logics for Timed Control
pp. 95
Timed Shuffle Expressions
pp. 110
A New Modality for Almost Everywhere Properties in Timed Automata
pp. 125
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation
pp. 141
A Behavioural Pseudometric for Metric Labelled Transition Systems
pp. 156
On Probabilistic Program Equivalence and Refinement
pp. 171
Probabilistic Anonymity
pp. 186
Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus
pp. 202
Timed Spi-Calculus with Types for Secrecy and Authenticity
pp. 217
Selecting Theories and Recursive Protocols
pp. 233
Constraint Solving for Contract-Signing Protocols
pp. 248
A Ground-Complete Axiomatization of Finite State Processes in Process Algebra
pp. 263
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
pp. 278
Bisimulations Up-to for the Linear Time Branching Time Spectrum
pp. 293
Deriving Weak Bisimulation Congruences from Reduction Systems
pp. 308
SOS for Higher Order Processes
pp. 323
The Individual and Collective Token Interpretations of Petri Nets
pp. 338
Merged Processes — A New Condensed Representation of Petri Net Behaviour
pp. 353
Concurrent Clustered Programming
pp. 368
A Theory of System Behaviour in the Presence of Node and Link Failures
pp. 383
Comparing Two Approaches to Compensable Flow Composition
pp. 398
Transactions in RCCS
pp. 413
Two-Player Nonzero-Sum ω-Regular Games
pp. 428
Games Where You Can Play Optimally Without Any Memory
pp. 443
On Implementation of Global Concurrent Systems with Local Asynchronous Controllers
pp. 458
Defining Fairness
pp. 473
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
pp. 488
Termination Analysis of Integer Linear Loops
pp. 503
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
pp. 518
Verification of Qualitative ℤ Constraints
pp. 533
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces
pp. 548
Taming Interface Specifications
pp. 562
Synthesis of Distributed Systems from Knowledge-Based Specifications
Similar content
2,641
Getting Axiomatic About Learning Objects
Authors:
D Wiley
,
D. WILEY
On Axiomatic Characterization of Alexander-Spanier Normal Homology Theory of General Topological Spaces
Authors:
Vladimer Baladze
,
Anzor Beridze
,
Leonard Mdzinarishvili
Axiomatic Design Applied to the Development of a System for Monitoring and Teleoperation of a CNC Machine through the Internet
Authors:
L.E.S. Oliveira
,
A.J. Álvares
See all similar
Cited by
4
A Ground-Complete Axiomatization of Finite State Processes in Process Algebra
Authors:
Jos Baeten
,
Mario Bravetti
A Context-Free Process as a Pushdown Automaton
Authors:
J. Baeten
,
P. Cuijpers
,
P. van Tilburg
On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
Authors:
Suzana Andova
,
Sonja Georgievska
See all cited by