Article thumbnail

Computation of Summaries Using Net Unfoldings

By Javier Esparza, Loig Jezequel and Stefan Schwoon

Abstract

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

Topics: Net unfoldings, Concurrent systems, Petri nets, Data processing Computer science
Publisher: LIPIcs - Leibniz International Proceedings in Informatics. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)
Year: 2013
DOI identifier: 10.4230/LIPIcs.FSTTCS.2013.225
OAI identifier: oai:drops-oai.dagstuhl.de:4375

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles