The Equational Theory of Weak Complete Simulation Semantics over BCCSP

DOI10.1007/978-3-642-27660-6_12zbMath1298.68161OpenAlexW1600867438MaRDI QIDQ2891363

Luca Aceto, Carlos Gregorio Rodríguez, Anna Ingólfsdóttir, David de Frutos-Escrig

Publication date: 15 June 2012

Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27660-6_12

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Axiomatizing weak simulation semantics over BCCSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finite alphabets and infinite bases
• Lifting non-finite axiomatizability results to extensions of process algebras
• Bisimulation through probabilistic testing
• A complete axiomatisation for observational congruence of finite-state behaviours
• Turning SOS rules into equations
• The origins of structural operational semantics
• Axiomatizing GSOS with termination
• On the Unification of Process Semantics: Equational Semantics
• Axiomatizing Weak Ready Simulation Semantics over BCCSP
• On the Axiomatizability of Impossible Futures
• Process algebra for synchronous communication
• Algebraic laws for nondeterminism and concurrency
• Bisimulation can't be traced
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: The Equational Theory of Weak Complete Simulation Semantics over BCCSP