CONCUR 2005 – Concurrency Theory
From MaRDI portal
Publication:5897487
DOI10.1007/11539452zbMath1134.68425OpenAlexW1737342522MaRDI QIDQ5897487
Jos C. M. Baeten, Mario Bravetti
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
Related Items
Duplication of constants in process algebra ⋮ Unnamed Item ⋮ Product line process theory ⋮ A Context-Free Process as a Pushdown Automaton ⋮ A Basic Parallel Process as a Parallel Pushdown Automaton ⋮ On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems ⋮ Branching bisimulation congruence for probabilistic systems ⋮ A Generic Process Algebra ⋮ Extensions of Standard Weak Bisimulation Machinery: Finite-state General Processes, Refinable Actions, Maximal-progress and Time
This page was built for publication: CONCUR 2005 – Concurrency Theory