Covering Steps Graphs of Time Petri Nets

Authors:
Hanifa Boucheneb;Kamel Barkaoui
Affiliations:
Laboratoire VeriForm, Department of Computer Engineering, École Polytechnique de Montréal, P.O. Box 6079, Station Centre-ville, Montréal, Québec,Canada, H3C 3A7;Laboratoire CEDRIC, Conservatoire National des Arts et Métiers, 292 rue Saint Martin, Paris Cedex 03, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 10
Cited 1

Stutter-invariant temporal properties are expressible without the next-time operator

Information Processing Letters
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem

Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
On Combining the Persistent Sets Method with the Covering Steps Graph Method

FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Covering Step Graph

Proceedings of the 17th International Conference on Application and Theory of Petri Nets
A Stubborn Attack On State Explosion

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
CTL* model checking for time Petri nets

Theoretical Computer Science
Partial Order Reduction for Detecting Safety and Timing Failures of Timed Circuits

IEICE - Transactions on Information and Systems
A More Efficient Time Petri Net State Space Abstraction Useful to Model Checking Timed Linear Properties

Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
State class constructions for branching analysis of time Petri nets

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
On interleaving in timed automata

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Reducing Interleaving Semantics Redundancy in Reachability Analysis of Time Petri Nets

ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider here time Petri nets and the covering steps graph technique proposed by Vernadat et al. for untimed Petri nets. In this technique, some transitions are put together to be fired in a single transition step. This paper investigates how this technique can be extended to be applied to time Petri nets.