Revisiting Timed Specification Theories: A Linear-Time Perspective

Chilton, Chris; Kwiatkowska, Marta; Wang, Xu

doi:10.1007/978-3-642-33365-1_7

Cited by 9 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To demonstrate the applicability of the theory to component-based design, the quotient operation was used to synthesise mediator components in [18] and [3]. Furthermore, the flexibility and expressiveness of the theory has been shown through a compositional assume-guarantee reasoning framework [8,9] and a real-time extension [10,7].…”

Section: Introductionmentioning

confidence: 99%

An algebraic theory of interface automata

Chilton

Jönsson

Kwiatkowska

2014

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

We formulate a compositional specification theory for interface automata, where a component model specifies the allowed sequences of input and output interactions with the environment. A trace-based linear-time refinement is provided, which is the weakest preorder preserving substitutivity of components, and is weaker than the classical alternating simulation defined on interface automata. Since our refinement allows a component to be refined by refusing to produce any output, we also define a refinement relation that guarantees safety and progress. The theory includes the operations of parallel composition to support the structural composition of components, logical conjunction and disjunction for independent development, hiding to support abstraction of interfaces, and quotient for incremental synthesis of components. Our component formulation highlights the algebraic properties of the specification theory for both refinement preorders, and is shown to be fully abstract with respect to observation of communication mismatches. Examples of independent and incremental component development are provided.

show abstract

Section: Introductionmentioning

confidence: 99%

An algebraic theory of interface automata

Chilton

Jönsson

Kwiatkowska

2014

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…An interface encompasses the assumption represented by its inputs and the guarantee represented by its outputs and describes how a component and its environment are expected to interact. Some of the specification theories developed in this context are based on variants of TIOA close to the one that we are using, like in the case of [18]. The theory of [18] allows reasoning for safety and bounded liveness properties on finite-timed traces.…”

Section: Contract-based Meta-theories and Their Implementationsmentioning

confidence: 98%

“…Some of the specification theories developed in this context are based on variants of TIOA close to the one that we are using, like in the case of [18]. The theory of [18] allows reasoning for safety and bounded liveness properties on finite-timed traces. Generally, the notion of a contract that merges the assumption and the guarantee is well suited to derive compatible environments in which components can work together since it models how a component should behave.…”

Section: Contract-based Meta-theories and Their Implementationsmentioning

confidence: 98%

Contract-based modeling and verification of timed safety requirements within SysML

2015

View full text Add to dashboard Cite

In order to cope with the growing complexity of critical real-time embedded systems, systems engineering has adopted a component-based design technique driven by requirements. Yet, such an approach raises several issues since it does not explicitly prescribe how system requirements can be decomposed on components nor how components contribute to the satisfaction of requirements. The envisioned solution is to design, with respect to each requirement and for each involved component, an abstract specification, tractable at each design step, that models how the component is concerned by the satisfaction of the requirement and that can be further refined toward a correct implementation. In this paper, we consider such specifications in the form of contracts. A contract for a component consists in a pair (assumption, guarantee) where the assumption models an abstract behavior of the component's environment and the guarantee models an abstract behavior of the component given that the environment behaves according to the assumption. Therefore, contracts are a valuable asset for the correct design of systems, but also for mapping and tracing requirements to components, for tracing the evolution of requirements during design and, most importantly, for compositional verification of requirements. The aim of this paper is to introduce contract-based reasoning for the design of critical real-time systems made of reactive components modeled with UML and/or SysML. We propose an extension of UML and SysML languages with a syntax and semantics for contracts and the refinement relations that they must satisfy. The semantics of components and contracts is formalized by a variant of timed input/output automata on top of which we build a formal contract-based theory. We prove that the contract-based theory is sound and can be applied for a relatively large class of SysML system models. Finally, we show on a case study extracted from the automated transfer vehicle (http://www.esa.int/ATV) that our contract-based theory allows to verify requirement satisfaction for previously intractable models.

show abstract

“…The problem of guaranteeing the consistency of composition without having to calculate the product of automata (or other models of orchestration) has remained largely ignored in the literature (e.g., [5,6]) as its relevance comes to the fore in service-oriented computing thanks to the crucial distinction that needs to be made between design-time and run-time checks or operations.…”

Section: Related Workmentioning

confidence: 99%

A Timed Component Algebra for Services

Delahaye

Fiadeiro

Legay

et al. 2013

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Part 8: Session 7: Distribution and ConcurrencyInternational audienceWe present a component algebra for services that can guarantee time-related properties. The components of this algebra are networks of processes that execute according to time constraints and communicate asynchronously through channels that can delay messages. We characterise a sub-class of consistent networks give sufficient conditions for that class to be closed under composition. Finally, we show how those conditions can be checked, at design time, over timed I/O automata as orchestrations of services, thus ensuring that, when binding a client with a supplier service at run time, the orchestrations of the two services can work together as interconnected without further checks

show abstract

Revisiting Timed Specification Theories: A Linear-Time Perspective

Cited by 9 publications

References 24 publications

An algebraic theory of interface automata

An algebraic theory of interface automata

Contract-based modeling and verification of timed safety requirements within SysML

A Timed Component Algebra for Services

Contact Info

Product

Resources

About