Pages that link to "Item:Q1123183"
From MaRDI portal
The following pages link to Characterizing finite Kripke structures in propositional temporal logic (Q1123183):
Displaying 20 items.
- Partial-Order Reduction (Q3176364) (← links)
- Abstraction and Abstraction Refinement (Q3176371) (← links)
- Computing Stuttering Simulations (Q3184698) (← links)
- Branching vs. Linear Time: Semantical Perspective (Q3510781) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment (Q3624601) (← links)
- Bisimilarity Minimization in O(m logn) Time (Q3636842) (← links)
- Formal Verification for Components and Connectors (Q3638992) (← links)
- Equivalences for fair Kripke structures (Q4632440) (← links)
- Behavioural characterizations of partial order logics (Q5055959) (← links)
- Geometric Model Checking of Continuous Space (Q5060193) (← links)
- (Q5089272) (← links)
- Smaller Abstractions for ∀CTL* without Next (Q5187833) (← links)
- An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211) (← links)
- On Reasoning About Rings (Q5696925) (← links)
- Well-structured transition systems everywhere! (Q5941101) (← links)
- State equivalences for rectangular hybrid automata (Q6162103) (← links)
- A Markovian model for the spread of the SARS-CoV-2 virus (Q6164030) (← links)
- On bisimilarity for polyhedral models and \texttt{SLCS} (Q6535467) (← links)
- Modal and temporal logics for processes (Q6560391) (← links)