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
Get full access to this article
View all access options for this article.