In: Doron A. Peled, Yih-Kuen Tsay (Eds.): Lecture Notes in Computer Science, 3707: Automated Technology for Verification and Analysis: Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005., pages 278-292. Springer-Verlag, October 2005. URL: http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/1156294822,.
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.
Back to the Petri Nets Bibliography