Gwen Salaün
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Gwen Salaün has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Irman Faqrizal
Université Côte D’Azur, Inria, CNRS, I3S
3 shared publications - Quentin Nivon
Univ. Grenoble Alpes, CNRS, Grenoble INP, Inria, LIG
3 shared publications - Yliès Falcone
Université Grenoble Alpes
3 shared publications Ahang Zuo
Univ. Grenoble Alpes, CNRS, Grenoble INP, Inria, LIG
2 shared publicationsAjay Krishna
Univ. Grenoble Alpes, CNRS, Grenoble INP, Inria, LIG
2 shared publications- Carlos Canal
University of Malaga
2 shared publications
Latest Publications
- Open Access
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 320-329
Dependency-Aware Reconfigurations of Kubernetes Deployments
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 320-329
Open AccessDependency-Aware Reconfigurations of Kubernetes Deployments
- 28 April 2026
- Published by Wiley in Software: Practice and Experience
- Vol. 56 (7) , 908-927
Visualisation and Automated Formal Verification of TOSCA Workflows
Background: Topology and Orchestration Specification for Cloud Applications (TOSCA) is a specification language used for modelling topology and orchestration of cloud applications. This language particularly allows the description of workflows that can be used for specifying management tasks such as (un)deployment plans. Motivations: This textual language for describing TOSCA workflows does not provide any visual notation for graphically designing or observing the corresponding workflows. Moreover, this specification language is error‐prone and can be source of mistakes during the writing of the management plans. Methods: In this article, we propose a transformation from TOSCA to the graphical Business Process Model and Notation (BPMN), which allows the visualisation of TOSCA workflows. We also provide automated verification techniques for analysing TOSCA (un)deployment workflows in terms of functional and architectural properties as well as execution times. The transformation and verification steps are achieved in a fully automated way. Results: This approach computes BPMN models and verification results within a reasonable time on realistic applications.
- 28 April 2026
- Published by Wiley in Software: Practice and Experience
- Vol. 56 (7) , 908-927
Visualisation and Automated Formal Verification of TOSCA Workflows
Background: Topology and Orchestration Specification for Cloud Applications (TOSCA) is a specification language used for modelling topology and orchestration of cloud applications. This language particularly allows the description of workflows that can be used for specifying management tasks such as (un)deployment plans. Motivations: This textual language for describing TOSCA workflows does not provide any visual notation for graphically designing or observing the corresponding workflows. Moreover, this specification language is error‐prone and can be source of mistakes during the writing of the management plans. Methods: In this article, we propose a transformation from TOSCA to the graphical Business Process Model and Notation (BPMN), which allows the visualisation of TOSCA workflows. We also provide automated verification techniques for analysing TOSCA (un)deployment workflows in terms of functional and architectural properties as well as execution times. The transformation and verification steps are achieved in a fully automated way. Results: This approach computes BPMN models and verification results within a reasonable time on realistic applications.
- Open Access
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1119-1123
GIVUP: Automated Generation and Verification of Textual Process Descriptions
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1119-1123
Open AccessGIVUP: Automated Generation and Verification of Textual Process Descriptions
- 15 April 2025
- Published by Springer Nature
- p. 127-141
Modelling and Verification of an Application for Managing Sensitive Health Data
- 15 April 2025
- Published by Springer Nature
- p. 127-141
Modelling and Verification of an Application for Managing Sensitive Health Data
- 7 December 2024
- Published by Springer Nature
- p. 185-201
Automated Generation of BPMN Processes from Textual Requirements
- 7 December 2024
- Published by Springer Nature
- p. 185-201
Automated Generation of BPMN Processes from Textual Requirements
- Open Access
- 16 November 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Autonomous and Adaptive Systems
- Vol. 19 (4) , 1-31
Adaptive Industrial Control Systems via IEC 61499 and Runtime Enforcement
This work envisions industrial control systems that can reliably adapt to requirements. We rely on the international standard IEC 61499 to achieve this goal. The standard allows downtimeless system evolution such that an application can be modified at runtime to satisfy the requirements. However, an IEC 61499 application consisting of multiple Function Blocks (FBs) can be modified in many different ways, such as inserting or deleting FBs, creating new FBs with their respective internal behaviours and adjusting the connections between FBs. These changes require considerable effort and cost, and there is no guarantee to satisfy the requirements. This article applies runtime enforcement techniques for supporting adaptive IEC 61499 applications. This set of techniques can modify the runtime behaviour of a system according to specific requirements. Our approach begins with specifying the requirements as a state machine-based notation called contract automaton. This automaton is then used to synthesise an enforcer as an FB. Finally, the new FB is integrated into the application to execute according to the requirements. A tool support is developed to automate the approach. Experiments were performed to evaluate the performance of enforcers by measuring the execution time of several applications before and after the integration of enforcers.
- 16 November 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Autonomous and Adaptive Systems
- Vol. 19 (4) , 1-31
Open AccessAdaptive Industrial Control Systems via IEC 61499 and Runtime Enforcement
This work envisions industrial control systems that can reliably adapt to requirements. We rely on the international standard IEC 61499 to achieve this goal. The standard allows downtimeless system evolution such that an application can be modified at runtime to satisfy the requirements. However, an IEC 61499 application consisting of multiple Function Blocks (FBs) can be modified in many different ways, such as inserting or deleting FBs, creating new FBs with their respective internal behaviours and adjusting the connections between FBs. These changes require considerable effort and cost, and there is no guarantee to satisfy the requirements. This article applies runtime enforcement techniques for supporting adaptive IEC 61499 applications. This set of techniques can modify the runtime behaviour of a system according to specific requirements. Our approach begins with specifying the requirements as a state machine-based notation called contract automaton. This automaton is then used to synthesise an enforcer as an FB. Finally, the new FB is integrated into the application to execute according to the requirements. A tool support is developed to automate the approach. Experiments were performed to evaluate the performance of enforcers by measuring the execution time of several applications before and after the integration of enforcers.
- Open Access
- 14 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 66-76
Automated Repair of Violated Eventually Properties in Concurrent Programs
Model checking automatically verifies that a model, e.g., a Labelled Transition System (LTS), obtained from higher-level specification languages, satisfies a given temporal property. When the model violates the property, the model checker returns a counterexample, but this counterexample does not precisely identify the source of the bug. Moreover, manually correcting the given specification or model can be a painful and complicated task. In this paper, we propose some techniques for computing patches that can correct an erroneous specification violating an eventually property. These techniques first extract from the whole behavioural model the part which does not satisfy the given property. In a second step, this erroneous part is analysed using several algorithms in order to compute the minimal number of patches in the specification so as to make it satisfy the given property. The approach is fully automated using a tool we implemented and applied on a series of examples for validation purposes.
- 14 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 66-76
Open AccessAutomated Repair of Violated Eventually Properties in Concurrent Programs
Model checking automatically verifies that a model, e.g., a Labelled Transition System (LTS), obtained from higher-level specification languages, satisfies a given temporal property. When the model violates the property, the model checker returns a counterexample, but this counterexample does not precisely identify the source of the bug. Moreover, manually correcting the given specification or model can be a painful and complicated task. In this paper, we propose some techniques for computing patches that can correct an erroneous specification violating an eventually property. These techniques first extract from the whole behavioural model the part which does not satisfy the given property. In a second step, this erroneous part is analysed using several algorithms in order to compute the minimal number of patches in the specification so as to make it satisfy the given property. The approach is fully automated using a tool we implemented and applied on a series of examples for validation purposes.
- Open Access
- 6 April 2024
- Published by Springer Nature
- p. 56-76
Probabilistic Runtime Enforcement of Executable BPMN Processes
A business process is a collection of structured tasks corresponding to a service or a product. Business processes do not execute once and for all, but are executed multiple times resulting in multiple instances. In this context, it is particularly difficult to ensure correctness and efficiency of the multiple executions of a process. In this paper, we propose to rely on Probabilistic Model Checking (PMC) to automatically verify that multiple executions of a process respect some specific probabilistic property. This approach applies at runtime, thus the evaluation of the property is periodically verified and the corresponding results updated. However, we go beyond runtime PMC for BPMN, since we propose runtime enforcement techniques to keep executing the process while avoiding the violation of the property. To do so, our approach combines monitoring techniques, computation of probabilistic models, PMC, and runtime enforcement techniques. The approach has been implemented as a toolchain and has been validated on several realistic BPMN processes.
- 6 April 2024
- Published by Springer Nature
- p. 56-76
Open AccessProbabilistic Runtime Enforcement of Executable BPMN Processes
A business process is a collection of structured tasks corresponding to a service or a product. Business processes do not execute once and for all, but are executed multiple times resulting in multiple instances. In this context, it is particularly difficult to ensure correctness and efficiency of the multiple executions of a process. In this paper, we propose to rely on Probabilistic Model Checking (PMC) to automatically verify that multiple executions of a process respect some specific probabilistic property. This approach applies at runtime, thus the evaluation of the property is periodically verified and the corresponding results updated. However, we go beyond runtime PMC for BPMN, since we propose runtime enforcement techniques to keep executing the process while avoiding the violation of the property. To do so, our approach combines monitoring techniques, computation of probabilistic models, PMC, and runtime enforcement techniques. The approach has been implemented as a toolchain and has been validated on several realistic BPMN processes.
- Open Access
- 1 February 2023
- Published by Springer Nature in Software and Systems Modeling
- Vol. 22 (2) , 471-472
Editorial for FACS 2021 special section (SoSyM)
- 1 February 2023
- Published by Springer Nature in Software and Systems Modeling
- Vol. 22 (2) , 471-472
Open AccessEditorial for FACS 2021 special section (SoSyM)
- Open Access
- 7 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 41-48
Probabilistic Analysis of Industrial IoT Applications
Industrial automation is a complex process involving various stakeholders. The international standard IEC 61499 helps to specify distributed automation using a generic architectural model, targeting the technical development of the automation. However, analysing the correctness of IEC 61499 models remains challenging because of their informal semantics and distributed logic. We introduce new verification techniques for IEC 61499 applications that combine a design-time analysis for computing a formal model of the application with a runtime analysis for extracting additional information during the execution. This combination of analyses allows for building a richer model of the application and thus formally verifying it using probabilistic model checking. Our approach is automated using several tools and was validated on a realistic IEC 61499 application.
- 7 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 41-48
Open AccessProbabilistic Analysis of Industrial IoT Applications
Industrial automation is a complex process involving various stakeholders. The international standard IEC 61499 helps to specify distributed automation using a generic architectural model, targeting the technical development of the automation. However, analysing the correctness of IEC 61499 models remains challenging because of their informal semantics and distributed logic. We introduce new verification techniques for IEC 61499 applications that combine a design-time analysis for computing a formal model of the application with a runtime analysis for extracting additional information during the execution. This combination of analyses allows for building a richer model of the application and thus formally verifying it using probabilistic model checking. Our approach is automated using several tools and was validated on a realistic IEC 61499 application.