Pages that link to "Item:Q3769957"
From MaRDI portal
The following pages link to The complexity of propositional linear temporal logics (Q3769957):
Displaying 50 items.
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- Generalized modal satisfiability (Q988571) (← links)
- Developing bounded reasoning (Q1006510) (← links)
- Before and after vacuity (Q1028732) (← links)
- Dual systems of tableaux and sequents for PLTL (Q1035676) (← links)
- Systems of agents controlled by logical programs: complexity of verification (Q1040334) (← links)
- Complexity and succinctness issues for linear-time hybrid logics (Q1044839) (← links)
- A multiprocess network logic with temporal and spatial modalities (Q1058846) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- Belief, awareness, and limited reasoning (Q1096610) (← links)
- Some simulation results as to weakly correlated processes (Q1096972) (← links)
- A decision procedure for combinations of propositional temporal logic and other specialized theories (Q1097264) (← links)
- Satisfiability in many-valued sentential logic is NP-complete (Q1100196) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
- TABLEAUX: A general theorem prover for modal logics (Q1181709) (← links)
- A model checker for linear time temporal logic (Q1192606) (← links)
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic (Q1209339) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- A modal perspective on the computational complexity of attribute value grammar (Q1314274) (← links)
- A branching time logic with past operators (Q1337463) (← links)
- Safety, liveness and fairness in temporal logic (Q1343862) (← links)
- The power of the ``always'' operator in first-order temporal logic (Q1350527) (← links)
- On projective and separable properties (Q1389766) (← links)
- Verification of relational transducers for electronic commerce (Q1394796) (← links)
- The complexity of the temporal logic with ``until'' over general linear time (Q1400578) (← links)
- On feasible cases of checking multi-agent systems behavior. (Q1401355) (← links)
- Spanning the spectrum from safety to liveness (Q1629750) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- Imperfect information in reactive modules games (Q1641035) (← links)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← links)
- Finite-trace linear temporal logic: coinductive completeness (Q1667649) (← links)
- An explicit transition system construction approach to LTL satisfiability checking (Q1707341) (← links)
- A first-order coalition logic for BDI-agents (Q1712430) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Model checking properties on reduced trace systems (Q1736621) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- On relative and probabilistic finite counterability (Q1742987) (← links)
- The complexity of counting models of linear-time temporal logic (Q1745344) (← links)
- An approach to infinitary temporal proof theory (Q1762733) (← links)
- Difficult configurations -- on the complexity of LTrL (Q1774566) (← links)
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
- Diagnosability of repairable faults (Q1788687) (← links)
- The price of universality (Q1815426) (← links)
- Minimal temporal epistemic logic (Q1815428) (← links)
- Product interval automata (Q1847544) (← links)
- A two-level temporal logic for evolving specifications. (Q1853062) (← links)
