Temporal logic can be more expressive
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Tool support for learning Büchi automata and linear temporal logic
- Dual systems of tableaux and sequents for PLTL
- Process logic with regular formulas
- The complementation problem for Büchi automata with applications to temporal logic
- Recognizing safety and liveness
- TABLEAUX: A general theorem prover for modal logics
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\)
- An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages
- Sequences, datalog, and transducers
- Temporal connectives versus explicit timestamps to query temporal databases
- A theory of timed automata
- CTL^* and ECTL^* as fragments of the modal -calculus
- A branching time logic with past operators
- Cut-free sequent and tableau systems for propositional Diodorean modal logics
- Property preserving abstractions for the verification of concurrent systems
- Axiomatising extended computation tree logic
- On projective and separable properties
- Mathematical modal logic: A view of its evolution
- Finite-trace linear temporal logic: coinductive completeness
- Cycle detection in computation tree logic
- Distributed synthesis for parameterized temporal logics
- Visibly linear dynamic logic
- Reasoning about strings in databases
- The complexity of propositional linear temporal logics in simple cases
- A generalized time quantifier approach to approximate reasoning
- Interpreting message flow graphs
- Almost event-rate independent monitoring
- Regular \(\omega\)-languages with an informative right congruence
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
- Temporal logic with recursion
- Incorporating monitors in reactive synthesis without paying the price
- Temporal logics with language parameters
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Verification of concurrent programs: The automata-theoretic framework
- Compositional verification of asynchronous concurrent systems using CADP
- A goal-directed decision procedure for hybrid PDL
- On the expressive power of temporal logic
- Bounded model checking of infinite state systems
- The computational complexity of scenario-based agent verification and design
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Model checking of pushdown systems for projection temporal logic
- Expressiveness of propositional projection temporal logic with star
- LTL is closed under topological closure
- A decision procedure for propositional projection temporal logic with infinite models
- The stuttering principle revisited
- Bridging the gap between fair simulation and trace inclusion
- Characterizing CTL-like logics on finite trees.
- LTL over integer periodicity constraints
- From complementation to certification
- Complexity of modal logics with Presburger constraints
- Robust, expressive, and quantitative linear temporal logics: pick any two for free
- Knowledge forgetting in propositional \(\mu\)-calculus
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- Foundations of Boolean stream runtime verification
- Expressive completeness for LTL with modulo counting and group quantifiers
- Egalitarian State-Transition Systems
- Axiomatic semantics of projection temporal logic programs
- Expressive completeness of modal logic on binary ramified frames
- Size-change termination and satisfiability for linear-time temporal logics
- Temporal logic and fair discrete systems
- Functional specification of hardware via temporal logic
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05
- One-Pass Tableaux for Computation Tree Logic
- Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
- Invariant-free clausal temporal resolution
- From Philosophical to Industrial Logics
- Complexity of propositional projection temporal logic with star
- A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time
- Bounded model checking of ETL cooperating with finite and looping automata connectives
- A complete proof system for propositional projection temporal logic
- Temporal logics of “the next” do not have the beth property
- Decidability and incompleteness results for first-order temporal logics of linear time
- \textit{Once} and \textit{for all}
- scientific article; zbMATH DE number 1927553 (Why is no real title available?)
- Separation logics and modalities: a survey
- Serializable histories in quantified propositional temporal logic
- Linear temporal logic symbolic model checking
- scientific article; zbMATH DE number 1863182 (Why is no real title available?)
- Property-based testing for Spark Streaming
- An on-the-fly tableau-based decision procedure for PDL-satisfiability
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- scientific article; zbMATH DE number 7439738 (Why is no real title available?)
- Robust, expressive, and quantitative linear temporal logics: pick any two for free
- A derivation-loop method for temporal logic
- A propositional dense time logic
- On the Model Checking Problem for Some Extension of CTL*
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- Suitability of the propositional temporal logic to express properties of real-time systems
- Parametric linear dynamic logic
- Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations
- Distributed event clock automata (extended abstract)
- Cascade Products and Temporal Logics on Finite Trees
- Expressive completeness of separation logic with two variables and no separating conjunction
- From Monadic Logic to PSL
- Automata-Theoretic Model Checking Revisited
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
- BÜCHI COMPLEMENTATION MADE TIGHTER
- On the Satisfiability and Model Checking for one Parameterized Extension of Linear-time Temporal Logic
- Axiomatising extended computation tree logic
This page was built for publication: Temporal logic can be more expressive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3317085)
