The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article présente une nouvelle méthode de contrôle optimal des réseaux de Petri temporisés, introduisant une nouvelle contrainte basée sur la logique temporelle appelée a contrainte temporelle d'exclusion mutuelle généralisée (GMETC). Le GMETC est décrit par une formule de logique temporelle métrique (MTL) où chaque proposition atomique représente une contrainte d'exclusion mutuelle généralisée (GMEC). Nous formulons un problème de contrôle optimal des réseaux de Petri temporisés sous un GMETC donné et résolvons le problème en le transformant en un problème de programmation linéaire en nombres entiers où la formule MTL est codée par des inégalités linéaires. Nous montrons l'efficacité de l'approche proposée par une simulation numérique.
Kohei FUJITA
Mitsubishi Electric Corporation,Osaka University
Toshimitsu USHIO
Osaka University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Kohei FUJITA, Toshimitsu USHIO, "Optimal Control of Timed Petri Nets Under Temporal Logic Constraints with Generalized Mutual Exclusion" in IEICE TRANSACTIONS on Fundamentals,
vol. E105-A, no. 5, pp. 808-815, May 2022, doi: 10.1587/transfun.2021MAP0003.
Abstract: This paper presents a novel method for optimal control of timed Petri nets, introducing a novel temporal logic based constraint called a generalized mutual exclusion temporal constraint (GMETC). The GMETC is described by a metric temporal logic (MTL) formula where each atomic proposition represents a generalized mutual exclusion constraint (GMEC). We formulate an optimal control problem of the timed Petri nets under a given GMETC and solve the problem by transforming it into an integer linear programming problem where the MTL formula is encoded by linear inequalities. We show the effectiveness of the proposed approach by a numerical simulation.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021MAP0003/_p
Copier
@ARTICLE{e105-a_5_808,
author={Kohei FUJITA, Toshimitsu USHIO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Optimal Control of Timed Petri Nets Under Temporal Logic Constraints with Generalized Mutual Exclusion},
year={2022},
volume={E105-A},
number={5},
pages={808-815},
abstract={This paper presents a novel method for optimal control of timed Petri nets, introducing a novel temporal logic based constraint called a generalized mutual exclusion temporal constraint (GMETC). The GMETC is described by a metric temporal logic (MTL) formula where each atomic proposition represents a generalized mutual exclusion constraint (GMEC). We formulate an optimal control problem of the timed Petri nets under a given GMETC and solve the problem by transforming it into an integer linear programming problem where the MTL formula is encoded by linear inequalities. We show the effectiveness of the proposed approach by a numerical simulation.},
keywords={},
doi={10.1587/transfun.2021MAP0003},
ISSN={1745-1337},
month={May},}
Copier
TY - JOUR
TI - Optimal Control of Timed Petri Nets Under Temporal Logic Constraints with Generalized Mutual Exclusion
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 808
EP - 815
AU - Kohei FUJITA
AU - Toshimitsu USHIO
PY - 2022
DO - 10.1587/transfun.2021MAP0003
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2022
AB - This paper presents a novel method for optimal control of timed Petri nets, introducing a novel temporal logic based constraint called a generalized mutual exclusion temporal constraint (GMETC). The GMETC is described by a metric temporal logic (MTL) formula where each atomic proposition represents a generalized mutual exclusion constraint (GMEC). We formulate an optimal control problem of the timed Petri nets under a given GMETC and solve the problem by transforming it into an integer linear programming problem where the MTL formula is encoded by linear inequalities. We show the effectiveness of the proposed approach by a numerical simulation.
ER -