Representation of time Petri nets using interval weighted automata

0578406 - MÚ 2024 RIV US eng C - Conference Paper (international conference)
Daviaud, B. - Komenda, Jan - Lahaye, S. - Lhommeau, M.
Representation of time Petri nets using interval weighted automata.
9th International Conference on Control, Decision and Information Technologies (CoDIT). Los Alamitos: IEEE, 2023 - (Califano, C.; Jabeur Telmoud, A.; Herrera Viedma, E.), Č. 99, s. 99-104. ISBN 979-8-3503-1141-9.
[9th International Conference on Control, Decision and Information Technologies (CoDIT). Rome (IT), 03.07.2023-06.07.2023]
R&D Projects: GA ČR(CZ) GC19-06175J
Institutional support: RVO:67985840
Keywords : discrete event systems * Petri Nets
OECD category: Automation and control systems
https://doi.org/10.1109/CoDIT58514.2023.10284333

Interval Weighted Automata are a modeling formalism for timed systems that can be viewed as an alternative (more algebraic) to timed automata. We present here a way of deriving a deterministic interval weighted automaton to represent any bounded T-time Petri net subject to strong and single-server semantics. This approach consequently contributes to the characterization of the expressiveness of weighted automata with respect to other formalisms for timed Discrete Event Systems. In addition, the time language of the obtained abstraction has the characteristics of being included or equal to the time language of the T-time Petri net, and, in other words, any accessible state in the obtained Interval Weighted Automaton corresponds to an equally accessible state in the T-time Petri net. This property should allow the future use of this abstraction for the verification of properties that are expressed as an accessibility issue and/or for control.
Permanent Link: https://hdl.handle.net/11104/0347404