Nondeterministic Modal Interfaces

Bujtor, Ferenc; Fendrich, Sascha; Lüttgen, Gerald; Vogler, Walter

doi:10.1007/978-3-662-46078-8_13

Cited by 8 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The latter is due to a unique transition p −(ϕ σ , a?, ψ σ )→ p σ with σ | ϕ σ , which also satisfies ψ σ (σ ) ⊆ ψ(σ ) . 5 The family of all these transitions satisfies ϕ ⇒ σ ϕ σ and, for all σ with σ | ϕ, we have Using the last two theorems and Proposition 4, we can now prove the associativity of parallel composition as stated in Proposition 12:…”

Section: Embedding Iam Into Iamentioning

confidence: 90%

“…Before showing this embedding, we wish to technically justify the notion of pruning which realizes IAM's optimistic notion of compatibility that it inherits from IA. We follow the approach adopted by us for Modal Interface Automata (MIA) in [5], which is based on so-called legal, or helpful, environments as first introduced for IA in [13].…”

Section: Parallel Compositionmentioning

confidence: 99%

“…To support refinement during software development, IA is equipped with a branching-time behavioural preorder called alternating simulation; it allows one to substitute an abstract component by a concrete one, provided the concrete component offers no fewer inputs and no more outputs than the abstract one. As this implies that outputs cannot be enforced in IA, researchers have frequently based IA-inspired interface theories on the more expressive Modal Transition Systems (MTS) and modal refinement [3,5,15,22,29]. As an aside, a lineartime semantics respecting communication errors as in IA was proposed by Dill [14] and more recently adapted for variations of IA in [6,8].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Interface Automata for Shared Memory

et al. 2021

Self Cite

View full text Add to dashboard Cite

Interface theories based on Interface Automata (IA) are formalisms for the component-based specification of concurrent systems. Extensions of their basic synchronization mechanism permit the modelling of data, but are studied in more complex settings involving modal transition systems or do not abstract from internal computation. In this article, we show how de Alfaro and Henzinger’s original IA theory can be conservatively extended by shared memory data, without sacrificing simplicity or imposing restrictions. Our extension IA for shared Memory (IAM) decorates transitions with pre- and post-conditions over algebraic expressions on shared variables, which are taken into account by IA’s notion of component compatibility. Simplicity is preserved as IAM can be embedded into IA and, thus, accurately lifts IA’s compatibility concept to shared memory. We also provide a ground semantics for IAM that demonstrates that our abstract handling of data within IA’s open systems view is faithful to the standard treatment of data in closed systems.

show abstract

Section: Embedding Iam Into Iamentioning

confidence: 90%

Section: Parallel Compositionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Interface Automata for Shared Memory

et al. 2021

Self Cite

View full text Add to dashboard Cite

show abstract

A Generalised Theory of Interface Automata, Component Compatibility and Error

Fendrich

Lüttgen

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Interface theories allow systems designers to reason about the composability and compatibility of concurrent system components. Such theories often extend both de Alfaro and Henzinger's Interface Automata and Larsen's Modal Transition Systems, which leads, however, to several issues that are undesirable in practice: an unintuitive treatment of specified unwanted behaviour, a binary compatibility concept that does not scale to multi-component assemblies, and compatibility guarantees that are insufficient for software product lines.In this paper we show that communication mismatches are central to all these problems and, thus, the ability to represent such errors semantically is an important feature of an interface theory. Accordingly, we present the error-aware interface theory EMIA, where the above shortcomings are remedied by introducing explicit fatal error states. In addition, we prove via a Galois insertion that EMIA is a conservative generalisation of the established MIA (Modal Interface Automata) theory.

show abstract

Compositionality, Decompositionality and Refinement in Input/Output Conformance Testing

Luthmann¹,

Mennicke²,

Lochau³

2017

Formal Aspects of Component Software

View full text Add to dashboard Cite

We propose an input/output conformance testing theory utilizing Modal Interface Automata with Input Refusals (IR-MIA) as novel behavioral formalism for both the specification and the implementation under test. A modal refinement relation on IR-MIA allows distinguishing between obligatory and allowed output behaviors, as well as between implicitly underspecified and explicitly forbidden input behaviors. The theory therefore supports positive and negative conformance testing with optimistic and pessimistic environmental assumptions. We further show that the resulting conformance relation on IR-MIA, called modal-irioco, enjoys many desirable properties concerning componentbased behaviors. First, modal-irioco is preserved under modal refinement and constitutes a preorder under certain restrictions which can be ensured by a canonical input completion for IR-MIA. Second, under the same restrictions, modal-irioco is compositional with respect to parallel composition of IR-MIA with multi-cast and hiding. Finally, the quotient operator on IR-MIA, as the inverse to parallel composition, facilitates decompositionality in conformance testing to solve the unknown-component problem.

show abstract

Nondeterministic Modal Interfaces

Cited by 8 publications

References 19 publications

Interface Automata for Shared Memory

Interface Automata for Shared Memory

A Generalised Theory of Interface Automata, Component Compatibility and Error

Compositionality, Decompositionality and Refinement in Input/Output Conformance Testing

Contact Info

Product

Resources

About