Model Checking for Action Abstraction
From MaRDI portal
Recommendations
Cites work
- A calculus of communicating systems
- Action refinement.
- Alternating tree automata, parity games, and modal -calculus
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- scientific article; zbMATH DE number 3648682 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 108007 (Why is no real title available?)
- scientific article; zbMATH DE number 1759610 (Why is no real title available?)
- Labelled transition systems as a Stone space
- Lattice Automata
- Latticed Simulation Relations and Games
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Model Checking Games for Branching Time Logics
- Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
- Refinement of actions and equivalence notions for concurrent systems
- Refinement sensitive formal semantics of state machines with persistent choice
- Results on the propositional \(\mu\)-calculus
Cited in
(4)
This page was built for publication: Model Checking for Action Abstraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452711)