Model Checking for Action Abstraction

DOI10.1007/978-3-540-78163-9_13zbMath1138.68447OpenAlexW1578451176MaRDI QIDQ5452711

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-78163-9_13

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Results on the propositional \(\mu\)-calculus
• A calculus of communicating systems
• Model checking and abstraction to the aid of parameterized systems (a survey)
• Refinement Sensitive Formal Semantics of State Machines With Persistent Choice
• Model Checking Games for Branching Time Logics
• Latticed Simulation Relations and Games
• Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
• Labelled transition systems as a Stone space
• Lattice Automata
• Refinement of actions and equivalence notions for concurrent systems
• Alternating tree automata, parity games, and modal \(\mu\)-calculus

This page was built for publication: Model Checking for Action Abstraction