Pages that link to "Item:Q5055893"
From MaRDI portal
The following pages link to Petri nets, commutative context-free grammars, and basic parallel processes (Q5055893):
Displaying 8 items.
- On reachability equivalence for BPP-nets (Q1391745) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- Catalytic P systems, semilinear sets, and vector addition systems (Q1884955) (← links)
- Bisimulation equivalence is decidable for one-counter processes (Q4571985) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
- Linear constraint systems as high-level nets (Q6162101) (← links)
- Weak bisimulation and model checking for basic parallel processes (Q6567759) (← links)