The following pages link to The Birth of Model Checking (Q3512430):
Displaying 14 items.
- A linear-time algorithm for the orbit problem over cyclic groups (Q303693) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Logical classification of distributed algorithms (Bakery algorithms as an example) (Q541220) (← links)
- Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing (Q736791) (← links)
- Static analysis and stochastic search for reachability problem (Q2229143) (← links)
- Safety preserving control synthesis for sampled data systems (Q2252964) (← links)
- Data-driven and model-based verification via Bayesian identification and reachability analysis (Q2409334) (← links)
- Transfer of Model Checking to Industrial Practice (Q3176381) (← links)
- A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models (Q4991932) (← links)
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (Q5175773) (← links)
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5918962) (← links)
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5925549) (← links)
- Constraint-based debugging in probabilistic model checking (Q6488104) (← links)
