Minimization Algorithms for Time Petri Nets

Issue title: Concurrency Specification and Programming (CS&P 2003)

Article type: Research Article

Authors: Półrola, Agata | Penczek, Wojciech

Affiliations: Faculty of Mathematics, University of Lodz, Banacha 22, 90-238 Lodz, Poland | Institute of Computer Science, PAS Ordona 21, 01-237 Warsaw, Poland

Abstract: The paper presents three methods for applying partitioning algorithms, used for generating abstract models for timed automata, to the case of time Petri nets. Each of these methods is based on a different approach to the concrete semantics of a net, and can potentially be more efficient than the others in a particular case. Besides the theoretical description, we provide some preliminary experimental results, obtained from the implementation integrated with the model checking tool VerICs

Journal: Fundamenta Informaticae, vol. 60, no. 1-4, pp. 307-331, 2004