Pages that link to "Item:Q1327383"
From MaRDI portal
The following pages link to A partial approach to model checking (Q1327383):
Displaying 22 items.
- Model-checking games for fixpoint logics with partial order models (Q532389) (← links)
- Monadic partition logics and finite automata (Q671644) (← links)
- A stubborn attack on state explosion (Q685106) (← links)
- Permutation rewriting and algorithmic verification (Q865624) (← links)
- Symbolic model checking: \(10^{20}\) states and beyond (Q1193587) (← links)
- A technique of state space search based on unfolding (Q1346650) (← links)
- On projective and separable properties (Q1389766) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- Deciding global partial-order properties (Q1774565) (← links)
- Using partial orders for the efficient verification of deadlock freedom and safety properties (Q1801499) (← links)
- On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties (Q1951607) (← links)
- Using approximation for the verification of token-scaling models (Q2163772) (← links)
- LTL under reductions with weaker conditions than stutter invariance (Q2165225) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- An application of temporal projection to interleaving concurrency (Q2403529) (← links)
- Partial Order Reduction for Rewriting Semantics of Programming Languages (Q2873775) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- REASONING ABOUT TRANSFINITE SEQUENCES (Q3426789) (← links)
- Efficiency of automata in semi-commutation verification techniques (Q3515458) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Specification Languages for Stutter-Invariant Regular Properties (Q3648702) (← links)
- A tableau proof system for a mazurkiewicz trace logic with fixpoints (Q4610334) (← links)
