Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
A Compositional Approach on Modal Specifications for Timed Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A Boolean Algebra of Contracts for Assume-guarantee Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
A Strict-Observational Interface Theory for Analysing Service Orchestrations
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic contracts for component-based design
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Modal transition systems: composition and LTL model checking
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Parametric modal transition systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Building a modal interface theory for concurrency and data
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
A compositional specification theory for component behaviours
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Moving from specifications to contracts in component-based design
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Modal event-clock specifications for timed component-based design
Science of Computer Programming
A Modal Interface Theory for Component-based Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
EXPTIME-completeness of thorough refinement on modal transition systems
Information and Computation
Probabilistic contracts for component-based design
Formal Methods in System Design
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Abstract Probabilistic Automata
Information and Computation
| Hi-index | 0.00 |
In this paper we revisit the fundamentals of interface theories. Methodological considerations call for supporting ``aspects'' and ``assume/guarantee'' reasoning. From these considerations, we show that, in addition to the now classical refinement and substitutability properties of interfaces, two additional operations are needed, namely: conjunction and residuation (or quotient). We draw the attention to the difficulty in handling interfaces having different alphabets --- which calls for alphabet equalization. We show that alphabet equalization must be performed differently for the different operations. Then, we show that Modal Interfaces, as adapted from the original proposal by Kim Larsen, offer the needed flexibility.