Symmetry reduction for time Petri net state classes

We propose a method to exploit the symmetries of a real-time system represented by a Time Petri net for its verification by model-checking. The method handles both markings and timing constraints; it can be used in conjunction with the widely used state classes abstraction, a construction providing...

Full description

Saved in:
Bibliographic Details
Published in:Science of computer programming Vol. 132; no. Part 2; pp. 209 - 225
Main Authors: Bourdil, Pierre-Alain, Berthomieu, Bernard, Dal Zilio, Silvano, Vernadat, François
Format: Journal Article
Language:English
Published: Elsevier B.V 15.12.2016
Elsevier
Series:Science of Computer Programming
Subjects:
Computer Science
Software Engineering
State classes
Symmetry reduction
Time Petri nets
Symmetry reduction
State classes
Time Petri nets
Time Petri Nets
Symmetry Reduction
State Classes
ISSN:0167-6423, 1872-7964
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a method to exploit the symmetries of a real-time system represented by a Time Petri net for its verification by model-checking. The method handles both markings and timing constraints; it can be used in conjunction with the widely used state classes abstraction, a construction providing a finite representation of the behavior of a Time Petri net preserving its markings and traces. The approach has been implemented and experiments are reported. •We propose a symmetry reduction method for Time Petri nets interpreted over dense time.•The reduction can be used with the well known state classes construction.•Nets are described compositionally, together with their symmetries.•A total ordering of equivalent transitions in a state class enables efficient computation of state class representatives.
ISSN:0167-6423
1872-7964
DOI:10.1016/j.scico.2016.08.008