Readies and Failures in the Algebra of Communicating Processes
From MaRDI portal
Recommendations
Cited in
(19)- Specification-oriented semantics for communicating processes
- On the consistency of Koomen's fair abstraction rule
- Trace, failure and testing equivalences for communicating processes
- Global renaming operators in concrete process algebra
- Algebraic and fixed point equations over inverse limits of algebras
- Petri net semantics of priority systems
- Structured operational semantics and bisimulation as a congruence
- On deciding trace equivalences for processes
- Full abstraction and recursion
- A fully abstract model for the exchange of information in multi-agent systems.
- Towards general axiomatizations for bisimilarity and trace semantics
- scientific article; zbMATH DE number 3902016 (Why is no real title available?)
- scientific article; zbMATH DE number 3990852 (Why is no real title available?)
- scientific article; zbMATH DE number 4055005 (Why is no real title available?)
- scientific article; zbMATH DE number 1231586 (Why is no real title available?)
- On deciding some equivalences for concurrent processes
- scientific article; zbMATH DE number 1086670 (Why is no real title available?)
- scientific article; zbMATH DE number 1497789 (Why is no real title available?)
- Expansion laws for forward-reverse, forward, and reverse bisimilarities via proved encodings
This page was built for publication: Readies and Failures in the Algebra of Communicating Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833645)