A new graph of classes for the preservation of quantitative temporal constraints

Authors:
Xiaoyu Mao;Janette Cardoso;Robert Valette
Affiliations:
IRIT-UT1/LAAS, Toulouse, France;IRIT-UT1, Toulouse, France;LAAS-CNRS, Toulouse, France
Venue:
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Year:
2005

Citing 6
Cited 0

Modeling and Verification of Time Dependent Systems Using Time Petri Nets

IEEE Transactions on Software Engineering
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
PAREDE: An Automated Tool for the Analysis of Time(d) Petri Nets

International Workshop on Timed Petri Nets
Scenario Durations Characterization of T-Timed Petri Nets Using Linear Logic

PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Reachability and Temporal Conflicts in t-Time Petri Nets

PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Automated Planning: Theory & Practice

Automated Planning: Theory & Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

The objective of this paper is to present a new abstract state space for t-time Petri nets which associates with each path in this space a sequence effectively firable in the net. This means that this state space has to exactly (in a quantitative way) define the set of constraints which have to be verified by the firings. After some definitions about the Simple Temporal Networks, the abstract states are defined as well the generation of the abstract space. It is shown that this space does not coincide with the two previously defined spaces (W and A) in TINA.