Pages that link to "Item:Q5212744"
From MaRDI portal
The following pages link to The reachability problem for Petri nets is not elementary (Q5212744):
Displayed 28 items.
- The complexity of verifying population protocols (Q2025857) (← links)
- Towards efficient verification of population protocols (Q2058386) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- Finding cut-offs in leaderless rendez-vous protocols is easy (Q2233393) (← links)
- Leafy automata for higher-order concurrency (Q2233404) (← links)
- Directed reachability for infinite-state systems (Q2233488) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343) (← links)
- Recent advances on reachability problems for valence systems (invited talk) (Q2695487) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- Coverability, Termination, and Finiteness in Recursive Petri Nets (Q5025058) (← links)
- On Affine Reachability Problems (Q5089216) (← links)
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States (Q5089288) (← links)
- (Q5089304) (← links)
- (Q5089305) (← links)
- (Q5089313) (← links)
- (Q5089315) (← links)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms (Q5089316) (← links)
- PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets (Q5100757) (← links)
- Open Petri nets (Q5139283) (← links)
- (Q5207052) (← links)
- Long-Run Average Behavior of Vector Addition Systems with States (Q5875389) (← links)
- Continuous One-counter Automata (Q5875944) (← links)
- A Note on C² Interpreted over Finite Data-Words (Q6060103) (← links)
- Set augmented finite automata over infinite alphabets (Q6067325) (← links)
- Coverability in 2-VASS with one unary counter is in NP (Q6091190) (← links)
- Separators in continuous Petri nets (Q6181924) (← links)