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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Science of computer programming Ročník 132; číslo Part 2; s. 209 - 225
Hlavní autoři: Bourdil, Pierre-Alain, Berthomieu, Bernard, Dal Zilio, Silvano, Vernadat, François
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 15.12.2016
Elsevier
Edice:Science of Computer Programming
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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