Pages that link to "Item:Q5385339"
From MaRDI portal
The following pages link to An automata-theoretic approach to branching-time model checking (Q5385339):
Displaying 50 items.
- Knowledge base exchange: the case of OWL 2 QL (Q309909) (← links)
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Multi-valued model checking games (Q414899) (← links)
- Improved model checking of hierarchical systems (Q418123) (← links)
- Complexity of synthesis of composite service with correctness guarantee (Q439758) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Explaining counterexamples using causality (Q453516) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus (Q557788) (← links)
- Reasoning about sequences of memory states (Q636268) (← links)
- Visibly linear temporal logic (Q682377) (← links)
- Fuzzy alternating automata over distributive lattices (Q781276) (← links)
- Model checking \(\omega \)-regular properties with decoupled search (Q832281) (← links)
- Coverage metrics for temporal logic model checking (Q853721) (← links)
- Specification and verification of data-driven Web applications (Q878758) (← links)
- Pushdown module checking (Q968362) (← links)
- Tool support for learning Büchi automata and linear temporal logic (Q1019031) (← links)
- A decidable class of problems for control under partial observation (Q1041809) (← links)
- On the expressivity and complexity of quantitative branching-time temporal logics (Q1401306) (← links)
- On feasible cases of checking multi-agent systems behavior. (Q1401355) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- Symbolic model checking for \(\mu\)-calculus requires exponential time (Q1575656) (← links)
- Practical verification of multi-agent systems against \textsc{Slk} specifications (Q1641030) (← links)
- Graded modalities in strategy logic (Q1641034) (← links)
- Model-checking iterated games (Q1674862) (← links)
- Fuzzy alternating Büchi automata over distributive lattices (Q1678419) (← links)
- Conditions of contracts for separating responsibilities in heterogeneous systems (Q1742989) (← links)
- PSPACE-completeness of modular supervisory control problems (Q1773103) (← links)
- CTL\(^\ast\) with graded path modalities (Q1784942) (← links)
- A delayed promotion policy for parity games (Q1784960) (← links)
- Cycle detection in computation tree logic (Q1784962) (← links)
- Distributed automata in an assumption-commitment framework (Q1847547) (← links)
- Complexity of weak acceptance conditions in tree automata. (Q1853134) (← links)
- Module checking (Q1854407) (← links)
- Fair simulation (Q1854506) (← 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)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) (Q1989347) (← links)
- On decidability and complexity of low-dimensional robot games (Q2009641) (← links)
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) (Q2011666) (← links)
- Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
- Improving parity games in practice (Q2043434) (← links)
- Diagnosability of fair transition systems (Q2152493) (← links)
- Concurrent Kleene algebra with observations: from hypotheses to completeness (Q2200836) (← links)
- Hierarchical cost-parity games (Q2210523) (← links)
- Model-checking graded computation-tree logic with finite path semantics (Q2285155) (← links)
- Uniform strategies, rational relations and jumping automata (Q2346407) (← links)