Pages that link to "Item:Q3677184"

The following pages link to An Algorithm for the General Petri Net Reachability Problem (Q3677184):

Displaying 50 items.

• Process rewrite systems. (Q1854328) (← links)
• Bounded self-stabilizing Petri nets (Q1892714) (← links)
• Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
• Linear logic automata (Q1919766) (← links)
• Petri nets and regular processes (Q1970202) (← 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)
• Static analysis and stochastic search for reachability problem (Q2229143) (← links)
• Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
• Petri net representation and reachability analysis of 0--1 integer linear programming problems (Q2293169) (← links)
• Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
• Reachability analysis of low-order discrete state reaction networks obeying conservation laws (Q2325088) (← links)
• Characterization and complexity results on jumping finite automata (Q2357104) (← links)
• Alternating two-way AC-tree automata (Q2373699) (← links)
• Incremental construction of coverability graphs (Q2379973) (← links)
• Type-based information flow analysis for the \(\pi\)-calculus (Q2581011) (← links)
• Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
• On complexity of reachability of transition restricted Petri nets (Q2733997) (← links)
• Rewriting in the partial algebra of typed terms modulo AC (Q2842873) (← links)
• A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
• Deciding Structural Liveness of Petri Nets (Q2971127) (← links)
• Honesty by Typing (Q2974791) (← links)
• Finding a Witness Path for Non-liveness in Free-Choice Nets (Q3011888) (← links)
• Communicating processes, scheduling, and the complexity of nontermination (Q3034829) (← links)
• TOWARD UNDERSTANDING THE GENERATIVE CAPACITY OF ERASING RULES IN MATRIX GRAMMARS (Q3086247) (← links)
• On the Relationship between π-Calculus and Finite Place/Transition Petri Nets (Q3184693) (← links)
• Weak Time Petri Nets Strike Back! (Q3184699) (← links)
• Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
• Minimal Cost Reachability/Coverability in Priced Timed Petri Nets (Q3617740) (← links)
• Erasing in Petri Net Languages and Matrix Grammars (Q3637250) (← links)
• (Q4206565) (← links)
• Petri net models of flexible and automated manufacturing systems: a survey (Q4230288) (← links)
• Tableau methods for PA-processes (Q4610333) (← links)
• Deciding properties of integral relational automata (Q4632414) (← links)
• Separability of Reachability Sets of Vector Addition Systems (Q4636622) (← links)
• Reachability in Petri Nets with Inhibitor Arcs (Q4982097) (← links)
• (Q5002821) (← links)
• (Q5009428) (← links)
• Coverability, Termination, and Finiteness in Recursive Petri Nets (Q5025058) (← links)
• (Q5028474) (← links)
• Any ground associative-commutative theory has a finite canonical system (Q5055779) (← links)
• On polynomial ideals, their complexity, and applications (Q5055880) (← links)
• (Q5089304) (← links)
• (Q5089313) (← links)
• (Q5089315) (← links)
• Non axiomatisability of positive relation algebras with constants, via graph homomorphisms (Q5089316) (← links)
• Decidability of weak fairness in petri nets (Q5096177) (← links)
• Handles and reachability analysis of free choice nets (Q5096369) (← links)
• High undecidability of weak bisimilarity for Petri nets (Q5096742) (← links)