More Precise Partition Abstractions

DOI10.1007/978-3-540-69738-1_12zbMath1132.68469OpenAlexW1522480582MaRDI QIDQ5452605

Michael Huth, Harald Fecher

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Comparing disjunctive modal transition systems with an one-selecting variant

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

This page was built for publication: More Precise Partition Abstractions