Communicating sequential processes
Communicating sequential processes
Extensional equivalence for transition systems
Acta Informatica
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
A calculus of mobile processes, II
Information and Computation
Communication and Concurrency
Algebraic Theory of Processes
CSP, partial automata, and coalgebras
Theoretical Computer Science
Compositional SOS and beyond: a coalgebraic view of open systems
Theoretical Computer Science
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
Theoretical Computer Science - Selected papers of CMCS'03
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
Trace Semantics for Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
Context-free languages via coalgebraic trace semantics
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
On the Unification of Process Semantics: Observational Semantics
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Towards bialgebraic semantics for the linear time --- branching time spectrum
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Final Semantics for Decorated Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.23 |
We characterize must testing equivalence on CSP in terms of the unique homomorphism from the Moore automaton of CSP processes to the final Moore automaton of partial formal power series over a certain semiring. The final automaton is then turned into a CSP-algebra: operators and fixpoints are defined, respectively, via behavioural differential equations and simulation relations. This structure is then shown to be preserved by the final homomorphism. As a result, we obtain a fully abstract compositional model of CSP phrased in purely set-theoretical terms.