Mostrar el registro sencillo del ítem
Linear Time S-Component Extraction for General Petri Nets
dc.creator | Sakellariou A., Valiantzas D., Sotiriou C., Xiromeritis N., Sketopoulos N. | en |
dc.date.accessioned | 2023-01-31T09:52:53Z | |
dc.date.available | 2023-01-31T09:52:53Z | |
dc.date.issued | 2019 | |
dc.identifier | 10.1109/PACET48583.2019.8956294 | |
dc.identifier.isbn | 9781728143606 | |
dc.identifier.uri | http://hdl.handle.net/11615/78681 | |
dc.description.abstract | In this work, we present a linear time, S-component extraction algorithm capable of handling strongly connected, General Petri Nets. Most prior works have focused exclusively on Free-Choice or Extended Free-Choice Nets. We generalise S-component extraction to General Petri Nets, providing a fast transformation between event and state-based spaces. This work is directly applicable to Petri Net based logic synthesis, as a Petri Net event model describing a system's behaviour, may be mapped to a set of S-components, and eventually interacting on Multiple Synchronised FSMs (MSFMSs) [1], implemented in synchronous or asynchronous Boolean Logic. We have tested a set of 25 Petri Net benchmarks, including FSMs, Marked Graphs, Free-Choice, Extended Free-Choice, Asymmetric Choice and General Petri Nets. Our algorithm managed to successfully generate correct S-covering results for all of them. We present results against the original algorithm of [2]. The S-component extraction algorithm complexity is O(P+T+F). © 2019 IEEE. | en |
dc.language.iso | en | en |
dc.source | 5th Panhellenic Conference on Electronics and Telecommunications, PACET 2019 | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85078898212&doi=10.1109%2fPACET48583.2019.8956294&partnerID=40&md5=a344e6432f496e64d8a91c1dd87d9cd8 | |
dc.subject | Computational complexity | en |
dc.subject | Extraction | en |
dc.subject | Logic Synthesis | en |
dc.subject | Temporal logic | en |
dc.subject | Asynchronous system | en |
dc.subject | Component extraction | en |
dc.subject | Extended free choice nets | en |
dc.subject | Fast transformation | en |
dc.subject | General Petri nets | en |
dc.subject | Original algorithms | en |
dc.subject | S-cover | en |
dc.subject | Strongly connected | en |
dc.subject | Petri nets | en |
dc.subject | Institute of Electrical and Electronics Engineers Inc. | en |
dc.title | Linear Time S-Component Extraction for General Petri Nets | en |
dc.type | conferenceItem | en |
Ficheros en el ítem
Ficheros | Tamaño | Formato | Ver |
---|---|---|---|
No hay ficheros asociados a este ítem. |