Reachability and Temporal Conflicts in t-Time Petri Nets

Authors:
Nicolas Riviere;Robert Valette;Brigitte Pradin-Chezalviel;Iut A. -. Ups
Affiliations:
-;-;-;-
Venue:
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Year:
2001

Citing 0
Cited 3

Real-time scheduling of batch systems using Petri nets and linear logic

Journal of Systems and Software
Qualitative analysis of workflow nets using linear logic: soundness verification

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
A new graph of classes for the preservation of quantitative temporal constraints

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: The first aim of this paper is to characterize marking reachability within scenarios defined on t-time Petri nets. This reachability can be structural (does not depend on the enabling durations), necessary (for all the possible values of the enabling durations within some given enabling intervals) or possible (for some values of the enabling durations). This approach is based on the computation of sojourn times of tokens in places by means of the construction of proof trees in linear logic. The second aim is to illustrate the fact that these sojourn times can also be used to analyze the conflicts between two scenarios, taking into account all the temporal constraints. In some cases, one of the scenarios will invalidate the other one: the temporal constraints are such that this scenario will never occur.