Petri nets, commutative context-free grammars, and basic parallel processes

DOI10.1007/3-540-60249-6_54OpenAlexW3023981071MaRDI QIDQ5055893

Javier Esparza

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60249-6_54

Mathematics Subject Classification ID

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

Related Items (7)

Catalytic P systems, semilinear sets, and vector addition systems ⋮ Bisimulation equivalence is decidable for one-counter processes ⋮ On reachability equivalence for BPP-nets ⋮ Linear constraint systems as high-level nets ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time ⋮ Model checking of systems with many identical timed processes ⋮ Decidability of bisimilarity for one-counter processes.

Cites Work

• Bisimulation equivalence is decidable for all context-free processes
• Semigroups, Presburger formulas, and languages
• Rational sets in commutative monoids
• Commutative grammars: The complexity of uniform word problems
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Petri nets, commutative context-free grammars, and basic parallel processes