An automata-theoretic approach to branching-time model checking
From MaRDI portal
Publication:5385339
Recommendations
Cited in
(only showing first 100 items - show all)- Branching-time model-checking of probabilistic pushdown automata
- Modalities for model checking: Branching time logic strikes back
- Hierarchical cost-parity games
- Model Checking Quantitative Linear Time Logic
- Automata, Logic and Games for the $$\lambda $$ -Calculus
- An Operational Guide to Monitorability
- Improving parity games in practice
- Visibly linear temporal logic
- Run-Time Monitoring of Electronic Contracts
- ATL* Satisfiability Is 2EXPTIME-Complete
- Uniform strategies, rational relations and jumping automata
- The regular viewpoint on PA-processes
- Alternating automata: unifying truth and validity checking for temporal logics
- Model checking \(\omega \)-regular properties with decoupled search
- scientific article; zbMATH DE number 177521 (Why is no real title available?)
- Automata theory and model checking
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\)
- On the complexity of \(\mathsf{ATL}\) and \(\mathsf{ATL}^*\) module checking
- Relating word and tree automata
- Model Checking Information Flow in Reactive Systems
- Size-change termination and satisfiability for linear-time temporal logics
- Symbolic model checking for -calculus requires exponential time
- Model-checking graded computation-tree logic with finite path semantics
- On the universal and existential fragments of the \(\mu\)-calculus
- Enriched μ–Calculus Pushdown Module Checking
- Using assumptions to distribute CTL model checking
- Language-emptiness checking of alternating tree automata using symbolic reachability analysis
- Efficient timed model checking for discrete-time systems
- Multi-valued model checking games
- Improved model checking of hierarchical systems
- CTL^ with graded path modalities
- scientific article; zbMATH DE number 4056983 (Why is no real title available?)
- Quantifying Bounds in Strategy Logic
- On the Complexity of Branching-Time Logics
- Reasoning about sequences of memory states
- Conditions of contracts for separating responsibilities in heterogeneous systems
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)
- Formal Modeling and Analysis of Timed Systems
- Lattice Automata
- Complexity of weak acceptance conditions in tree automata.
- Module checking
- Specification and verification of data-driven Web applications
- Alternating-time temporal logics with linear past
- Model checking abilities of agents: a closer look
- How to translate efficiently extensions of temporal logics into alternating automata
- Results on alternating-time temporal logics with linear past
- PSPACE-completeness of modular supervisory control problems
- On decidability and complexity of low-dimensional robot games
- Weighted automata on infinite words in the context of attacker-defender games
- Synthesis of succinct systems
- Model measuring for discrete and hybrid systems
- Complexity of synthesis of composite service with correctness guarantee
- An automata-theoretic approach to infinite-state systems
- \textit{Once} and \textit{for all}
- Knowledge base exchange: the case of OWL 2 QL
- Temporal property verification as a program analysis task
- Coverage metrics for temporal logic model checking
- The Complexity of CTL* + Linear Past
- The descriptive complexity of modal \(\mu\) model-checking games
- Explaining counterexamples using causality
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Is your model checker on time? On the complexity of model checking for timed modal logics
- Temporal logic and fair discrete systems
- The modal \(\mu \)-calculus caught off guard
- Complexity results on branching-time pushdown model checking
- On the complexity of verifying concurrent transition systems
- Fair simulation
- Solving parity games using an automata-based algorithm
- Probabilistic temporal logics via the modal mu-calculus
- Permissive strategies: from parity games to safety games
- An automata-based approach for \(\text{CTL}^{*}\) with constraints
- Generalising automaticity to modal properties of finite structures
- A Parametrized Analysis of Algorithms on Hierarchical Graphs
- A parametric analysis of the state-explosion problem in model checking
- scientific article; zbMATH DE number 5051662 (Why is no real title available?)
- Diagnosability of fair transition systems
- A delayed promotion policy for parity games
- Cycle detection in computation tree logic
- A decidable class of problems for control under partial observation
- Verification, Model Checking, and Abstract Interpretation
- A delayed promotion policy for parity games
- Deciding the unguarded modal \(\mu\)-calculus
- Linear temporal logic symbolic model checking
- Query learning of derived \(\omega\)-tree languages in polynomial time
- scientific article; zbMATH DE number 2038755 (Why is no real title available?)
- scientific article; zbMATH DE number 7439738 (Why is no real title available?)
- Incremental reasoning on monadic second-order logics with logic programming
- Automata-Theoretic Model Checking Revisited
- Tool support for learning Büchi automata and linear temporal logic
- Fuzzy alternating Büchi automata over distributive lattices
- Obligation Blackwell games and p-automata
- Flow logic
- Taming strategy logic: non-recurrent fragments
- GSTE is partitioned model checking
- Branching-Time Temporal Logics with Minimal Model Quantifiers
- An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
- Model-checking iterated games
- On temporal logics with data variable quantifications: decidability and complexity
- Reasoning about equilibria in game-like concurrent systems
This page was built for publication: An automata-theoretic approach to branching-time model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385339)
