Petri nets, commutative context-free grammars, and basic parallel processes
From MaRDI portal
Cites work
- A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
- Bisimulation equivalence is decidable for all context-free processes
- Commutative grammars: The complexity of uniform word problems
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 47952 (Why is no real title available?)
- scientific article; zbMATH DE number 1555184 (Why is no real title available?)
- scientific article; zbMATH DE number 827979 (Why is no real title available?)
- scientific article; zbMATH DE number 1414283 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- Rational sets in commutative monoids
- Semigroups, Presburger formulas, and languages
Cited in
(9)- On reachability equivalence for BPP-nets
- Model checking of systems with many identical timed processes
- Decidability of bisimilarity for one-counter processes.
- Catalytic P systems, semilinear sets, and vector addition systems
- Bisimulation equivalence is decidable 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
- Weak bisimulation and model checking for basic parallel processes
- Regular model checking for systems with effectively regular reachability relation
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)
