Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Using I/O automata for developing distributed systems
Foundations of component-based systems
Communication and Concurrency
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
The Use of Static Constructs in A Modal Process Logic
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
MTSA: Eclipse support for modal transition systems construction, analysis and elaboration
Proceedings of the 2007 OOPSLA workshop on eclipse technology eXchange
A Sound Observational Semantics for Modal Transition Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Program compatibility approaches
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Behaviour Protocols for Interacting Stateful Components
Electronic Notes in Theoretical Computer Science (ENTCS)
A Strict-Observational Interface Theory for Analysing Service Orchestrations
Electronic Notes in Theoretical Computer Science (ENTCS)
ECDAR: an environment for compositional design and analysis of real time systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
A modal interface theory with data constraints
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Modal interface theories for communication-safe component assemblies
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
MIO workbench: a tool for compositional design with modal input/output interfaces
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
Refinement and asynchronous composition of modal petri nets
Transactions on Petri Nets and Other Models of Concurrency V
Moving from specifications to contracts in component-based design
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Synchronous interface theories and time triggered scheduling
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
EXPTIME-completeness of thorough refinement on modal transition systems
Information and Computation
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Behavioral Refinement and Compatibility of Statechart Extensions
Electronic Notes in Theoretical Computer Science (ENTCS)
A modal specification theory for components with data
Science of Computer Programming
| Hi-index | 0.00 |
Building on the theory of modal I/O automata (MIOs) by Larsen et al. we introduce a new compatibility notion called weak modal compatibility. As an important property of behavioral interface theories we prove that weak modal compatibility is preserved under weak modal refinement. Furthermore, we organize and compare different notions of refinement and compatibility to give an easily-accessible overview. Finally, we describe the MIO Workbench, an Eclipse-based editor and verification tool for modal I/O automata, which implements various refinement, compatibility and composition notions and is able to depict the results of verification directly on the graphical representation of MIOs – relations or state pairs in the positive and erroneous paths in the negative case.