Refinements for Open Automata - Equipe System on Chip
Communication Dans Un Congrès Année : 2023

Refinements for Open Automata

Résumé

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.
Fichier principal
Vignette du fichier
refinementarticleV2.pdf (435.1 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04271300 , version 1 (06-11-2023)

Licence

Identifiants

Citer

Rabéa Ameur-Boulifa, Quentin Corradi, Ludovic Henrio, Eric Madelaine. Refinements for Open Automata. SEFM 2023 - Software Engineering and Formal Methods, Nov 2023, Eindhoven, Netherlands. pp.11-29, ⟨10.1007/978-3-031-47115-5_2⟩. ⟨hal-04271300⟩
225 Consultations
66 Téléchargements

Altmetric

Partager

More