Connections between two theories of concurrency: metric spaces and synchronization trees
Information and Control
A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Journal of the ACM (JACM)
On the relationships between Scott domains, synchronization trees, and metric spaces
Information and Control - The MIT Press scientific computation series
The foundations of program verification (2nd ed.)
The foundations of program verification (2nd ed.)
Merge and termination in process algebra
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
Observation equivalence as a testing equivalence
Theoretical Computer Science
On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Modal logics for communicating systems
Theoretical Computer Science
Algebraic theory of processes
Axiomatising finite concurrent processes
SIAM Journal on Computing
Information and Computation
A domain equation for bisimulation
Information and Computation
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Algebraic Semantics
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
A Modal Characterisation of Observable Machine-Behaviour
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
Compositional verification of concurrent systems using Petri-net-based condensation rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Knowledge-Based Software Architectures: Acquisition, Specification, and Verification
IEEE Transactions on Knowledge and Data Engineering
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A semantic theory for value-passing processes based on the late approach
Information and Computation
Embedding untimed into timed process algebra: the case for explicit termination
Mathematical Structures in Computer Science
Observational trees as models for concurrency
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Information and Computation
A Congruence Rule Format with Universal Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
The equational theory of prebisimilarity over basic CCS with divergence
Information Processing Letters
Semantics and expressiveness of ordered SOS
Information and Computation
Structural Operational Semantics with First-Order Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Contracts for Mobile Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Compositional Properties of Sequential Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
On hierarchically developing reactive systems
Information and Computation
Connection between logical and algebraic approaches to concurrent systems†
Mathematical Structures in Computer Science
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Compositionality of fixpoint logic with chop
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Deriving non-determinism from conjunction and disjunction
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Parameterized Structured Operational Semantics
Fundamenta Informaticae
Theoretical Computer Science
| Hi-index | 0.01 |
In this paper, a process algebra that incorporates explicit representations of successful termination, deadlock, and divergence is introduced and its semantic theory is analyzed. Both an operational and a denotational semantics for the language is given and it is shown that they agree. The operational theory is based upon a suitable adaptation of the notion of bisimulation preorder. The denotational semantics for the language is given in terms of the initial continuous algebra that satisfies a set of equations E, CIE. It is shown that CIE is fully abstract with respect to our choice of behavioral preorder. Several results of independent interest are obtained; namely, the finite approximability of the behavioral preorder and a partial completeness result for the set of equations E with respect to the preorder.