Compositional equivalences based on open pNets

Ameur-Boulifa, Rabéa; Henrio, Ludovic; Madelaine, Eric

doi:10.1016/j.jlamp.2022.100842

Cited by 1 publication

(10 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More precisely, we say that a system is open if it contains a "hole" to be filled by another system. Open systems are typically composition operators [17] or componentised systems where some of the components are yet to be provided [6]. This form of composition is more complex to handle than top-level interaction usually found in process algebra, as the behaviour of each entity in the system is parameterised both by classical symbolic variables and by process variables.…”

Section: Introductionmentioning

confidence: 99%

“…This is why in previous works and in this article, it we extend the classical form of bisimulation relation: in a symbolic setting a bisimulation relation relates classically states of two systems but it is additionally parameterised by a formula that must be verified by the state variables. This has been introduced in details in previous works [6] and will be recalled briefly in Section 2.2. We have shown in previous works that open symbolic systems are particularly convenient to model process algebra operators and open component systems with infinite behaviour [6,17].…”

Section: Introductionmentioning

confidence: 99%

“…This has been introduced in details in previous works [6] and will be recalled briefly in Section 2.2. We have shown in previous works that open symbolic systems are particularly convenient to model process algebra operators and open component systems with infinite behaviour [6,17].…”

Section: Introductionmentioning

confidence: 99%

“…Holes enable the composition of automata: an automaton with a hole is an operator that takes another automaton as parameter and reacts to the actions it emits; the composed automaton is an automaton where the behaviour of one "process parameter" of the main automaton has been provided. Due to their generic nature, the notion of OA model is quite abstract but we already illustrated previously how to derive OAs for process algebra operators [17] or for component systems [6,5].…”

Section: Introductionmentioning

confidence: 99%

“…In previous works [6,24] a bisimulation relation was defined for OA and open parameterised hierarchical LTSs. It exhibited good properties concerning bisimulation, but refinement relations were not studied.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Refinements for Open Automata

Ameur-Boulifa,

Corradi,

Henrio

et al. 2023

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Establishing equivalence and refinement relations between programs is an important mean for verifying their correctness. By establishing that the behaviours of a modified program simulate those of the source one, simulation relations formalise the desired relationship between a specification and an implementation, two equivalent implementations, or a program and its optimised implementation. This article discusses a notion of simulation between open automata, which are symbolic behavioural models for communicating systems. Open automata may have holes modelling elements of their context, and can be composed by instantiation of the holes. This allows for a compositional approach for verification of their behaviour. We define a simulation between open automata that may or may not have the same holes, and show under which conditions these refinements are preserved by composition of open automata.

show abstract

Section: Introductionmentioning

confidence: 99%