Computation of synchronizing sequences for a class of 1-place-unbounded synchronized Petri nets
| Autor: | Alessandro Giua, Isabel Demongodin, Changshun Wu |
|---|---|
| Přispěvatelé: | Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Dip. di Ingegneria Elettrica ed Elettronica (Univ. Cagliari), Universita degli Studi di Cagliari [Cagliari], Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Università degli Studi di Cagliari = University of Cagliari (UniCa) |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
0209 industrial biotechnology
Strongly connected component Theoretical computer science Computer science Computation 020208 electrical & electronic engineering Synchronizing 02 engineering and technology Petri net 16. Peace & justice Special class [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation Graph Automaton [SPI.AUTO]Engineering Sciences [physics]/Automatic 020901 industrial engineering & automation Reachability [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering 0202 electrical engineering electronic engineering information engineering ComputingMilieux_MISCELLANEOUS |
| Zdroj: | 2018 5th International Conference on Control, Decision and Information Technologies (CoDIT) 2018 5th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2018, Thessaloniki, France. pp.51-57 CoDIT |
| Popis: | Identification of a final state after red a test is one of the fundamental testing problems for discrete event systems and synchronizing sequences represents a conventional solution to this problem. In this paper, we consider systems modeled by a special class of synchronized Petri nets, called 1-place-unbounded, that contain a single unbounded place. The infinite reachability spaces of such nets can be characterized by two types of finite graphs, called improved modified coverability graph and weighted automata with safety conditions. In case these two finite graphs are deterministic, we develop novel computation algorithms for synchronizing sequences for this class of nets by decomposing the finite graphs into strongly connected components. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|