Pages that link to "Item:Q5308436"
From MaRDI portal
The following pages link to Tools and Algorithms for the Construction and Analysis of Systems (Q5308436):
Displaying 9 items.
- A transformation-based approach to implication of GSTE assertion graphs (Q364478) (← links)
- On relative and probabilistic finite counterability (Q1742987) (← links)
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
- Certifying DFA bounds for recognition and separation (Q2147179) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- From complementation to certification (Q2575735) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Resource bound certification (Q5178852) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)