Modular state space exploration for timed petri nets

Authors:
C. Lakos;L. Petrucci
Affiliations:
University of Adelaide, 5005, Adelaide, SA, Australia;Université Paris XIII, LIPN, CNRS UMR 7030, 99, avenue Jean-Baptiste Clément, 93430, Villetaneuse, SA, France
Venue:
International Journal on Software Tools for Technology Transfer (STTT)
Year:
2007

Citing 0
Cited 4

Modular state spaces for prioritised Petri Nets

FOCS'10 Proceedings of the 16th Monterey conference on Foundations of computer software: modeling, development, and verification of adaptive systems
Original Articles: Coloured Petri net scheduling models: Timed state space exploration shortages

Mathematics and Computers in Simulation
A time stamp reduction method for state space exploration using colored Petri nets

Simulation
Petri nets state space analysis in the cloud

Proceedings of the 34th International Conference on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper extends modular state space construction for concurrent systems to cater for timed systems. It identifies different forms of timed state space and presents algorithms for computing them. These include uniprocessor algorithms inspired by conservative and optimistic approaches to discrete event simulation, and also a distributed algorithm. The paper discusses implementation issues and performance results for a simple case study.