The following pages link to (Q3711745):
Displayed 32 items.
- Interval logics and their decision procedures. I: An interval logic (Q671639) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- On using temporal logic for refinement and compositional verification of concurrent systems (Q674008) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- Branching versus linear logics yet again (Q911747) (← links)
- Tool support for learning Büchi automata and linear temporal logic (Q1019031) (← links)
- Verification of multiprocess probabilistic protocols (Q1079944) (← links)
- Recognizing safety and liveness (Q1100884) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- Completing the temporal picture (Q1176248) (← links)
- Control machines: A new model of parallelism for compositional specifications and their effective compilation (Q1177148) (← links)
- A model checker for linear time temporal logic (Q1192606) (← links)
- Modelling knowledge and action in distributed systems (Q1262142) (← links)
- Self-stabilizing extensions for message-passing systems (Q1310564) (← links)
- An experience in proving regular networks of processes by modular model checking (Q1323369) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- A branching time logic with past operators (Q1337463) (← links)
- Safety, liveness and fairness in temporal logic (Q1343862) (← links)
- A two-level temporal logic for evolving specifications. (Q1853062) (← links)
- Specification in CTL + past for verification in CTL. (Q1854327) (← links)
- MetateM: An introduction (Q1904643) (← links)
- A transformation-based synthesis of temporal specification (Q1906037) (← links)
- On the expressiveness of TPTL and MTL (Q2266987) (← links)
- Model checking with strong fairness (Q2505624) (← links)
- An axiomatization of PCTL* (Q2566222) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Decidability and incompleteness results for first-order temporal logics of linear time (Q4275689) (← links)
- Proving the Refuted: Symbolic Model Checkers as Proof Generators (Q5187831) (← links)
- Checking Temporal Properties of Discrete, Timed and Continuous Behaviors (Q5452193) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time (Q5505609) (← links)
- Axioms for real-time logics (Q5958467) (← links)