A framework for intuitionistic modal logics
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Action refinement in process algebras
Action refinement in process algebras
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
The Existence of Finite Abstractions for Branching Time Model Checking
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Latticed simulation relations and games
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Ranked predicate abstraction for branching time: complete, incremental, and precise
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Model checking and abstraction to the aid of parameterized systems (a survey)
Computer Languages, Systems and Structures
State Focusing: Lazy Abstraction for the Mu-Calculus
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
| Hi-index | 0.00 |
We endow action sets of transition systems with a partial order that expresses the degree of specialization of actions, and with an intuitive but flexible consistency predicate that constrains the extension of such orders with more specialized actions. We develop a satisfaction relation for such models and the µ-calculus. We prove that this satisfaction relation is sound for Thomsen's extended bisimulation as our refinement notion for models, even for consistent extensions of ordered action sets. We then demonstrate how this satisfaction relation can be reduced, fairly efficiently, to classical µ-calculus model checking. These results provide formal support for change management of models and their validation (e.g. in model-centric software development), and enable verification of concrete systems with respect to properties specified for abstract actions.