Behavioural verification of limited resources systems under true concurrency semantics

dc.contributor.authorBouneb; Messaouda
dc.contributor.authorSaidouni; Djamel Eddine
dc.date.accessioned2024-03-12T17:24:05Z
dc.date.available2024-03-12T17:24:05Z
dc.date.issued2021-05-25
dc.description.abstractIn 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.
dc.identifier.isbn978-9931-9788-0-0
dc.identifier.urihttp://dspace.univ-oeb.dz:4000/handle/123456789/18718
dc.language.isoen
dc.publisherUniversity of Oum El Bouaghi
dc.subjectFormal verification; maximality labeled transitions system; concurrent systems; K-bounded Petri net.
dc.titleBehavioural verification of limited resources systems under true concurrency semantics
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Behavioural verification of limited resources systems under true concurrency semantics.pdf
Size:
429.25 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: