Pages that link to "Item:Q1173681"
From MaRDI portal
The following pages link to Reduction and covering of infinite reachability trees (Q1173681):
Displaying 23 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Deciding safety properties in infinite-state pi-calculus via behavioural types (Q418155) (← links)
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- A well-structured framework for analysing Petri net extensions (Q1763373) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355) (← links)
- Commodification of accelerations for the Karp and Miller construction (Q2058566) (← links)
- Branch-well-structured transition systems and extensions (Q2165211) (← links)
- On the \(\omega\)-language expressive power of extended Petri nets (Q2491637) (← links)
- Verification of programs with half-duplex communication (Q2573635) (← links)
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS (Q2581762) (← links)
- Monotonic extensions of Petri nets: forward and backward search revisited (Q2842877) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- (Q5009453) (← links)
- Forward analysis for WSTS. III: Karp-Miller trees (Q5114831) (← links)
- (Q5136306) (← links)
- Well-structured transition systems everywhere! (Q5941101) (← links)
- Ensuring completeness of symbolic verification methods for infinite-state systems (Q5941104) (← links)
- Branch-well-structured transition systems and extensions (Q6563059) (← links)
