Transition and cancellation in concurrency and branching time
From MaRDI portal
Publication:4461212
DOI10.1017/S0960129503004031zbMath1088.68131OpenAlexW2166572420MaRDI QIDQ4461212
Publication date: 30 March 2004
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129503004031
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 (10)
ST-structures ⋮ Languages of higher-dimensional automata ⋮ Coalgebras, Chu spaces, and representations of physical systems ⋮ Big toy models. Representing physical systems as Chu spaces ⋮ Posets with interfaces as a model for concurrency ⋮ Unnamed Item ⋮ Causal dynamic inference ⋮ On the expressiveness of higher dimensional automata ⋮ Relating state-based and process-based concurrency through linear logic (full-version) ⋮ On the Specification of Higher Dimensional Automata
This page was built for publication: Transition and cancellation in concurrency and branching time
