A New Property of Choice-Free Petri Net Systems

When a Petri net system of some class is synthesised from a labelled transition system, it may be interesting to derive structural properties of the corresponding reachability graphs and to use them in a pre-synthesis phase in order to quickly reject inadequate transition systems, and provide fruitf...

Descripción completa

Detalles Bibliográficos
Autores principales: Best, Eike, Devillers, Raymond, Erofeev, Evgeny
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7324222/
http://dx.doi.org/10.1007/978-3-030-51831-8_5
_version_ 1783551895621599232
author Best, Eike
Devillers, Raymond
Erofeev, Evgeny
author_facet Best, Eike
Devillers, Raymond
Erofeev, Evgeny
author_sort Best, Eike
collection PubMed
description When a Petri net system of some class is synthesised from a labelled transition system, it may be interesting to derive structural properties of the corresponding reachability graphs and to use them in a pre-synthesis phase in order to quickly reject inadequate transition systems, and provide fruitful error messages. The same is true for simultaneous syntheses problems. This was exploited for the synthesis of choice-free nets for instance, for which several interesting properties have been derived. We exhibit here a new property for this class, and analyse if this gets us closer to a full characterisation of choice-free synthesizable transition systems.
format Online
Article
Text
id pubmed-7324222
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-73242222020-06-30 A New Property of Choice-Free Petri Net Systems Best, Eike Devillers, Raymond Erofeev, Evgeny Application and Theory of Petri Nets and Concurrency Article When a Petri net system of some class is synthesised from a labelled transition system, it may be interesting to derive structural properties of the corresponding reachability graphs and to use them in a pre-synthesis phase in order to quickly reject inadequate transition systems, and provide fruitful error messages. The same is true for simultaneous syntheses problems. This was exploited for the synthesis of choice-free nets for instance, for which several interesting properties have been derived. We exhibit here a new property for this class, and analyse if this gets us closer to a full characterisation of choice-free synthesizable transition systems. 2020-06-02 /pmc/articles/PMC7324222/ http://dx.doi.org/10.1007/978-3-030-51831-8_5 Text en © Springer Nature Switzerland AG 2020 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.
spellingShingle Article
Best, Eike
Devillers, Raymond
Erofeev, Evgeny
A New Property of Choice-Free Petri Net Systems
title A New Property of Choice-Free Petri Net Systems
title_full A New Property of Choice-Free Petri Net Systems
title_fullStr A New Property of Choice-Free Petri Net Systems
title_full_unstemmed A New Property of Choice-Free Petri Net Systems
title_short A New Property of Choice-Free Petri Net Systems
title_sort new property of choice-free petri net systems
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7324222/
http://dx.doi.org/10.1007/978-3-030-51831-8_5
work_keys_str_mv AT besteike anewpropertyofchoicefreepetrinetsystems
AT devillersraymond anewpropertyofchoicefreepetrinetsystems
AT erofeevevgeny anewpropertyofchoicefreepetrinetsystems
AT besteike newpropertyofchoicefreepetrinetsystems
AT devillersraymond newpropertyofchoicefreepetrinetsystems
AT erofeevevgeny newpropertyofchoicefreepetrinetsystems

Ejemplares similares