Bouneb; MessaoudaSaidouni; Djamel Eddine2024-03-122024-03-122021-05-25978-9931-9788-0-0http://dspace.univ-oeb.dz:4000/handle/123456789/18718In this paper we propose a true concurrency semantics for limited resources systems using K-bounded Petri net as modeling formalism and maximality labeled transition system (MLTS) as semantics model. Indeed the model of MLTS expresses clearly the semantics of true parallelism of concurrent systems. The proposed operational maximality semantics for Kbounded Petri nets makes it possible to interpret any K-bounded Petri net in terms of MLTS. Through an example we show the interest of the proposed semantics in comparison with the interleaving semantics and the ST semantics. The comparison concerns the preservation of true concurrency and the reduction of the size of the semantics model. Furthermore, we will show that expected CTL properties may be verified on the corresponding maximality labeled transition system of a modeled system using our developed tool.enFormal verification; maximality labeled transitions system; concurrent systems; K-bounded Petri net.Article