Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2009)
Clock Matrix Diagrams. Bachelors Thesis
T. Yoneda, Hikaru Ryuba (1998)
CTL Model Checking of Time Petri Nets Using Geometric RegionsIEICE Transactions on Information and Systems, 81
B. Berthomieu, F. Vernadat (2003)
State Class Constructions for Branching Analysis of Time Petri Nets
H. Boucheneb, Kamel Barkaoui (2014)
On combining the ready sets with the covering steps methodsInt. J. Crit. Comput. Based Syst., 5
Pierre-Olivier Ribet, F. Vernadat, B. Berthomieu (2002)
On Combining the Persistent Sets Method with the Covering Steps Graph Method
(2009)
Clock Matrix Diagrams
R. Salah, M. Bozga, O. Maler (2006)
On Interleaving in Timed Automata
Rachid Hadjidj, H. Boucheneb (2008)
Improving state class constructions for CTL* model checking of time Petri netsInternational Journal on Software Tools for Technology Transfer, 10
P. Merlin (1974)
A study of the recoverability of computing systems.
J. Bengtsson (2002)
Clocks, DBMS and States in Timed Systems
D. Pradubsuwun, T. Yoneda, C. Myers (2004)
Partial Order Reduction for Detecting Safety and Timing Failures of Timed Circuits
G. Gardey, O. Roux, O. Roux (2003)
Using Zone Graph Method for Computing the State Space of a Time Petri Net
H. Boucheneb, G. Gardey, O. Roux (2009)
TCTL Model Checking of Time Petri NetsJ. Log. Comput., 19
T. Yoneda, H. Schlingloff (1993)
Efficient Verification of Parallel Real–Time SystemsFormal Methods in System Design, 11
(2013)
Reducing interleaving semantics redundancy in reachability analysis of time Petri nets
B. Berthomieu, Florent Peres, F. Vernadat (2007)
Model Checking Bounded Prioritized Time Petri Nets
W. Penczek, Agata Pólrola (2001)
Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets
H. Boucheneb, Kamel Barkaoui (2009)
Covering Steps Graphs of Time Petri Nets
H. Boucheneb, Hind Rakkay (2008)
A More Efficient Time Petri Net State Space Abstraction Useful to Model Checking Timed Linear PropertiesFundam. Informaticae, 88
T. Murata (1989)
Petri nets: Properties, analysis and applicationsProc. IEEE, 77
(2001)
Abstraction and partial order reductions for checking branching properties of time Petri nets
W. Penczek, Agata Pólrola (2004)
Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata
G. Behrmann, P. Bouyer, Kim Larsen, Radek Pelánek (2004)
Lower and upper bounds in zone-based abstractions of timed automataInternational Journal on Software Tools for Technology Transfer, 8
B. Berthomieu, M. Diaz (1991)
Modeling and Verification of Time Dependent Systems Using Time Petri NetsIEEE Trans. Software Eng., 17
H. Boucheneb, Rachid Hadjidj (2006)
CTL* model checking for time Petri netsTheor. Comput. Sci., 353
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,
ACM Transactions on Embedded Computing Systems (TECS) – Association for Computing Machinery
Published: Jan 1, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.