CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68457OpenAlexW1737342522MaRDI QIDQ5897489

David de Frutos-Escrig, Carlos Gregorio Rodríguez

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11539452

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Ready to preorder: an algebraic and general proof, Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences, Processes as formal power series: a coinductive approach to denotational semantics, New Bisimulation Semantics for Distributed Systems, On the Unification of Process Semantics: Equational Semantics, (Bi)simulations up-to characterise process semantics, Simulations Up-to and Canonical Preorders