Encoding Reversing Petri Nets in Answer Set Programming

Reversing Petri nets (RPNs) have been proposed as a reversible approach to Petri nets, which allows the transitions of a net to be reversed. This work presents an approach towards an implementation of RPNs to support their simulation and analysis. Specifically, we define how to model RPNs in Answer...

Descripción completa

Detalles Bibliográficos
Autores principales: Dimopoulos, Yannis, Kouppari, Eleftheria, Philippou, Anna, Psara, Kyriaki
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7342048/
http://dx.doi.org/10.1007/978-3-030-52482-1_17
_version_ 1783555351867555840
author Dimopoulos, Yannis
Kouppari, Eleftheria
Philippou, Anna
Psara, Kyriaki
author_facet Dimopoulos, Yannis
Kouppari, Eleftheria
Philippou, Anna
Psara, Kyriaki
author_sort Dimopoulos, Yannis
collection PubMed
description Reversing Petri nets (RPNs) have been proposed as a reversible approach to Petri nets, which allows the transitions of a net to be reversed. This work presents an approach towards an implementation of RPNs to support their simulation and analysis. Specifically, we define how to model RPNs in Answer Set Programming (ASP), a declarative programming framework with competitive solvers. We highlight how the methodology can be used to reason about the behavior of RPN models.
format Online
Article
Text
id pubmed-7342048
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-73420482020-07-09 Encoding Reversing Petri Nets in Answer Set Programming Dimopoulos, Yannis Kouppari, Eleftheria Philippou, Anna Psara, Kyriaki Reversible Computation Article Reversing Petri nets (RPNs) have been proposed as a reversible approach to Petri nets, which allows the transitions of a net to be reversed. This work presents an approach towards an implementation of RPNs to support their simulation and analysis. Specifically, we define how to model RPNs in Answer Set Programming (ASP), a declarative programming framework with competitive solvers. We highlight how the methodology can be used to reason about the behavior of RPN models. 2020-06-17 /pmc/articles/PMC7342048/ http://dx.doi.org/10.1007/978-3-030-52482-1_17 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
Dimopoulos, Yannis
Kouppari, Eleftheria
Philippou, Anna
Psara, Kyriaki
Encoding Reversing Petri Nets in Answer Set Programming
title Encoding Reversing Petri Nets in Answer Set Programming
title_full Encoding Reversing Petri Nets in Answer Set Programming
title_fullStr Encoding Reversing Petri Nets in Answer Set Programming
title_full_unstemmed Encoding Reversing Petri Nets in Answer Set Programming
title_short Encoding Reversing Petri Nets in Answer Set Programming
title_sort encoding reversing petri nets in answer set programming
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7342048/
http://dx.doi.org/10.1007/978-3-030-52482-1_17
work_keys_str_mv AT dimopoulosyannis encodingreversingpetrinetsinanswersetprogramming
AT koupparieleftheria encodingreversingpetrinetsinanswersetprogramming
AT philippouanna encodingreversingpetrinetsinanswersetprogramming
AT psarakyriaki encodingreversingpetrinetsinanswersetprogramming

Ejemplares similares