Pages that link to "Item:Q1341752"
From MaRDI portal
The following pages link to Reasoning about infinite computations (Q1341752):
Displayed 50 items.
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Bounded model checking of ETL cooperating with finite and looping automata connectives (Q364388) (← links)
- Branching-time logics with path relativisation (Q386037) (← links)
- Automata-theoretic decision of timed games (Q386611) (← links)
- An interface theory for service-oriented design (Q407507) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Symbolic bounded synthesis (Q453535) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited (Q472810) (← links)
- Quantitative model-checking of controlled discrete-time Markov processes (Q515573) (← links)
- Parametric linear dynamic logic (Q515660) (← links)
- Infinite games with finite knowledge gaps (Q528188) (← links)
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects (Q633299) (← links)
- Reasoning about sequences of memory states (Q636268) (← links)
- Visibly linear temporal logic (Q682377) (← links)
- \(\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)
- Spanning the spectrum from safety to liveness (Q1629750) (← links)
- When are stochastic transition systems tameable? (Q1648646) (← links)
- Safraless LTL synthesis considering maximal realizability (Q1674867) (← links)
- Latticed-LTL synthesis in the presence of noisy inputs (Q1677194) (← links)
- Fuzzy alternating Büchi automata over distributive lattices (Q1678419) (← links)
- On relative and probabilistic finite counterability (Q1742987) (← links)
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
- PSPACE-completeness of modular supervisory control problems (Q1773103) (← links)
- CTL\(^\ast\) with graded path modalities (Q1784942) (← links)
- Distributed synthesis for parameterized temporal logics (Q1784965) (← links)
- Visibly linear dynamic logic (Q1786616) (← links)
- Combining deduction and model checking into tableaux and algorithms for converse-PDL. (Q1854371) (← links)