Symbolic Reachability Analysis of Integer Timed Petri Nets

Authors:
Min Wan;Gianfranco Ciardo
Affiliations:
Department of Computer Science and Engineering, University of California, Riverside,;Department of Computer Science and Engineering, University of California, Riverside,
Venue:
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Year:
2009

Citing 12
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Using Edge-Valued Decision Diagrams for Symbolic Generation of Shortest Paths

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Petri Net Analysis Using Boolean Manipulation

Proceedings of the 15th International Conference on Application and Theory of Petri Nets
On priorities of parallelism

Logic of Programs and Their Applications, Proceedings
A study of the recoverability of computing systems.

A study of the recoverability of computing systems.
Implicit GSPN reachability set generation using decision diagrams

Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
The saturation algorithm for symbolic state-space exploration

International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
Logic and stochastic modeling with SMART

Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Saturation unbound

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning

CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods

Ten years of saturation: a petri net perspective

Transactions on Petri Nets and Other Models of Concurrency V

Quantified Score

Hi-index	0.00

Visualization

Abstract

Petri nets are an effective formalism to model discrete event systems, and several variants have been defined to explicitly include real time in the model. We consider two fundamental reachability problems for Timed Petri Nets with positive integer firing times: timed reachability (find all markings where the model can be at a given finite time) and earliest reachability (find the minimum time when each reachable marking is entered). For these two problems, we define efficient symbolic algorithms that make use of both ordinary and edge-valued decision diagrams, and provide runtime results on an extensive suite of models.