2026-07-23T00:17:36Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4375 2024-03-06T10:34:58Z ddc:004 open_access

Computation of Summaries Using Net Unfoldings Esparza, Javier Jezequel, Loig Schwoon, Stefan Net unfoldings Concurrent systems Petri nets We study the following summarization problem: given a parallel composition A=A_1||...||A_n of labelled transition systems communicating with the environment through a distinguished component A_i, efficiently compute a summary S_i such that E||A and E||S_i are trace-equivalent for every environment E. While Si can be computed using elementary automata theory, the resulting algorithm suffers from the state-explosion problem. We present a new, simple but subtle algorithm based on net unfoldings, a partial-order semantics, give some experimental results using an implementation on top of MOLE, and show that our algorithm can handle divergences and compute weighted summaries with minor modifications. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Javier Esparza and Loig Jezequel and Stefan Schwoon 2013 Is Part Of LIPIcs, Volume 24, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2013.225 urn:nbn:de:0030-drops-43759 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.225 eng https://creativecommons.org/licenses/by/3.0/legalcode