Pages that link to "Item:Q3317085"
From MaRDI portal
The following pages link to Temporal logic can be more expressive (Q3317085):
Displaying 50 items.
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- Foundations of Boolean stream runtime verification (Q278752) (← links)
- Invariant-free clausal temporal resolution (Q352974) (← links)
- Bounded model checking of ETL cooperating with finite and looping automata connectives (Q364388) (← links)
- A complete proof system for propositional projection temporal logic (Q391223) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Parametric linear dynamic logic (Q515660) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects (Q633299) (← links)
- On Gabbay's temporal fixed point operator (Q673958) (← links)
- Visibly linear temporal logic (Q682377) (← links)
- A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata (Q685507) (← links)
- Variable and clause elimination for LTL satisfiability checking (Q748758) (← links)
- On the expressive power of temporal logic for infinite words (Q805240) (← links)
- Tableau-based automata construction for dynamic linear time temporal logic (Q862830) (← links)
- A mathematical framework for the semantics of symbolic languages representing periodic time (Q862832) (← links)
- On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025) (← links)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- A complete axiom system for propositional projection temporal logic with cylinder computation model (Q896162) (← links)
- SnS can be modally characterized (Q914397) (← links)
- Transformation of dynamic integrity constraints into transaction specifications (Q915441) (← links)
- Specification of communicating processes: temporal logic versus refusals-based refinement (Q931435) (← links)
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- On regular temporal logics with past (Q977176) (← links)
- Tool support for learning Büchi automata and linear temporal logic (Q1019031) (← links)
- Dual systems of tableaux and sequents for PLTL (Q1035676) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- Recognizing safety and liveness (Q1100884) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\) (Q1190479) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- Sequences, datalog, and transducers (Q1278034) (← links)
- Temporal connectives versus explicit timestamps to query temporal databases (Q1305921) (← links)
- A theory of timed automata (Q1322162) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- A branching time logic with past operators (Q1337463) (← links)
- Cut-free sequent and tableau systems for propositional Diodorean modal logics (Q1337606) (← links)
- Property preserving abstractions for the verification of concurrent systems (Q1346649) (← links)
- Axiomatising extended computation tree logic (Q1389439) (← links)
- On projective and separable properties (Q1389766) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Finite-trace linear temporal logic: coinductive completeness (Q1667649) (← links)
- Cycle detection in computation tree logic (Q1784962) (← links)
- Distributed synthesis for parameterized temporal logics (Q1784965) (← links)
- Visibly linear dynamic logic (Q1786616) (← links)
- Reasoning about strings in databases (Q1807679) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
