The following pages link to (Q5389997):
Displaying 21 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- Deciding safety properties in infinite-state pi-calculus via behavioural types (Q418155) (← links)
- Decidability and complexity of Petri nets with unordered data (Q554219) (← links)
- Multiset rewriting for the verification of depth-bounded processes with name binding (Q714507) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture (Q2822649) (← links)
- Ideal Abstractions for Well-Structured Transition Systems (Q2891435) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning (Q3011882) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
- (Q5009453) (← links)
- (Q5020648) (← links)
- (Q5089298) (← links)
- (Q5111627) (← links)
- (Q5114831) (← links)
- (Q5136306) (← links)
- The ideal view on Rackoff's coverability technique (Q5925512) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
