An algebraic theory of interface automata

Chilton, Chris; Jönsson, Bengt; Kwiatkowska, Marta

doi:10.1016/j.tcs.2014.07.018

Cited by 16 publications

(35 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Regarding the definition of the input and output alphabets we follow Chilton et al [8] and Raclet et al [22]; there is, however, a choice regarding the input alphabet, which we discuss in Sec. 4.2.…”

Section: Definition and Main Resultsmentioning

confidence: 99%

“…Hence, I Q ⊆ I P \ I D ∪ A D = I P ∪ O D . The more inputs Q has, the easier it is to supply the behaviour ensuring Q D P. Thus, we have chosen the input alphabet I P ∪ O D for our quotient P//D, just as is done in [8] and [22]. When comparing some Q to P//D in Thm.…”

Section: Discussionmentioning

confidence: 99%

“…Disconnecting an input rather blocks it and, therefore, we introduce a restriction operator for inputs. The same idea is used in the IA-setting of [9] but hiding and restriction are combined in one operation.…”

Section: Hiding and Restrictionmentioning

confidence: 99%

“…Interface theories [2,7,8,16,17,22] support the component-based design of concurrent systems and offer a semantic framework for, e.g., software contracts [1] and web services [5]. Several such theories are based on de Alfaro and Henzinger's Interface Automata (IA) [11], whose distinguishing feature is a parallel composition on labelled transition systems with inputs and outputs, where receiving an unexpected input is regarded as an error, i.e., a communication mismatch.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Nondeterministic Modal Interfaces

Bujtor

Fendrich

Lüttgen

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Interface theories are employed in the component-based design of concurrent systems. They often emerge as combinations of Interface Automata (IA) and Modal Transition Systems (MTS), e.g., Nyman et al.'s IOMTS, Bauer et al.'s MIO, Raclet et al.'s MI or our MIA. In this paper, we generalise MI to nondeterministic interfaces, for which we resolve the longstanding conflict between unspecified inputs being allowed in IA but forbidden in MTS. With this solution we achieve, in contrast to related work, an associative parallel composition, a compositional preorder, a conjunction on interfaces with dissimilar alphabets supporting perspective-based specifications, and a quotienting operator for decomposing nondeterministic specifications in a single theory.

show abstract

Section: Definition and Main Resultsmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Section: Hiding and Restrictionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Nondeterministic Modal Interfaces

Bujtor

Fendrich

Lüttgen

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Chen et al [8] (long version in [9]) present more recent work that is based on languages. They consider with quiescent traces a kind of stop traces.…”

Section: Related Workmentioning

confidence: 99%

Trace- and failure-based semantics for responsiveness

2014

View full text Add to dashboard Cite

Abstract.We study open systems modeled as Petri nets with an interface for asynchronous (i.e., buffered) communication with other open systems. As a minimal requirement for successful communication, we investigate responsiveness, which guarantees that an open system and its environment always have the possibility to communicate. We investigate responsiveness with and without final states and also their respective bounded variants, where the number of pending messages never exceeds a previously known bound. Responsiveness accordance describes when one open system can be safely replaced by another open system. We present a trace-based characterization for each accordance variant. As none of the relations turns out to be compositional (i.e., it is no precongruence), we characterize the coarsest compositional relation (i.e., the coarsest precongruence) that is contained in each relation, using a variation of should testing. For the two unbounded variants, the precongruences are not decidable, but for the two bounded variants we show decidability.

show abstract

Interface Automata for Shared Memory

Gareis¹,

Lüttgen²,

Schinko³

et al. 2019

Lecture Notes in Computer Science

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

An algebraic theory of interface automata

Cited by 16 publications

References 32 publications

Nondeterministic Modal Interfaces

Nondeterministic Modal Interfaces

Trace- and failure-based semantics for responsiveness

Interface Automata for Shared Memory

Contact Info

Product

Resources

About