A Few Considerations on Structural and Logical Composition in Specification Theories

@inproceedings{Legay2010AFC,
  title={A Few Considerations on Structural and Logical Composition in Specification Theories},
  author={Axel Legay and Andrzej Wasowski},
  booktitle={FIT},
  year={2010}
}
Over the last 20 years a large number of automata-based specification theories have been proposed for modeling of discrete, real-time and probabilistic systems. We have observed a lot of shared algebraic structure between these formalisms. In this short abstract, we collect results of our work in progress on describing and systematizing the algebraic assumptions in specification theories. 

References

SHOWING 1-10 OF 10 REFERENCES

Timed I/O automata: a complete specification theory for real-time systems

This work develops a complete specifification framework for real-time systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of TimedI/O Transition Systems.

Compositional Design Methodology with Constraint Markov Chains

This is the first specification theory for Markov Chains with such closure properties and discusses its relation to simpler operators for known languages such as probabilistic process algebra.

Interface automata

This work presents a light-weight formalism that captures the temporal aspects of software component interfaces through an automata-based language that supports automatic compatability checks between interface models, and thus constitutes a type system for component interaction.

Principles of model checking

Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.

Modal I/O Automata for Interface and Product Line Theories

Alfaro and Henzinger use alternating simulation in a two player game as a refinement for interface automata [1]. We show that interface automata correspond to a subset of modal transition systems of

Modal interfaces: unifying interface automata and modal specifications

A unification of interface automata and modal specifications, two radically dissimilar models for interface theories, is presented by correcting the modal interface composition operator presented in the paper by Larsen et al., drawing a complete picture of theModal interface algebra, and pushing even further the comparison between interfaces automata, modal automataand modal interfaces.

Modal Contracts for Component-Based Design

Modal contracts allow keeping a larger design space than their non-modal version, and thus avoid prematurely ruling out possible implementations, and the composition is defined, which is shown to be sound.

Interface Theories for Component-Based Design

This work states that many aspects of interface models, such as compatibility and refinement checking between interfaces, are properly viewed in a gametheoretic setting, where the input and output values of an interface are chosen by different players.

Timed Interfaces

The theory provides algorithms for checking the compatibility between two interfaces and for deriving the composite interface; the theory can thus be viewed as a type system for real-time interaction.

Modal Specifications

  • K. Larsen
  • Computer Science
    Automatic Verification Methods for Finite State Systems
  • 1989