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.
Publié le : 2018-07-26
Classification:
Parallel and Distributed Computing; Theoretical Foundations; Software Engineering;,
Recursive Petri nets, hierarchical design, action refinement, maximality labeled transition system
@article{cai2018_3_635,
author = {Messaouda Bouneb; University El Arbi ben M'hidi, Oum el boighi and Djamel Eddine Saidouni; university of Abed El Hamid Mehri Constantine 2, Constantine and Jean Michel Ilie; University of Piere and Marie Curie, Paris},
title = {Hierarchical System Design Using Refinable Recursive Petri Net},
journal = {Computing and Informatics},
volume = {36},
number = {6},
year = {2018},
language = {en},
url = {http://dml.mathdoc.fr/item/cai2018_3_635}
}
Messaouda Bouneb; University El Arbi ben M'hidi, Oum el boighi; Djamel Eddine Saidouni; university of Abed El Hamid Mehri Constantine 2, Constantine; Jean Michel Ilie; University of Piere and Marie Curie, Paris. Hierarchical System Design Using Refinable Recursive Petri Net. Computing and Informatics, Tome 36 (2018) no. 6, . http://gdmltest.u-ga.fr/item/cai2018_3_635/