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
A modal characterization of observational congruence on finite terms of CCS
Information and Control
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Specification-oriented semantics for communicating processes
Acta Informatica
Another look at abstraction in process algebra
14th International Colloquium on Automata, languages and programming
Readiness semantics for regular processes with silent actions
14th International Colloquium on Automata, languages and programming
Observation equivalence as a testing equivalence
Theoretical Computer Science
Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Lectures on a Calculus for Communicating Systems
Seminar on Concurrency, Carnegie-Mellon University
Frm Synchronization Tree Logic to Acceptance Model Logic
Proceedings of the Conference on Logic of Programs
On the Relationship of CCS and CSP
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Process semantics: universal axioms compositional rules, and applications
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Bisimulation through probabilistic testing (preliminary report)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms (preliminary report)
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Structured operational semantics as a specification language
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
Three logics for branching bisimulation
Journal of the ACM (JACM)
Bisimulation, the Supervisory Control Problem and StrongModel Matching for Finite State Machines
Discrete Event Dynamic Systems
Ordered SOS process languages for branching and Eager bisimulation
Information and Computation
Architecture-driven verification of concurrent systems
Nordic Journal of Computing
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
Process Languages for Rooted Eager Bisimulation
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Turing machines, transition systems, and interaction
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Turing machines, transition systems, and interaction
Information and Computation
Natural Quantum Operational Semantics with Predicates
International Journal of Applied Mathematics and Computer Science - Selected Problems of Computer Science and Control
Behavioural equivalences over migrating processes with timers
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Coordinating parallel mobile ambients to solve SAT problem in polynomial number of steps
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
| Hi-index | 0.00 |
Bisimulation is the primitive notion of equivalence between concurrent processes in Milner's Calculus of Communicating Systems (CCS); there is a nontrivial game-like protocol for distinguishing nonbisimular processes. In contrast, process distinguishability in Hoare's theory of Communicating Sequential Processes (CSP) is determined solely on the basis of traces of visible actions. We examine what additional operations are needed to explain bisimulation similarly—specifically in the case of finitely branching processes without silent moves. We formulate a general notion of Structured Operational Semantics for processes with Guarded recursion (GSOS), and demonstrate that bisimulation does not agree with trace congruence with respect to any set of GSOS-definable contexts. In justifying the generality and significance of GSOS's, we work out some of the basic proof theoretic facts which justify the SOS discipline.