The following pages link to (Q4247290):
Displayed 18 items.
- The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525) (← links)
- Soundness of workflow nets: classification, decidability, and analysis (Q539433) (← links)
- The complexity of achievement and maintenance problems in agent-based systems (Q814461) (← links)
- Merged processes: a new condensed representation of Petri net behaviour (Q854679) (← links)
- Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm (Q958302) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- Structural soundness of workflow nets is decidable (Q1044705) (← links)
- A valuation-based analysis of conflict-free Petri nets (Q1605406) (← links)
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- An Algorithm for Direct Construction of Complete Merged Processes (Q3011883) (← links)
- Parameterized Complexity Results for 1-safe Petri Nets (Q3090841) (← links)
- Energy Games in Multiweighted Automata (Q3105747) (← links)
- The Complexity of Reversal-Bounded Model-Checking (Q3172883) (← links)
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets (Q3543285) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)
- A Practical Approach to Verification of Mobile Systems Using Net Unfoldings (Q5900141) (← links)
- Inheritance of behavior (Q5943265) (← links)