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

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

Authors: 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

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

Cites Work

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

Cited In (8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055893)