Pages that link to "Item:Q4982097"
From MaRDI portal
The following pages link to Reachability in Petri Nets with Inhibitor Arcs (Q4982097):
Displaying 24 items.
- Undecidability of performance equivalence of Petri nets (Q507373) (← links)
- Reduction rules for reset/inhibitor nets (Q847264) (← links)
- Analysis issues in Petri nets with inhibitor arcs (Q1606123) (← links)
- Domain and event structure semantics for Petri nets with read and inhibitor arcs (Q1882900) (← links)
- Theory of reaction automata: a survey (Q1983008) (← links)
- A lazy query scheme for reachability analysis in Petri nets (Q2117184) (← links)
- The emptiness problem for valence automata over graph monoids (Q2662504) (← links)
- Approximating Petri net reachability along context-free traces (Q2911620) (← links)
- Small universal deterministic Petri nets with inhibitors arcs (Q3178869) (← links)
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (Q3449486) (← links)
- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets (Q3617740) (← links)
- MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS (Q3646165) (← links)
- (Q4835904) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- (Q5009428) (← links)
- Coverability, Termination, and Finiteness in Recursive Petri Nets (Q5025058) (← links)
- (Q5089304) (← links)
- (Q5090970) (← links)
- On Petri Nets with Hierarchical Special Arcs (Q5111656) (← links)
- (Q5155662) (← links)
- (Q5207052) (← links)
- Applications and Theory of Petri Nets 2004 (Q5712345) (← links)
- On the reversibility of circular conservative Petri nets (Q6535198) (← links)
- The complexity of bidirected reachability in valence systems (Q6649456) (← links)
