Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets

Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets ´ HANIFA BOUCHENEB, Laboratoire VeriForm, Ecole Polytechnique de Montr´ al e KAMEL BARKAOUI, Laboratoire CEDRIC, Conservatoire National des Arts et M´ tiers e The main problem of verification techniques based on exploration of (reachable) state space is the state explosion problem. In timed models, abstract states reached by different interleavings of the same set of transitions are, in general, different and their union is not necessarily an abstract state. To attenuate this state explosion, it would be interesting to reduce the redundancy caused by the interleaving semantics by agglomerating all these abstract states whenever their union is an abstract state. This article considers the time Petri net model and establishes some sufficient conditions that ensure that this union is an abstract state. In addition, it proposes a procedure to compute this union without computing beforehand intermediate abstract states. Finally, it shows how to use this result to improve the reachability analysis. Categories and Subject Descriptors: D.2.2 [Software Engineering]: Design Tools and Techniques--Petri nets; D.2.4 [Software Engineering]: Software/Program Verification--Model checking General Terms: Verification Additional Key Words and Phrases: Enumerative analysis, time Petri nets, state space explosion, interleaving semantics, http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Embedded Computing Systems (TECS) Association for Computing Machinery

Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets

Loading next page...
 
/lp/association-for-computing-machinery/reducing-interleaving-semantics-redundancy-in-reachability-analysis-of-WKhYHFyERj

References (25)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2013 by ACM Inc.
ISSN
1539-9087
DOI
10.1145/2406336.2406343
Publisher site
See Article on Publisher Site

Abstract

Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets ´ HANIFA BOUCHENEB, Laboratoire VeriForm, Ecole Polytechnique de Montr´ al e KAMEL BARKAOUI, Laboratoire CEDRIC, Conservatoire National des Arts et M´ tiers e The main problem of verification techniques based on exploration of (reachable) state space is the state explosion problem. In timed models, abstract states reached by different interleavings of the same set of transitions are, in general, different and their union is not necessarily an abstract state. To attenuate this state explosion, it would be interesting to reduce the redundancy caused by the interleaving semantics by agglomerating all these abstract states whenever their union is an abstract state. This article considers the time Petri net model and establishes some sufficient conditions that ensure that this union is an abstract state. In addition, it proposes a procedure to compute this union without computing beforehand intermediate abstract states. Finally, it shows how to use this result to improve the reachability analysis. Categories and Subject Descriptors: D.2.2 [Software Engineering]: Design Tools and Techniques--Petri nets; D.2.4 [Software Engineering]: Software/Program Verification--Model checking General Terms: Verification Additional Key Words and Phrases: Enumerative analysis, time Petri nets, state space explosion, interleaving semantics,

Journal

ACM Transactions on Embedded Computing Systems (TECS)Association for Computing Machinery

Published: Jan 1, 2013

There are no references for this article.