Pages that link to "Item:Q3067860"
From MaRDI portal
The following pages link to Well (and Better) Quasi-Ordered Transition Systems (Q3067860):
Displaying 17 items.
- Quasi-deterministic 0L systems and their representation (Q672456) (← links)
- Analysis of the structure of attributed transition systems without hidden transitions (Q681892) (← links)
- Lost in abstraction: monotonicity in multi-threaded programs (Q729809) (← links)
- Delay-bounded scheduling without delay! (Q832185) (← links)
- A note on well quasi-orderings for powersets (Q1607015) (← links)
- Attributed transition systems with hidden transitions (Q1709456) (← links)
- Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355) (← links)
- Unbounded-Thread Program Verification using Thread-State Equations (Q2817949) (← links)
- Monotonic abstraction for programs with multiply-linked structures (Q2841994) (← links)
- Carrying Probabilities to the Infinite World (Q3090817) (← links)
- (Q3130550) (← links)
- (Q4260382) (← links)
- A classification of symbolic transition systems (Q5277714) (← links)
- (Q5367063) (← links)
- (Q5394328) (← links)
- Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models (Q6535632) (← links)
- Well partial orders (Q6612816) (← links)