Patrice Bonhomme
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
Patrice Bonhomme has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Achraf Jabeur Telmoudi
Université de Tunis, Ecole Nationale Supérieure d'Ingénieurs de Tunis, LR16ES03 Laboratoire d'Ingénierie des Systèmes Industriels et d'Energies Renouvelables
1 shared publication Amir Abdellatif
LARATSI Laboratory, ENIM, University of Monastir, Monastir, Tunisia
1 shared publicationLotfi Nabli
LARATSI Laboratory, ENIM, University of Monastir, Monastir, Tunisia
1 shared publication- Philippe Declerck
LISA/LARIS, University of Angers, Angers, France
1 shared publication
Latest Publications
- 16 May 2023
- Published by Taylor & Francis in International Journal of Control
- Vol. 97 (6) , 1341-1350
Two-staged approach for estimation of sequences in partially observable P-time Petri nets on a sliding horizon with schedulability analysis
In this paper, we consider the on-line estimation of current subsequences for Partially Observable P-time Petri Nets and their starting markings on a sliding horizon composed of steps defined by two successive occurrences of observable transition firings. We propose a general strategy composed of two phases: Phase 1 exploits a simplification of the P-time Petri net under the form of a Timed Petri net; considering a candidate count vector and the relevant starting marking proposed at Phase 1, Phase 2 makes a schedulability analysis by building a system of relations which can be represented by an acyclic conflict-free computation graph. The complete approach avoids the generation of sets which is generally time and space consuming, and provides an optimal solution for each subproblem by using efficient standard tools.
- 16 May 2023
- Published by Taylor & Francis in International Journal of Control
- Vol. 97 (6) , 1341-1350
Two-staged approach for estimation of sequences in partially observable P-time Petri nets on a sliding horizon with schedulability analysis
In this paper, we consider the on-line estimation of current subsequences for Partially Observable P-time Petri Nets and their starting markings on a sliding horizon composed of steps defined by two successive occurrences of observable transition firings. We propose a general strategy composed of two phases: Phase 1 exploits a simplification of the P-time Petri net under the form of a Timed Petri net; considering a candidate count vector and the relevant starting marking proposed at Phase 1, Phase 2 makes a schedulability analysis by building a system of relations which can be represented by an acyclic conflict-free computation graph. The complete approach avoids the generation of sets which is generally time and space consuming, and provides an optimal solution for each subproblem by using efficient standard tools.
- 19 September 2020
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 31 (1) , 137-162
Decentralized state estimation and diagnosis of p-time labeled Petri nets systems
- 19 September 2020
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 31 (1) , 137-162
Decentralized state estimation and diagnosis of p-time labeled Petri nets systems
- 18 May 2020
- Published by Taylor & Francis in Cybernetics and Systems
- Vol. 51 (4) , 467-484
Minimum Initial Marking Estimation of Labeled Petri Nets Based on GRASP Inspired Method (GMIM)
This paper deals with the problem of estimating the Minimum Initial Marking (MIM) of Labeled Petri Nets (L-PN). By the observation of a sequence of labels, we determine the set of possible MIMs related to a given L-PN through an approach based on GRASP (Greedy Randomized Adaptive Search Procedure) inspired method – GMIM. The objective is to get the maximum of feasible MIMs by exploring the search space and giving best solutions for real time cyber systems in short time. We consider four basic assumptions during the reasoning: (i) the L-PN structure is known; (ii) for each transition of L-PN, a label is associated, (iii) the label sequence is known, and (iv) all transitions of L-PN are observable. We show the validity and efficiency of our approach by applying the proposed GMIM metaheuristic to two validation examples: Initialization of two parallel machines (example widely cited in literature) and resources allocation in a monitoring problem via mobile robot network.
- 18 May 2020
- Published by Taylor & Francis in Cybernetics and Systems
- Vol. 51 (4) , 467-484
Minimum Initial Marking Estimation of Labeled Petri Nets Based on GRASP Inspired Method (GMIM)
This paper deals with the problem of estimating the Minimum Initial Marking (MIM) of Labeled Petri Nets (L-PN). By the observation of a sequence of labels, we determine the set of possible MIMs related to a given L-PN through an approach based on GRASP (Greedy Randomized Adaptive Search Procedure) inspired method – GMIM. The objective is to get the maximum of feasible MIMs by exploring the search space and giving best solutions for real time cyber systems in short time. We consider four basic assumptions during the reasoning: (i) the L-PN structure is known; (ii) for each transition of L-PN, a label is associated, (iii) the label sequence is known, and (iv) all transitions of L-PN are observable. We show the validity and efficiency of our approach by applying the proposed GMIM metaheuristic to two validation examples: Initialization of two parallel machines (example widely cited in literature) and resources allocation in a monitoring problem via mobile robot network.
- 29 September 2012
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 67 (1-4) , 759-769
Towards a new schedulability technique of real-time systems modeled by P-time Petri nets
- 29 September 2012
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 67 (1-4) , 759-769
Towards a new schedulability technique of real-time systems modeled by P-time Petri nets
- 24 May 2012
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 23 (2) , 197-209
Scheduling and control of real-time systems based on a token player approach
- 24 May 2012
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 23 (2) , 197-209
Scheduling and control of real-time systems based on a token player approach
- 6 May 2011
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 57 (1-4) , 353-365
Constraint graph-based approach for the analysis and the control of time critical systems
- 6 May 2011
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 57 (1-4) , 353-365
Constraint graph-based approach for the analysis and the control of time critical systems
- 1 January 2010
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 43 (17) , 192-197
Update Procedure for the Supervisory Control of P-Time Event Graphs
- 1 January 2010
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 43 (17) , 192-197
Update Procedure for the Supervisory Control of P-Time Event Graphs
- 1 September 2007
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 40 (18) , 517-522
A TOKEN PLAYER ALGORITHM FOR THE CONTROL OF TIME CRITICAL SYSTEMS
- 1 September 2007
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 40 (18) , 517-522
A TOKEN PLAYER ALGORITHM FOR THE CONTROL OF TIME CRITICAL SYSTEMS