Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets-Reference-Cited by-同舟云学术

Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets

Published:2006 Issue: Volume: Page:125-145
ISSN:0302-9743
Container-title:Petri Nets and Other Models of Concurrency - ICATPN 2006
language:
Short-container-title:

Author:

Chatain Thomas,Jard Claude

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11767589_8.pdf

Reference18 articles.

1. Kitai, T., Oguro, Y., Yoneda, T., Mercer, E., Myers, C.: Partial order reduction for timed circuit verification based on a level oriented model. IEICE Trans. E86-D(12), 2601–2611 (2001)

2. Lecture Notes in Computer Science;W. Penczek,2001

3. Chatain, T., Jard, C.: Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.??3829, pp. 196???210. Springer, Heidelberg (2005);

4. Extended version available in INRIA Research Report RR-5706

5. Lecture Notes in Computer Science;T. Aura,1997

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Languages of Higher-Dimensional Timed Automata;Lecture Notes in Computer Science;2024

2. Taking Complete Finite Prefixes to High Level, Symbolically;Application and Theory of Petri Nets and Concurrency;2023

3. A Local-Time Semantics for Negotiations;Lecture Notes in Computer Science;2023

4. Delay-dependent partial order reduction technique for real time systems;Real-Time Systems;2017-12-14

5. Preserving Partial-Order Runs in Parametric Time Petri Nets;ACM Transactions on Embedded Computing Systems;2017-04-14