CONCUR 2004 - Concurrency Theory

DOI10.1007/b100113zbMath1099.68071OpenAlexW2499482941MaRDI QIDQ5311488

Jérôme Leroux, Grégoire Sutre

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

Mathematics Subject Classification ID

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

Related Items (13)

Forward analysis and model checking for trace bounded WSTS ⋮ Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic ⋮ On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension ⋮ Equivalence between model-checking flat counter systems and Presburger arithmetic ⋮ Coverability in 2-VASS with one unary counter is in NP ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ Ambiguity, weakness, and regularity in probabilistic Büchi automata ⋮ Bounded underapproximations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Flat Petri nets (invited talk)

Uses Software

• TREX

This page was built for publication: CONCUR 2004 - Concurrency Theory