More Precise Partition Abstractions
From MaRDI portal
Publication:5452605
DOI10.1007/978-3-540-69738-1_12zbMath1132.68469MaRDI QIDQ5452605
Publication date: 4 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69738-1_12
68Q45: Formal languages and automata
03B45: Modal logic (including the logic of norms)
03B70: Logic in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Results on the propositional \(\mu\)-calculus
- SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
- Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
- Tools and Algorithms for the Construction and Analysis of Systems
- Verification, Model Checking, and Abstract Interpretation
- Alternating tree automata, parity games, and modal \(\mu\)-calculus