Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
Alternating-time temporal logic
Journal of the ACM (JACM)
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Synchronous and Bidirectional Component Interfaces
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Conjunction on processes: Full abstraction via ready-tree semantics
Theoretical Computer Science
Interface theories with component reuse
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Why Are Modalities Good for Interface Theories?
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Invited contribution: sociable interfaces
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
The embedded systems design challenge
FM'06 Proceedings of the 14th international conference on Formal Methods
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Timed concurrent game structures
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A Strict-Observational Interface Theory for Analysing Service Orchestrations
Electronic Notes in Theoretical Computer Science (ENTCS)
Methodologies for specification of real-time systems using timed I/O automata
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Abstract probabilistic automata
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
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
Refinement and asynchronous composition of modal petri nets
Transactions on Petri Nets and Other Models of Concurrency V
A compositional specification theory for component behaviours
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
New results for Constraint Markov Chains
Performance Evaluation
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
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
Ensuring reachability by design
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Parameterized preorder relations for model-based testing of software product lines
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Abstract Probabilistic Automata
Information and Computation
A modal specification theory for components with data
Science of Computer Programming
| Hi-index | 0.00 |
This paper presents a unification of interface automata and modal specifications, two radically dissimilar models for interface theories. Interface automata is a game-based model, which allows to make assumptions on the environment and propose an optimistic view for composition : two components can be composed if there is an environment where they can work together. Modal specification is a language theoretic account of a fragment of the modal mu-calculus logic that is more complete but which does not allow to distinguish between the environment and the component. Partial unifications of these two frameworks have been explored recently. A first attempt by Larsen et al. considers modal interfaces, an extension of modal specifications that deals with compatibility issues in the composition operator. However, this composition operator is incorrect. A second attempt by Raclet et al. gives a different perspective, and emphasises on conjunction and residuation of modal specifications, including when interfaces have dissimilar alphabets, but disregards interface compatibility. The present paper contributes a thorougher unification of the two theories by correcting the modal interface composition operator presented in the paper by Larsen et al., drawing a complete picture of the modal interface algebra, and pushing even further the comparison between interface automata, modal automata and modal interfaces.