The following pages link to (Q3711745):
Displaying 50 items.
- The logic of ``initially'' and ``next'': complete axiomatization and complexity (Q294659) (← links)
- Decentralised LTL monitoring (Q346789) (← links)
- Bounded model checking of ETL cooperating with finite and looping automata connectives (Q364388) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited (Q472810) (← links)
- Runtime verification of embedded real-time systems (Q479806) (← links)
- 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)
- On regular temporal logics with past (Q977176) (← 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)
- Algorithms for monitoring real-time properties (Q1647773) (← links)
- Finite-trace linear temporal logic: coinductive completeness (Q1667649) (← 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)
- Model-based safety assessment of a triple modular generator with xSAP (Q2026377) (← links)
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\) (Q2029608) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- \(\mathsf{GR}(1)\) is equivalent to \(\mathsf{R}(1)\) (Q2094389) (← links)
- Back to the future: a fresh look at linear temporal logic (Q2117656) (← links)
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators (Q2182731) (← links)
- Guest editors' preface to special issue on interval temporal logics (Q2251123) (← links)
- Compositional reasoning using intervals and time reversal (Q2251129) (← links)
- On the expressiveness of TPTL and MTL (Q2266987) (← links)
- An application of temporal projection to interleaving concurrency (Q2403529) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- LTL is closed under topological closure (Q2448112) (← links)
- Model checking with strong fairness (Q2505624) (← links)
- An axiomatization of PCTL* (Q2566222) (← links)
- Monitoring metric first-order temporal properties (Q2796403) (← links)
- Past is for free: on the complexity of verifying linear temporal properties with past (Q2842605) (← links)
- Temporal logics of knowledge and their applications in security (Q2866724) (← links)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
- Weak Kripke Structures and LTL (Q3090846) (← links)
