Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/29568
Citations
Scopus Web of Science® Altmetric
?
?
Type: Conference paper
Title: A proposal for relative time petri nets
Author: Kuehn, J.
Lakos, C.
Esser, R.
Citation: Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05), 2005 : pp. 240-249
Publisher: IEEE Computer Society
Publisher Place: Los Alamitos, California
Issue Date: 2005
ISBN: 0769524354
Conference Name: IEEE International Conference on Software Engineering and Formal Methods (3rd : 2005 : Koblenz, Germany)
Editor: Aichernig, B.
Beckert, B.
Statement of
Responsibility: 
Joseph Kuehn, Charles Lakos, Robert Esser
Abstract: Petri nets are a graph-based modelling formalism which has been widely used for the formal specification and analysis of concurrent systems. A common analysis technique is that of state space exploration (or reachability analysis). Here, every possible reachable state of the system is generated and desirable properties are evaluated for each state. This approach has the great advantage of conceptual simplicity, but the great disadvantage of being susceptible to state space explosion, where the number of states is simply too large for exhaustive exploration. Many reduction techniques have been suggested to ameliorate the problem of state space explosion. In the case of timed systems, the state space is infinite, unless analysis is restricted to a bounded time period. In this paper, we present a Petri net formalism based on the notion of relative time (as opposed to the traditional approach of dealing with absolute time). The goal is to derive a finite state space for timed systems which have repeating patterns of behaviour, even though time continues to advance indefinitely.
Description: Copyright © 2005, IEEE
DOI: 10.1109/SEFM.2005.4
Appears in Collections:Aurora harvest 6
Computer Science publications

Files in This Item:
File Description SizeFormat 
hdl29568.pdf303.77 kBPublisher's PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.