The following pages link to (Q3940830):
Displaying 50 items.
- Logical vs. behavioural specifications (Q2304534) (← links)
- Next-preserving branching bisimulation (Q2355689) (← links)
- Compositional analysis for verification of parameterized systems (Q2368952) (← links)
- Model checking and synthesis for branching multi-weighted logics (Q2423760) (← links)
- On complexity of verification of interacting agents' behavior (Q2498917) (← links)
- Model checking with strong fairness (Q2505624) (← links)
- Probabilistic temporal logics via the modal mu-calculus (Q2566296) (← links)
- Structure-based deadlock checking of asynchronous circuits (Q2637261) (← links)
- Polynomial interrupt timed automata: verification and expressiveness (Q2662502) (← links)
- A proof system for unified temporal logic (Q2686105) (← links)
- Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Reasoning About Strategies (Q2946746) (← links)
- rCOS: Defining Meanings of Component-Based Software Architectures (Q2948228) (← links)
- Formal Modelling, Analysis and Verification of Hybrid Systems (Q2948232) (← links)
- Reasoning About Substructures and Games (Q2957764) (← links)
- Complete Abstractions and Subclassical Modal Logics (Q2961561) (← links)
- Temporal normal form for Linear Temporal Logic formulae1 (Q2988557) (← links)
- Runtime Verification of Component-Based Systems (Q3095241) (← links)
- Introduction to Model Checking (Q3176359) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- Combining Model Checking and Testing (Q3176377) (← links)
- Combining Model Checking and Deduction (Q3176378) (← links)
- Transfer of Model Checking to Industrial Practice (Q3176381) (← links)
- Dependences in Strategy Logic (Q3304133) (← links)
- (Q3343431) (← links)
- (Q3384177) (← links)
- Enriched μ–Calculus Pushdown Module Checking (Q3498485) (← links)
- Linear-Time Model Checking: Automata Theory in Practice (Q3503888) (← links)
- Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- CTL Model-Checking with Graded Quantifiers (Q3540061) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Tutorial on Model Checking: Modelling and Verification in Computer Science (Q3599190) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- ATL with Strategy Contexts and Bounded Memory (Q3605522) (← links)
- Branching-Time Temporal Logics with Minimal Model Quantifiers (Q3637242) (← links)
- (Q4972740) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- (Q5111621) (← links)
- Meanings of Model Checking (Q5187832) (← links)
- Smaller Abstractions for ∀CTL* without Next (Q5187833) (← links)
- Formal language properties of hybrid systems with strong resets (Q5190079) (← links)
- Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
- (Q5376664) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)
- Measuring and Synthesizing Systems in Probabilistic Environments (Q5501954) (← links)
- Calculational design of a regular model checker by abstract interpretation (Q5896884) (← links)
- Automatically verifying temporal properties of pointer programs with cyclic proof (Q5919481) (← links)
