COLORED DECISION PROCESS PETRI NETS: MODELING, ANALYSIS AND STABILITY

被引:0
|
作者
Clempner, Julio [1 ]
机构
[1] Natl Polytech Inst CIC IPN, Ctr Res Comp, Ave Juan de Dios Batiz S-N,Edificio CIC, Mexico City 07738, DF, Mexico
关键词
decision process; colored Petri nets; colored decision process Petri nets; stability; Lyapunov methods; optimization; game theory;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we introduce a new modeling paradigm for developing a decision process representation called the Colored Decision Process Petri Net (CDPPN). It extends the Colored Petri Net (CPN) theoretic approach including Markov decision processes. CPNs are used for process representation taking advantage of the formal semantic and the graphical display. A Markov decision process is utilized as a tool for trajectory planning via a utility function. The main point of the CDPPN is its ability to represent the mark-dynamic and trajectory-dynamic properties of a decision process. Within the mark-dynamic properties framework we show that CDPPN theoretic notions of equilibrium and stability are those of the CPN. In the trajectory-dynamic properties framework, we optimize the utility function used for trajectory planning in the CDPPN by a Lyapunov-like function, obtaining as a result new characterizations for final decision points (optimum point) and stability. Moreover, we show that CDPPN mark-dynamic and Lyapunov trajectory-dynamic properties of equilibrium, stability and final decision points converge under certain restrictions. We propose an algorithm for optimum trajectory planning that makes use of the graphical representation (CPN) and the utility function. Moreover, we consider some results and discuss possible directions for further research.
引用
收藏
页码:405 / 420
页数:16
相关论文
共 50 条
  • [21] Modeling of information systems security features with colored Petri nets
    Mikolajczak, B
    Joshi, S
    2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, : 4879 - 4884
  • [22] AUTOMATING THE CONVERSION OF COLORED PETRI NETS WITH QUALITATIVE TOKENS INTO COLORED PETRI NETS WITH QUANTITATIVE TOKENS
    Hlomozda, D. K.
    Glybovets, M. M.
    Maksymets, O. M.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2018, 54 (04) : 650 - 661
  • [23] Generic Colored Petri Nets Modeling Approach for Performance Analysis of Smart Grid System
    Zeineb, Mhadhbi
    Sajeh, Zairi
    Belhassen, Zouari
    2016 7TH INTERNATIONAL RENEWABLE ENERGY CONGRESS (IREC), 2016,
  • [24] Application of colored petri nets in security protocol analysis
    Zhang, Jialin
    Miao, Xianghua
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON ALGORITHMS, SOFTWARE ENGINEERING, AND NETWORK SECURITY, ASENS 2024, 2024, : 676 - 682
  • [25] Modeling inheritance anomaly in concurrent systems using colored Petri nets
    Bauskar, B
    Mikolajczak, B
    2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, : 4873 - 4878
  • [26] Colored Petri Nets for Modeling and Simulation of a Green Supply Chain System
    Kaiyandra, Daffa. R.
    Farizal, F.
    Rakoto, Naly
    IFAC PAPERSONLINE, 2024, 58 (01): : 306 - 311
  • [27] Modeling and verification of TCP congestion control based on colored Petri nets
    Bao, GF
    Liu, F
    Li, H
    2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2003, : 1045 - 1050
  • [28] MODELING OF RAILWAY SYSTEM MAINTENANCE AND AVAILABILITY BY MEANS OF COLORED PETRI NETS
    Song, Haifeng
    Schnieder, Eckehard
    EKSPLOATACJA I NIEZAWODNOSC-MAINTENANCE AND RELIABILITY, 2018, 20 (02): : 236 - 243
  • [29] Modeling a Pharmaceutical Web-Service Using Colored Petri Nets
    Kalinina, Irina
    Gozhyj, Aleksandr
    Gozhyi, Victor
    2022 IEEE 17TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND INFORMATION TECHNOLOGIES (CSIT), 2022, : 345 - 348
  • [30] Modeling and Analysis of SMER Constraints Violation in IRBAC 2000 Model Based on Colored Petri Nets
    Liu, Meng
    Wang, Xuan
    INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS, 2014, 8 (01): : 19 - 32