Pages that link to "Item:Q1193891"
From MaRDI portal
The following pages link to A structure to decide reachability in Petri nets (Q1193891):
Displaying 38 items.
- Guiding Craig interpolation with domain-specific abstractions (Q300418) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525) (← links)
- Verification of membrane systems with delays via Petri nets with delays (Q496035) (← links)
- Extensional Petri net (Q667521) (← links)
- Bounded self-stabilizing Petri nets (Q1892714) (← links)
- Towards massively parallel computations in algebraic geometry (Q2040457) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- A lazy query scheme for reachability analysis in Petri nets (Q2117184) (← links)
- On detectability of labeled Petri nets and finite automata (Q2197590) (← links)
- Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
- Directed reachability for infinite-state systems (Q2233488) (← links)
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws (Q2325088) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Reachability Problems for Continuous Chemical Reaction Networks (Q2819133) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Finding a Witness Path for Non-liveness in Free-Choice Nets (Q3011888) (← links)
- ON YEN'S PATH LOGIC FOR PETRI NETS (Q3016216) (← links)
- Vector Addition System Reversible Reachability Problem (Q3090839) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
- On Yen’s Path Logic for Petri Nets (Q3646251) (← links)
- Selective petri net languages (Q4016902) (← links)
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings (Q4982096) (← links)
- Reachability in Petri Nets with Inhibitor Arcs (Q4982097) (← links)
- Unboundedness Problems for Languages of Vector Addition Systems. (Q5002804) (← links)
- (Q5002821) (← links)
- Coverability, Termination, and Finiteness in Recursive Petri Nets (Q5025058) (← links)
- Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws (Q5050755) (← links)
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States (Q5089288) (← links)
- (Q5089304) (← links)
- (Q5089313) (← links)
- (Q5111264) (← links)
- (Q5155664) (← links)
- Groups Whose Word Problem is a Petri Net Language (Q5500697) (← links)
- Long-Run Average Behavior of Vector Addition Systems with States (Q5875389) (← links)
- Applying CEGAR to the Petri Net State Equation (Q5892497) (← links)
