MIO Workbench

swMATH9762MaRDI QIDQ21741FDOQ21741

Author name not available (Why is that?)

Cited In (28)

• Stuttering for abstract probabilistic automata
• EXPTIME-completeness of thorough refinement on modal transition systems
• Assembly Theories for Communication-Safe Component Systems
• Building a Modal Interface Theory for Concurrency and Data
• Refinement and Asynchronous Composition of Modal Petri Nets
• Connecting open systems of communicating finite state machines
• Moving from interface theories to assembly theories
• Richer interface automata with optimistic and pessimistic compatibility
• Interface theories for concurrency and data
• Stuttering for Abstract Probabilistic Automata
• ACTL for modal interface automata
• Title not available (Why is that?)
• Modal Interface Theories for Communication-Safe Component Assemblies
• A generalised theory of interface automata, component compatibility and error
• On Refinements of Boolean and Parametric Modal Transition Systems
• MoTraS: A Tool for Modal Transition Systems and Their Extensions
• On Weak Modal Compatibility, Refinement, and the MIO Workbench
• A Generalised Theory of Interface Automata, Component Compatibility and Error
• Extending modal transition systems with structured labels
• Logical vs. behavioural specifications
• A Modal Interface Theory with Data Constraints
• A linear-time branching-time perspective on interface automata
• Error-pruning in interface automata
• Nondeterministic modal interfaces
• Compatibility in a multi-component environment
• Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
• Interface automata for shared memory
• Modal transition system encoding of featured transition systems

This page was built for software: MIO Workbench