Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Chiheb Ameur Abid"'
Publikováno v:
Advanced Information Networking and Applications ISBN: 9783031290558
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f61b91a5c16b487db65d879f33e24fb7
https://doi.org/10.1007/978-3-031-29056-5_29
https://doi.org/10.1007/978-3-031-29056-5_29
Publikováno v:
2022 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom).
Publikováno v:
2022 8th International Conference on Control, Decision and Information Technologies (CoDIT).
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030988494
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::118a7b40ce737fd5c523d1b9fe5741ee
https://doi.org/10.1007/978-3-030-98850-0_3
https://doi.org/10.1007/978-3-030-98850-0_3
Publikováno v:
Cooperative Information Systems ISBN: 9783031178337
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd5d82ecaf261e5e7fba851a0412a072
https://doi.org/10.1007/978-3-031-17834-4_3
https://doi.org/10.1007/978-3-031-17834-4_3
Publikováno v:
Petri Nets Applications
The Supervisory Control Theory (SCT) (RamadgeW Giua & DiCesare, 1994; Sreenivas & Sreenivas, 1997), since they represent a good trade-off between modelling power and analysis capabilities. For details about the supervisory control problem methods bas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4719927eda9247ade73d17a7526f688
http://www.intechopen.com/articles/show/title/supervisory-control-and-high-level-petri-nets
http://www.intechopen.com/articles/show/title/supervisory-control-and-high-level-petri-nets
Publikováno v:
ISPA/BDCloud/SocialCom/SustainCom
The model checking is one of the major techniques used in the formal verification. This technique builds on an automatic procedure that takes a model $M$ of a system and a formula $\varphi$ expressing a temporal property, and decides whether the syst
Publikováno v:
ACSD
An efficient way to cope with the combinatorial explosion problem induced by the model checking process is to compute the Symbolic Observation Graph (SOG). Given an stuttering invariant event-based LTL formula φ, involving a subset of actions E (cal
Publikováno v:
ISPA/IUCC/BDCloud/SocialCom/SustainCom
An efficient way to cope with the combinatorial explosion problem induced by the model checking process is to compute the Symbolic Observation Graph (SOG). Such a graph is a condensed representation of the state space that is obtained by taking advan
Publikováno v:
SCSS
Model checking is a powerful and widespread technique for the verification of finite dis- tributed systems. It takes as input a formal model of a system and a formal specification (formula) of a property to be checked, and states whether the system s