\(\tau\)-bisimulations and full abstraction for refinement of actions

DOI10.1016/0020-0190(91)90081-RzbMath0743.68060OpenAlexW2000630835MaRDI QIDQ1183474

S. Singh

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90081-r

zbMATH Keywords

formal semanticsbisimulationconcurrencyrefinement of actions

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items

Branching bisimilarity is an equivalence indeed!, Maximality preserving bisimulation

Cites Work

• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• Maximality preserving bisimulation
• Axiomatising Finite Concurrent Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item