scientific article; zbMATH DE number 4027441
From MaRDI portal
Publication:3768883
Recommendations
Cited in
(39)- From liveness to promptness
- Branching-time logics repeatedly referring to states
- Infinite trees and automaton-definable relations over -words
- Counting on CTL^*: On the expressive power of monadic path logic
- On temporal logic versus Datalog
- An infinite hierarchy of temporal logics over branching time
- Alternating-time temporal logics with linear past
- Temporal logic with recursion
- Formal logical language to set requirements for secure code execution
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
- Characterizing EF and EX tree logics
- An axiomatization of PCTL*
- scientific article; zbMATH DE number 1678388 (Why is no real title available?)
- An axiomatization of full computation tree logic
- Reasoning About Substructures and Games
- Functional specification of hardware via temporal logic
- Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
- Axiomatizing the Monodic Fragment of
- From Philosophical to Industrial Logics
- On the Complexity of Branching-Time Logics
- scientific article; zbMATH DE number 1114349 (Why is no real title available?)
- \textit{Once} and \textit{for all}
- Monadic second order logic as the model companion of temporal logic
- scientific article; zbMATH DE number 4119650 (Why is no real title available?)
- scientific article; zbMATH DE number 2113953 (Why is no real title available?)
- Model Theoretic Syntax and Parsing
- Results on alternating-time temporal logics with linear past
- A first-order complete temporal logic for structured context-free languages
- Dynamic logic of tree composition
- Limiting Until in ordered tree query languages
- From Monadic Logic to PSL
- The Common Fragment of ACTL and LTL
- The Complexity of CTL* + Linear Past
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- A hierarchy of temporal logics with past
- Automata-theoretic characterisations of branching-time temporal logics
- A clausal resolution method for branching-time logic \(\text{ECTL}^+\)
- SnS can be modally characterized
- Definability with bounded number of bound variables
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 Q3768883)