Modular state space exploration for timed petri nets

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 e...

Full description

Saved in:
Bibliographic Details
Published in:International journal on software tools for technology transfer 2007-06, Vol.9 (3-4), p.393-411
Main Authors: Lakos, C, Petrucci, L
Format: Article
Language:English
Subjects:
Algorithms
Computer science
Discrete event systems
Modular construction
Petri nets
Simulation
Space exploration
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. [PUBLICATION ABSTRACT]
ISSN:1433-2779
1433-2787
DOI:10.1007/s10009-007-0033-2