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.
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- The logic of ``initially'' and ``next'': complete axiomatization and complexity (Q294659) (← links)
- A note on a question of Peled and Wilke regarding stutter-invariant LTL (Q294841) (← links)
- Checking interval properties of computations (Q329413) (← links)
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- Decentralised LTL monitoring (Q346789) (← links)
- Branching-time logics with path relativisation (Q386037) (← links)
- Optimal bounds in parametric LTL games (Q391106) (← links)
- Temporal BI: proof system, semantics and translations (Q391122) (← links)
- Deciding safety and liveness in TPTL (Q402360) (← links)
- Temporal logics over linear time domains are in PSPACE (Q418122) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Interrupt timed automata: verification and expressiveness (Q453513) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Constraint LTL satisfiability checking without automata (Q472802) (← links)
- Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited (Q472810) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Parametric linear dynamic logic (Q515660) (← links)
- Nash equilibria in symmetric graph games with partial observation (Q528190) (← links)
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition (Q606997) (← links)
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- Reasoning about sequences of memory states (Q636268) (← links)
- The complexity of temporal logic over the reals (Q636345) (← links)
- Specifying and computing preferred plans (Q646542) (← links)
- Interval logics and their decision procedures. I: An interval logic (Q671639) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- On Gabbay's temporal fixed point operator (Q673958) (← links)
- Synthesis from component libraries with costs (Q683714) (← links)
- A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata (Q685507) (← links)
- Unification in linear temporal logic LTL (Q716499) (← links)
- Efficient model checking for LTL with partial order snapshots (Q732005) (← links)
- Variable and clause elimination for LTL satisfiability checking (Q748758) (← links)
- Bounded linear-time temporal logic: a proof-theoretic investigation (Q764266) (← links)
- On relation between linear temporal logic and quantum finite automata (Q783667) (← links)
- Global and local views of state fairness (Q804304) (← links)
- A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
- The complexity of achievement and maintenance problems in agent-based systems (Q814461) (← links)
- \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
- All finitely axiomatizable tense logics of linear time flows are coNP-complete (Q817685) (← links)
- Tableau-based automata construction for dynamic linear time temporal logic (Q862830) (← links)
- On the freeze quantifier in Constraint LTL: Decidability and complexity (Q868025) (← links)
- Quantitative temporal logics over the reals: PSpace and below (Q868030) (← links)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- The ins and outs of first-order runtime verification (Q888417) (← links)
- Reasoning about networks with many identical finite state processes (Q921983) (← links)
- Simple interpretations among complicated theories (Q923068) (← links)
- Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms (Q929294) (← links)
- Linear temporal logic with until and next, logical consecutions (Q947268) (← links)
