Modal I/O Automata for Interface and Product Line Theories

DOI10.1007/978-3-540-71316-6_6zbMath1187.68296OpenAlexW1959890433MaRDI QIDQ5756489

Ulrik Nyman, Andrzej Wąsowski, Kim Guldstrand Larsen

Publication date: 4 September 2007

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71316-6_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (47)

Building a Modal Interface Theory for Concurrency and Data ⋮ Mediator Synthesis in a Component Algebra with Data ⋮ Nondeterministic modal interfaces ⋮ Model Checking Value-Passing Modal Specifications ⋮ Extending modal transition systems with structured labels ⋮ Input-output conformance testing for software product lines ⋮ ACTL for modal interface automata ⋮ Compatibility in a multi-component environment ⋮ Abstract probabilistic automata ⋮ A linear-time branching-time perspective on interface automata ⋮ Finding suitable variability abstractions for lifted analysis ⋮ A generalised theory of interface automata, component compatibility and error ⋮ Interface automata for shared memory ⋮ An algebraic theory of interface automata ⋮ Modal transition system encoding of featured transition systems ⋮ From interface automata to hypercontracts ⋮ Generalized abstraction-refinement for game-based CTL lifted model checking ⋮ Product line process theory ⋮ Incremental model checking of delta-oriented software product lines ⋮ Can we communicate? Using dynamic logic to verify team automata ⋮ Coherent modal transition systems refinement ⋮ Modal event-clock specifications for timed component-based design ⋮ Threaded behavior protocols ⋮ Refinement modal logic ⋮ Interface simulation distances ⋮ A Modal Interface Theory with Data Constraints ⋮ EXPTIME-complete Decision Problems for Modal and Mixed Specifications ⋮ Assembly Theories for Communication-Safe Component Systems ⋮ Model-Based Testing ⋮ Interface theories for concurrency and data ⋮ Safe reasoning with logic LTS ⋮ Connecting open systems of communicating finite state machines ⋮ Constraint Markov chains ⋮ Methodologies for Specification of Real-Time Systems Using Timed I/O Automata ⋮ Modelling and analysing variability in product families: model checking of modal transition systems with variability constraints ⋮ Refinement and Consistency of Timed Modal Specifications ⋮ Error-pruning in interface automata ⋮ Abstract Probabilistic Automata ⋮ Unnamed Item ⋮ A Generalised Theory of Interface Automata, Component Compatibility and Error ⋮ Unnamed Item ⋮ Modular Modelling of Software Product Lines with Feature Nets ⋮ Modal Interface Theories for Communication-Safe Component Assemblies ⋮ Moving from interface theories to assembly theories ⋮ Refinement checking on parametric modal transition systems ⋮ From EU Projects to a Family of Model Checkers ⋮ Richer interface automata with optimistic and pessimistic compatibility

This page was built for publication: Modal I/O Automata for Interface and Product Line Theories