Stable families of behavioural equivalences
From MaRDI portal
Publication:1119013
DOI10.1016/0304-3975(89)90065-0zbMath0669.68016OpenAlexW2046431537MaRDI QIDQ1119013
Publication date: 1989
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(89)90065-0
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- A linear-history semantics for languages for distributed programming
- Calculi for synchrony and asynchrony
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
- Extensional equivalences for transition systems
- A calculus of communicating systems
- A Theory of Communicating Sequential Processes