Rewriting Systems for Reachability in Vector Addition Systems with Pairs

DOI10.1007/978-3-642-15349-5_9zbMath1287.68136OpenAlexW1492535103MaRDI QIDQ3584966

Virgile Mogbil, Paulin Jacobé de Naurois

Publication date: 31 August 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15349-5_9

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

This page was built for publication: Rewriting Systems for Reachability in Vector Addition Systems with Pairs