Analyzing Paths in Time Petri Nets

Authors:
Louchka Popova-Zeugmann;Dirk Schlatter
Affiliations:
(Correspd.) Department of Computer Science, Humboldt University, Berlin, Germany. popova@informatik.hu-berlin.de;(Correspd.) Department of Computer Science, Humboldt University, Berlin, Germany. schlatter@informatik.hu-berlin.de
Venue:
Fundamenta Informaticae
Year:
1999

Citing 3
Cited 4

Modeling and Verification of Time Dependent Systems Using Time Petri Nets

IEEE Transactions on Software Engineering
Occurrence Graphs for Interval Timed Coloured Nets

Proceedings of the 15th International Conference on Application and Theory of Petri Nets
A study of the recoverability of computing systems.

A study of the recoverability of computing systems.

Petri Nets with Time Windows: A Comparison to Classical Petri Nets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Time Petri Nets for Modelling and Analysis of Biochemical Networks

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Extreme Runtimes of Schedules Modelled by Time Petri Nets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Verification of Non-functional Properties of a Composable Architecture with Petrinets

Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a parametric description of a transition sequence in a Time Petri net is introduced. The minimal and maximal time duration of a transition sequence are shown to be integers and furthermore the min/max path passes only integer-states. A necessary condition for the reachability of an arbitrary state is given.