The following pages link to (Q3336675):
Displaying 50 items.
- Characteristic formulae for timed autoamta (Q2729632) (← links)
- Monitoring metric first-order temporal properties (Q2796403) (← links)
- Parameterized Complexity of CTL (Q2799205) (← links)
- Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
- Some Fixed-Point Issues in PPTL (Q2842634) (← links)
- Exogenous probabilistic computation tree logic (Q2870286) (← links)
- An Algorithm for Probabilistic Alternating Simulation (Q2891387) (← links)
- Analyzing Oscillatory Behavior with Formal Methods (Q2937728) (← links)
- rCOS: Defining Meanings of Component-Based Software Architectures (Q2948228) (← links)
- Formal Modelling, Analysis and Verification of Hybrid Systems (Q2948232) (← links)
- Efficiently Deciding μ-Calculus with Converse over Finite Trees (Q2957698) (← links)
- Refinement of Synchronizable Places with Multi-workflow Nets (Q3011886) (← links)
- Introduction to Model Checking (Q3176359) (← links)
- Model Checking Concurrent Programs (Q3176376) (← links)
- Combining Model Checking and Testing (Q3176377) (← links)
- Transfer of Model Checking to Industrial Practice (Q3176381) (← links)
- Functional Specification of Hardware via Temporal Logic (Q3176382) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- On the Hybrid Extension of CTL and CTL + (Q3182944) (← links)
- Compositional Control Synthesis for Partially Observable Systems (Q3184691) (← links)
- Dependences in Strategy Logic (Q3304133) (← links)
- Model Checking Exact Cost for Attack Scenarios (Q3304816) (← links)
- (Q3343431) (← links)
- (Q3384177) (← links)
- Enriched μ–Calculus Pushdown Module Checking (Q3498485) (← links)
- Distributed Synthesis for Alternating-Time Logics (Q3510801) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- Discriminative Model Checking (Q3512513) (← links)
- ATL* Satisfiability Is 2EXPTIME-Complete (Q3519515) (← 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)
- Inferring Synchronization under Limited Observability (Q3617756) (← links)
- Aspect Categories and Classes of Temporal Properties (Q3634732) (← links)
- Weighted versus Probabilistic Logics (Q3637211) (← links)
- Branching-Time Temporal Logics with Minimal Model Quantifiers (Q3637242) (← links)
- On the Complexity of Branching-Time Logics (Q3644771) (← links)
- Requirements, specifications, and minimal refinement (Q4916211) (← links)
- Verifying a Network Invariant for All Configurations of the Futurebus+ Cache Coherence Protocol (Q4921502) (← links)
- Model Theoretic Syntax and Parsing (Q4923571) (← links)
- (Q4972730) (← links)
- (Q4972740) (← links)
- (Q5013877) (← links)
- (Q5015276) (← links)
- (Q5021219) (← links)
- The Complexity of Linear-Time Temporal Logic Model Repair (Q5056073) (← links)
- Results on alternating-time temporal logics with linear past (Q5079770) (← links)
- Branching-time logics and fairness, revisited (Q5084315) (← links)
- A temporal logic for real-time partial-ordering with named transactions (Q5096355) (← links)
