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.
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic (Q1854353) (← links)
- Module checking (Q1854407) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Vectorial languages and linear temporal logic (Q1884965) (← links)
- Past is for free: On the complexity of verifying linear temporal properties with past (Q1889855) (← links)
- Verification of a technical system model with linear temporal logic (Q1941912) (← links)
- Some results on parametric temporal logic (Q1944185) (← links)
- Temporal aspects of the modal logic of subset spaces (Q1960421) (← links)
- Using temporal logics to express search control knowledge for planning (Q1978242) (← links)
- Reasoning about action in polynomial time (Q1978466) (← links)
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\) (Q2029608) (← links)
- Temporal logic with recursion (Q2051830) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models (Q2095426) (← links)
- Satisfiability checking for mission-time \textsf{LTL} (MLTL) (Q2105410) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688) (← links)
- Social bot detection as a temporal logic model checking problem (Q2148829) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- On the complexity of linear temporal logic with team semantics (Q2193280) (← links)
- Multi-player games with LDL goals over finite traces (Q2225596) (← links)
- Theorem proving for pointwise metric temporal logic over the naturals via translations (Q2228435) (← links)
- Epistemic GDL: a logic for representing and reasoning about imperfect information games (Q2238622) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Transformation from PLTL to automata via NFGs (Q2253959) (← links)
- On the expressiveness of TPTL and MTL (Q2266987) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- Model checking Petri nets with MSVL (Q2279737) (← links)
- A novel approach to verifying context free properties of programs (Q2290651) (← links)
- Model checking for hybrid branching-time logics (Q2291813) (← links)
- Synthesis from hyperproperties (Q2303878) (← links)
- Iterated Boolean games (Q2346405) (← links)
- Taming past LTL and flat counter systems (Q2346416) (← links)
- Qualitative analysis of gene regulatory networks by temporal logic (Q2355694) (← links)
- Efficient timed model checking for discrete-time systems (Q2368994) (← links)
- The computational complexity of scenario-based agent verification and design (Q2372186) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- A brief account of runtime verification (Q2390027) (← links)
- The power of first-order quantification over states in branching and linear time temporal logics (Q2390310) (← links)
- From model checking to equilibrium checking: reactive modules for rational verification (Q2407463) (← links)
- Bounded variability of metric temporal logic (Q2408743) (← links)
- Parameterized linear temporal logics meet costs: still not costlier than LTL (Q2413483) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- A propositional linear time logic with time flow isomorphic to \(\omega^2\) (Q2447179) (← links)
- Probabilistic verification and approximation (Q2478551) (← links)
- The stuttering principle revisited (Q2484066) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- The complexity of agent design problems: Determinism and history dependence (Q2502156) (← links)
