Pages that link to "Item:Q1341752"
From MaRDI portal
The following pages link to Reasoning about infinite computations (Q1341752):
Displayed 50 items.
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Efficient model checking for LTL with partial order snapshots (Q732005) (← links)
- On decidability properties of local sentences (Q860837) (← links)
- Tableau-based automata construction for dynamic linear time temporal logic (Q862830) (← links)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- Reasoning about XML with temporal logics and automata (Q975873) (← links)
- Strategy logic (Q979080) (← links)
- Classifying regular languages by a split game (Q1022599) (← links)
- Partitioned PLTL model-checking for refined transition systems (Q1023285) (← links)
- Before and after vacuity (Q1028732) (← links)
- From liveness to promptness (Q1039845) (← links)
- Complexity and succinctness issues for linear-time hybrid logics (Q1044839) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- Infinite trees and automaton-definable relations over \(\omega\)-words (Q1199531) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- Dynamic linear time temporal logic (Q1295431) (← links)
- Axiomatising extended computation tree logic (Q1389439) (← links)
- Unification of infinite sets of terms schematized by primal grammars (Q1392278) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
- PSPACE-completeness of modular supervisory control problems (Q1773103) (← links)
- Combining deduction and model checking into tableaux and algorithms for converse-PDL. (Q1854371) (← links)
- Verification by augmented finitary abstraction (Q1854391) (← links)
- Module checking (Q1854407) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Quantitative solution of omega-regular games (Q1887716) (← links)
- GSTE is partitioned model checking (Q2385196) (← links)
- A complete characterization of deterministic regular liveness properties (Q2465051) (← links)
- Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
- Alternating automata and temporal logic normal forms (Q2488275) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- The alternation hierarchy in fixpoint logic with chop is strict too (Q2509356) (← links)
- From complementation to certification (Q2575735) (← links)
- Relating word and tree automata (Q2576943) (← links)
- On the Unusual Effectiveness of Logic in Computer Science (Q2736585) (← links)
- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL (Q3183543) (← links)
- REASONING ABOUT TRANSFINITE SEQUENCES (Q3426789) (← links)
- Linear-Time Model Checking: Automata Theory in Practice (Q3503888) (← links)
- Mapping Properties of Heterogeneous Ontologies (Q3534659) (← links)
- The Quest for a Tight Translation of Büchi to co-Büchi Automata (Q3586001) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (Q3617729) (← links)
- On Omega-Languages Defined by Mean-Payoff Conditions (Q3617739) (← links)
- Synthesis from Component Libraries (Q3617743) (← links)
- Description Logics (Q3638996) (← links)