Symbolic model checking in non-Boolean domains
From MaRDI portal
Recommendations
Cites work
- A classification of symbolic transition systems
- A survey of stochastic -regular games
- A theory of timed automata
- Abstract interpretation and application to logic programs
- An Antichain Algorithm for LTL Realizability
- Antichain algorithms for finite automata
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Antichains and compositional algorithms for LTL synthesis
- Antichains for the Automata-Based Approach to Model-Checking
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Approximating the value of a concurrent reachability game in the polynomial time hierarchy
- Better Quality in Synthesis through Quantitative Objectives
- Borel determinacy
- CONCUR 2005 – Concurrency Theory
- Concurrent reachability games
- CTL^* and ECTL^* as fragments of the modal -calculus
- Finding and fixing faults
- From pre-historic to post-modern symbolic model checking
- From program verification to program synthesis
- Game Refinement Relations and Metrics
- Game theory
- Grammar Analysis and Parsing by Abstract Interpretation
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 1670791 (Why is no real title available?)
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 3885321 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 1361128 (Why is no real title available?)
- scientific article; zbMATH DE number 1361131 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1962849 (Why is no real title available?)
- scientific article; zbMATH DE number 1754609 (Why is no real title available?)
- scientific article; zbMATH DE number 1765703 (Why is no real title available?)
- scientific article; zbMATH DE number 1863183 (Why is no real title available?)
- scientific article; zbMATH DE number 1903379 (Why is no real title available?)
- scientific article; zbMATH DE number 2209335 (Why is no real title available?)
- Model checking discounted temporal properties
- Model Checking Quantitative Linear Time Logic
- New results on quantifier elimination over real closed fields and applications to constraint databases
- On the synthesis of discrete controllers for timed systems
- On the synthesis of strategies in infinite games
- Programming with angelic nondeterminism
- Qualitative concurrent parity games
- Quantitative languages
- Quantitative solution of omega-regular games
- Quantitative verification and control via the mu-calculus.
- Reasoning about infinite computations
- Results on the propositional \(\mu\)-calculus
- STACS 2004
- Symbolic model checking: \(10^{20}\) states and beyond
- Synthesis of Reactive(1) designs
- The complexity of quantitative concurrent parity games
- The determinacy of Blackwell games
- The element of surprise in timed games.
- The modal mu-calculus alternation hierarchy is strict
- The octagon abstract domain
- Theory of games and economic behavior.
- Topology and descriptive set theory
- Uppaal in a nutshell
- Value Iteration
- Well-structured transition systems everywhere!
- What's decidable about hybrid automata?
Cited in
(16)- Symbolic model checking: \(10^{20}\) states and beyond
- A symbolic semantics for abstract model checking
- From pre-historic to post-modern symbolic model checking
- Computable fixpoints in well-structured symbolic model checking
- Model checking for symbolic-heap separation logic with inductive predicates
- Combining Model Checking and Deduction
- Symbolic Model Checking for Dynamic Epistemic Logic
- scientific article; zbMATH DE number 1222405 (Why is no real title available?)
- Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*
- scientific article; zbMATH DE number 2086974 (Why is no real title available?)
- Symbolic model checking of public announcement protocols
- Application of Wu's method to symbolic model checking
- Computer Aided Verification
- Model Checking Software
- A Symbolic Model Checking Framework for Safety Analysis, Diagnosis, and Synthesis
- Symbolic model checking with rich assertional languages
This page was built for publication: Symbolic model checking in non-Boolean domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176389)
