scientific article; zbMATH DE number 3940713
From MaRDI portal
Publication:3711745
Recommendations
Cited in
(only showing first 100 items - show all)- Tool support for learning Büchi automata and linear temporal logic
- Verification of multiprocess probabilistic protocols
- Recognizing safety and liveness
- Problems concerning fairness and temporal logic for conflict-free Petri nets
- Completing the temporal picture
- Control machines: A new model of parallelism for compositional specifications and their effective compilation
- A model checker for linear time temporal logic
- Modelling knowledge and action in distributed systems
- Self-stabilizing extensions for message-passing systems
- An experience in proving regular networks of processes by modular model checking
- CTL^* and ECTL^* as fragments of the modal -calculus
- A branching time logic with past operators
- Safety, liveness and fairness in temporal logic
- Algorithms for monitoring real-time properties
- Finite-trace linear temporal logic: coinductive completeness
- A two-level temporal logic for evolving specifications.
- Specification in CTL + past for verification in CTL.
- MetateM: An introduction
- A transformation-based synthesis of temporal specification
- Model-based safety assessment of a triple modular generator with xSAP
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
- A logic-based approach to incremental reasoning on multi-agent systems
- \(\mathsf{GR}(1)\) is equivalent to \(\mathsf{R}(1)\)
- Back to the future: a fresh look at linear temporal logic
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators
- Guest editors' preface to special issue on interval temporal logics
- Compositional reasoning using intervals and time reversal
- On the expressiveness of TPTL and MTL
- An application of temporal projection to interleaving concurrency
- A survey on temporal logics for specifying and verifying real-time systems
- LTL is closed under topological closure
- Model checking with strong fairness
- An axiomatization of PCTL*
- Monitoring metric first-order temporal properties
- Past is for free: on the complexity of verifying linear temporal properties with past
- Temporal logics of knowledge and their applications in security
- The logic of ``initially and ``next: complete axiomatization and complexity
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- Weak Kripke structures and LTL
- Temporal logic and fair discrete systems
- Functional specification of hardware via temporal logic
- Linear-time temporal logic with event freezing functions
- scientific article; zbMATH DE number 4153903 (Why is no real title available?)
- An automata-theoretic approach to infinite-state systems
- On the Krohn-Rhodes cascaded decomposition theorem
- From Philosophical to Industrial Logics
- Bounded model checking of ETL cooperating with finite and looping automata connectives
- Decidability and incompleteness results for first-order temporal logics of linear time
- \textit{Once} and \textit{for all}
- scientific article; zbMATH DE number 1471238 (Why is no real title available?)
- scientific article; zbMATH DE number 1796144 (Why is no real title available?)
- An infinitary encoding of temporal equilibrium logic
- Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited
- Runtime verification of embedded real-time systems
- Model-checking timed temporal logics
- GPU schedulers: how fair is fair enough?
- A propositional dense time logic
- Multi-Valued Reasoning about Reactive Systems
- EPTL: a temporal logic for weakly consistent systems (short paper)
- scientific article; zbMATH DE number 7561320 (Why is no real title available?)
- Verification in continuous time by discrete reasoning
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems
- Proving the refuted: symbolic model checkers as proof generators
- Characterization of temporal property classes
- Alternating automata: unifying truth and validity checking for temporal logics
- scientific article; zbMATH DE number 7056237 (Why is no real title available?)
- Checking Temporal Properties of Discrete, Timed and Continuous Behaviors
- From Monadic Logic to PSL
- Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time
- Axioms for real-time logics
- From linear temporal logics to Büchi automata: the early and simple principle
- Modelling mutual exclusion in a process algebra with time-outs
- Bridging the gap between single- and multi-model predictive runtime verification
- A simple rewrite system for the normalization of linear temporal logic
- A first-order logic characterization of safety and co-safety languages
- Finite-trace and generalized-reactivity specifications in temporal synthesis
- A first-order logic characterisation of safety and co-safety languages
- An automata-theoretic approach to linear temporal logic
- SAT meets tableaux for linear temporal logic satisfiability
- Symbolic solution of Emerson-Lei games for reactive synthesis
- Succinctness of cosafety fragments of LTL via combinatorial proof systems
- Model checking reversible systems: forwardly
- On the power of automata minimization in reactive synthesis
- Expressiveness of extended bounded response \textsf{LTL}
- Interval logics and their decision procedures. I: An interval logic
- A hierarchy of temporal logics with past
- On using temporal logic for refinement and compositional verification of concurrent systems
- Asynchronous composition of LTL properties over infinite and finite traces
- The glory of the past and geometrical concurrency
- Explainability requirements as hyperproperties
- Planning for temporally extended goals in pure-past linear temporal logic
- Modal logic characterizations of forward, reverse, and forward-reverse bisimilarities
- Semantics for linear-time temporal logic with finite observations
- Efficient normalization of linear temporal logic
- Succinctness issues for \(\textsf{LTL}_{\textsf{f}}\) and safety and cosafety fragments of \textsf{LTL}
- A direct translation from LTL with past to deterministic Rabin automata
- An Efficient Normalisation Procedure for Linear Temporal Logic: Isabelle/HOL Formalisation
- On the strength of temporal proofs
- Branching versus linear logics yet again
- On regular temporal logics with past
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3711745)
