Hervé Marchand
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
Hervé Marchand has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
- Eric Rutten
Univ. Grenoble Alpes, Inria, CNRS, LIG, Grenoble, France
5 shared publications - Thierry Jéron
Univ Rennes, Inria, CNRS, IRISA
5 shared publications - Srinivas Pinisetty
Indian Institute of Technology Bhubaneswar, Bhubaneswar, India
4 shared publications - Gabriel Kalyon
Université Libre de Bruxelles (U.L.B.)
3 shared publications - Thierry Massart
Université Libre de Bruxelles (U.L.B.)
3 shared publications - Yliès Falcone
Univ. Grenoble Alpes, Inria, LIG
3 shared publications
Latest Publications
- Open Access
Verification of Inference Observability in Supervisory Control of Discrete-Event Systems
We present a new algorithm to verify inference observability in supervisory control of decentralized discreteevent systems. The algorithm's success relies on the following idea. An inferencing solution exists only when a language does not contain any inferencing cycles.
Open AccessVerification of Inference Observability in Supervisory Control of Discrete-Event Systems
We present a new algorithm to verify inference observability in supervisory control of decentralized discreteevent systems. The algorithm's success relies on the following idea. An inferencing solution exists only when a language does not contain any inferencing cycles.
- Open Access
Compositional model checking of SDN platform
Software-Defined Network (SDN) technology provides the possibility to turn the network infrastructure into a dynamic programmable fabric capable of meeting the application needs in real-time. Thanks to the independence of the control plane from the data plane, the control entity, generally called as controller, has also the flexibility to implement proprietary complex algorithms. Within such a dynamic and complex environment, this document advocates for applying formal verification methods and more precisely composition model checking to ensure the correct behavior of the overall SDN system at design phase. To illustrate this purpose, it proposes to build different comprehensive formal models of a typical SDN platform selected here as a study object. Thorough performance results related to each model are provided and discussed. Thanks to such formal verifications, it is possible to pinpoint issues such as the one regarding network isolation within a complex SDN architecture. Although dealing with formal methods, this document attempts to strike a balance between theory, experimental work and network architecture discussion.
Open AccessCompositional model checking of SDN platform
Software-Defined Network (SDN) technology provides the possibility to turn the network infrastructure into a dynamic programmable fabric capable of meeting the application needs in real-time. Thanks to the independence of the control plane from the data plane, the control entity, generally called as controller, has also the flexibility to implement proprietary complex algorithms. Within such a dynamic and complex environment, this document advocates for applying formal verification methods and more precisely composition model checking to ensure the correct behavior of the overall SDN system at design phase. To illustrate this purpose, it proposes to build different comprehensive formal models of a typical SDN platform selected here as a study object. Thorough performance results related to each model are provided and discussed. Thanks to such formal verifications, it is possible to pinpoint issues such as the one regarding network isolation within a complex SDN architecture. Although dealing with formal methods, this document attempts to strike a balance between theory, experimental work and network architecture discussion.
- 13 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (10) , 4990-4997
Synthesis of Supervisors Robust Against Sensor Deception Attacks
We consider feedback control systems where sensor readings may be compromised by a malicious attacker intending on causing damage to the system. We study this problem at the supervisory layer of the control system, using discrete event systems techniques. We assume that the attacker can edit the outputs from the sensors of the system before they reach the supervisory controller. In this context, we formulate the problem of synthesizing a supervisor that is robust against the class of edit attacks on the sensor readings and present a solution methodology for this problem. This methodology blends techniques from games on automata with imperfect information with results from supervisory control theory of partially observed discrete event systems. Necessary and sufficient conditions are provided for the investigated problem.
- 13 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (10) , 4990-4997
Synthesis of Supervisors Robust Against Sensor Deception Attacks
We consider feedback control systems where sensor readings may be compromised by a malicious attacker intending on causing damage to the system. We study this problem at the supervisory layer of the control system, using discrete event systems techniques. We assume that the attacker can edit the outputs from the sensors of the system before they reach the supervisory controller. In this context, we formulate the problem of synthesizing a supervisor that is robust against the class of edit attacks on the sensor readings and present a solution methodology for this problem. This methodology blends techniques from games on automata with imperfect information with results from supervisory control theory of partially observed discrete event systems. Necessary and sufficient conditions are provided for the investigated problem.
- 17 October 2017
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 28 (2) , 183-213
Diagnosability of repairable faults
- 17 October 2017
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 28 (2) , 183-213
Diagnosability of repairable faults
- 23 February 2017
- Published by Springer Nature in Formal Methods in System Design
- Vol. 51 (1) , 154-199
Predictive runtime enforcement
- 23 February 2017
- Published by Springer Nature in Formal Methods in System Design
- Vol. 51 (1) , 154-199
Predictive runtime enforcement
- 15 November 2015
- Published by Springer Nature
- p. 306-320
TiPEX: A Tool Chain for Timed Property Enforcement During eXecution
- 15 November 2015
- Published by Springer Nature
- p. 306-320
TiPEX: A Tool Chain for Timed Property Enforcement During eXecution
- 1 January 2015
- Published by Springer Nature
- p. 93-113
Discrete Control-Based Design of Adaptive and Autonomic Computing Systems
- 1 January 2015
- Published by Springer Nature
- p. 93-113
Discrete Control-Based Design of Adaptive and Autonomic Computing Systems
- 28 October 2014
- Published by Springer Nature in Formal Methods in System Design
- Vol. 45 (3) , 381-422
Runtime enforcement of timed properties revisited
- 28 October 2014
- Published by Springer Nature in Formal Methods in System Design
- Vol. 45 (3) , 381-422
Runtime enforcement of timed properties revisited
- 5 July 2014
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 25 (4) , 531-570
Enforcement and validation (at runtime) of various notions of opacity
- 5 July 2014
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 25 (4) , 531-570
Enforcement and validation (at runtime) of various notions of opacity
- Open Access
- 24 March 2014
- Published by Association for Computing Machinery (ACM)
- p. 1279-1286
Runtime enforcement of regular timed properties
- 24 March 2014
- Published by Association for Computing Machinery (ACM)
- p. 1279-1286
Open AccessRuntime enforcement of regular timed properties