Refinement is complete for implementations

Authors:
Michael Huth
Affiliations:
Department of Computing, Imperial College London, SW7 2AZ, London, UK
Venue:
Formal Aspects of Computing
Year:
2005

Citing 0
Cited 8

A foundation for behavioural conformance in software product line architectures

Proceedings of the ISSTA 2006 workshop on Role of software architecture for testing and analysis
Towards a descriptive set theory for domain-like structures

Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
On model checking multiple hybrid views

Theoretical Computer Science
On correct and complete strong merging of partial behaviour models

Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
A Sound Observational Semantics for Modal Transition Systems

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Automata Games for Multiple-model Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
Modal and mixed specifications: Key decision problems and their complexities

Mathematical Structures in Computer Science
Finite abstract models for deterministic transition systems: fair parallel composition and refinement-preserving logic

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modal transition systems specify sets of implementations, their refining labelled transition systems, through Larsen & Thomsen’s co-inductive notion of refinement. We demonstrate that refinement precisely captures the identification of a modal transition system with its set of implementations: refinement is reverse containment of sets of implementations. This result extends to models that combine state and event observables and is drawn from a SFP-domain whose elements are equivalence classes of modal transition systems under refinement [HJS04], and abstraction-based finite-model properties proved in this paper. As a corollary, validity checking is model checking for Hennessy-Milner formulas that characterize modal transition systems with bounded computation paths. We finally sketch how techniques developed in this paper can be used to detect inconsistencies between multiple modal transition systems and, if consistent, to verify properties of all common implementations.