SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets [chapter]

Wojciech Penczek, Agata Pòłrola, Andrzej Zbrzezny
2010 Lecture Notes in Computer Science  
Formal methods -among them the model checking techniques -play an important role in the design and production of both systems and software. In this paper we deal with an adaptation of the bounded model checking methods for timed systems, developed for timed automata, to the case of time Petri nets. We consider distributed time Petri nets and parametric reachability checking, but the approach can be easily adapted to verification of other kinds of properties for which the bounded model checking
more » ... ethods exist. A theoretical description is supported by some experimental results, generated using an extension of the model checker VerICS. Some BMC methods for (untimed) Petri nets were described in [16, 26] . Parametric verification for time Petri nets was considered in [33] . The current work is a modification and extension of the paper [24] (published in proceedings of a local workshop with the status of a technical report).
doi:10.1007/978-3-642-18222-8_4 fatcat:wnu3wfi3onb4xfzymrdlztu4sm