CONCUR 2004 - Concurrency Theory
From MaRDI portal
Publication:5311485
DOI10.1007/b100113zbMath1099.68068OpenAlexW2499482941MaRDI QIDQ5311485
Jan Strejček, Vojtěch Řehák, Mojmír Křetínský
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100113
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (9)
Decidability issues for extended ping-pong protocols ⋮ Petri nets are less expressive than state-extended PA ⋮ On Decidability of LTL+Past Model Checking for Process Rewrite Systems ⋮ Tree regular model checking: a simulation-based approach ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ On decidability of LTL model checking for process rewrite systems ⋮ The Decidability of the Reachability Problem for CCS! ⋮ Reachability is decidable for weakly extended process rewrite systems ⋮ On Symbolic Verification of Weakly Extended PAD
This page was built for publication: CONCUR 2004 - Concurrency Theory
