Cited in
(33)- Stuttering for abstract probabilistic automata
- EXPTIME-completeness of thorough refinement on modal transition systems
- Stuttering for abstract probabilistic automata
- Building a Modal Interface Theory for Concurrency and Data
- Connecting open systems of communicating finite state machines
- Moving from interface theories to assembly theories
- Richer interface automata with optimistic and pessimistic compatibility
- On weak modal compatibility, refinement, and the MIO workbench
- Interface theories for concurrency and data
- On refinements of Boolean and parametric modal transition systems
- ACTL for modal interface automata
- Assembly theories for communication-safe component systems
- A modal interface theory with data constraints
- ECDAR
- Motras
- VMC
- Mica
- Modal Interface Theories for Communication-Safe Component Assemblies
- A generalised theory of interface automata, component compatibility and error
- A generalised theory of interface automata, component compatibility and error
- MTSA
- Extending modal transition systems with structured labels
- Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
- Logical vs. behavioural specifications
- A linear-time branching-time perspective on interface automata
- Modal specification theories for component-based design
- Refinement and asynchronous composition of modal Petri nets
- Error-pruning in interface automata
- Compatibility in a multi-component environment
- Nondeterministic modal interfaces
- Interface automata for shared memory
- Modal transition system encoding of featured transition systems
- MoTraS: a tool for modal transition systems and their extensions
This page was built for software: MIO Workbench
