Abstract
This paper is in the framework of the specification and verification of concurrent dynamic systems. For this purpose we propose the model of Refinable Recursive Petri Nets (RRPN) under a maximality semantics. In this model a notion of undefined transitions is considered. The underlying semantics model is the Maximality Abstract Labeled Transition System (AMLTS). Then, the model supports a definition of a hierarchical design methodology. The example of a cutting flame machine is used for illustrating the approach.
Keywords
Cite this article
@article{cai-2908,
author = {Messaouda Bouneb and Djamel Eddine Saidouni and Jean Michel Ilie},
title = {Hierarchical System Design Using Refinable Recursive Petri Net},
journal = {Computing and Informatics},
volume = {37},
number = {3},
pages = {635--655},
year = {2018},
issn = {1335-9150},
doi = {10.4149/cai_2018_3_635}
}
TY - JOUR AU - Messaouda Bouneb AU - Djamel Eddine Saidouni AU - Jean Michel Ilie TI - Hierarchical System Design Using Refinable Recursive Petri Net JO - Computing and Informatics VL - 37 IS - 3 SP - 635 EP - 655 PY - 2018 SN - 1335-9150 DO - 10.4149/cai_2018_3_635 UR - https://doi.org/10.4149/cai_2018_3_635 KW - Recursive Petri nets KW - hierarchical design KW - action refinement KW - maximality labeled transition system ER -
Bouneb, M., Saidouni, D. E., & Ilie, J. M. (2018). Hierarchical System Design Using Refinable Recursive Petri Net. Computing and Informatics, 37(3), 635–655. https://doi.org/10.4149/cai_2018_3_635