CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68459OpenAlexW1737342522MaRDI QIDQ5897492

Robert J. van Glabbeek

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

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (15)

Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP ⋮ Configuration structures, event structures and Petri nets ⋮ Reversible computation in nets with bonds ⋮ A collective interpretation semantics for reversing Petri nets ⋮ Just testing ⋮ Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets ⋮ Abstract processes of place/transition systems ⋮ Unnamed Item ⋮ Memory associated with membranes systems ⋮ How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings ⋮ Spreading nets: a uniform approach to unfoldings ⋮ Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly ⋮ On the expressiveness of higher dimensional automata ⋮ Abstract processes and conflicts in place/transition systems ⋮ On Causal Semantics of Petri Nets

Uses Software

• Chaff

This page was built for publication: CONCUR 2005 – Concurrency Theory