P. A. Abdulla, S. P. Iyer, and A. Nylen, Unfoldings of Unbounded Petri Nets, Proceedings of CAV, pp.495-507, 2000.
DOI : 10.1007/10722167_37

K. Altisen and S. Tripakis, Implementation of timed automata: An issue of semantics or modeling? Formal Modeling and Analysis of Timed Systems, pp.273-288, 2005.

R. Alur, C. Courcoubetis, and D. L. Dill, Model-checking for real-time systems, 5th IEEE Symposium on Logic in Computer Science, pp.414-425, 1990.

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

R. Alur, L. Fix, and T. A. Henzinger, A determinizable class of timed automata, Proceedings of the 6th International Conference on Computer Aided Verification, CAV '94, pp.1-13, 1994.
DOI : 10.1007/3-540-58179-0_39

T. Aura and J. Lilius, A causal semantics for time Petri nets, Theoretical Computer Science, vol.243, issue.1-2, pp.409-447, 2000.
DOI : 10.1016/S0304-3975(99)00114-0

R. Bagnara, P. M. Hill, and E. Zaffanella, Not necessarily closed convex polyhedra and the double description method, Formal Aspects of Computing, vol.17, issue.2, pp.222-257, 2005.
DOI : 10.1007/s00165-005-0061-1

R. Bagnara, P. M. Hill, E. Zaffanella, ]. S. Balaguer, . Th et al., The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems, Proceedings of the 17th International Symposium on Temporal Representation and Reasoning (TIME'10), pp.3-21, 2008.
DOI : 10.1016/j.scico.2007.08.001

P. Baldan, N. Busi, A. Corradini, and G. M. Pinna, Functional Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs, In CON- CUR Lecture Notes in Computer Science, vol.1877, pp.442-457, 2000.
DOI : 10.1007/3-540-44618-4_32

R. E. Bellman, Dynamic Programming, p.57, 1957.

J. Bengtsson and W. Yi, Timed automata: Semantics, algorithms and tools. Lectures on Concurrency and Petri Nets, pp.87-124, 2004.
DOI : 10.1007/978-3-540-27755-2_3

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.8701

A. Benveniste, E. Fabre, S. Haar, and C. Jard, Diagnosis of asynchronous discrete-event systems: a net unfolding approach, IEEE Transactions on Automatic Control, vol.48, issue.5, pp.714-727, 2003.
DOI : 10.1109/TAC.2003.811249

URL : https://hal.archives-ouvertes.fr/inria-00638345

B. Bérard, F. Cassez, S. Haddad, D. Lime, and O. Roux, Comparison of the expressiveness of timed automata and time Petri nets. Formal Modeling and Analysis of Timed Systems, pp.211-225, 2005.

B. Bérard, F. Cassez, S. Haddad, D. Lime, and O. H. Roux, When are timed automata weakly timed bisimilar to time Petri nets? Theoretical Computer Science, pp.202-220, 2008.

B. Bérard, P. Gastin, and A. Petit, On the power of non-observable actions in timed automata, STACS, vol.96, issue.16, pp.255-268, 1996.
DOI : 10.1007/3-540-60922-9_22

B. Bérard, A. Petit, V. Diekert, and P. Gastin, Characterization of the expressive power of silent transitions in timed automata, Fundamenta Informaticae, vol.36, issue.34, pp.145-182, 1998.

B. Berthomieu and M. Diaz, Modeling and verification of time dependent systems using time Petri nets, IEEE Transactions on Software Engineering, vol.17, issue.3, pp.259-273, 1991.
DOI : 10.1109/32.75415

B. Berthomieu, D. Lime, O. H. Roux, and F. Vernadat, Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches, Journal of Discrete Event Dynamic Systems -Theory and Applications (DEDS), pp.133-158, 2007.
DOI : 10.1007/s10626-006-0011-y

URL : https://hal.archives-ouvertes.fr/hal-00489016

B. Berthomieu and M. Menasche, An enumerative approach for analyzing time Petri nets In Information Processing: proceedings of the IFIP congress 1983, volume 9 of IFIP congress series, pp.41-46, 1983.

E. Best and H. Wimmel, Reducing k-safe Petri nets to pomsetequivalent 1-safe Petri nets, Proceedings of the 21st international conference on Application and theory of petri nets, pp.63-82, 2000.

P. Bouyer and F. Chevalier, On conciseness of extensions of timed automata, Journal of Automata, Languages and Combinatorics, vol.10, issue.4, pp.393-58, 2005.

P. Bouyer, C. Dufourd, E. Fleury, and A. Petit, Updatable timed automata, Theoretical Computer Science, vol.321, issue.2-3, pp.291-345, 2004.
DOI : 10.1016/j.tcs.2004.04.003

URL : https://hal.archives-ouvertes.fr/hal-00350196

P. Bouyer, S. Haddad, and P. Reynier, Timed unfoldings for networks of timed automata. Automated Technology for Verification and Analysis, pp.292-306, 2006.

P. Bouyer, S. Haddad, and P. Reynier, Undecidability results for timed automata with silent transitions, Fundamenta Informaticae, vol.92, issue.16, pp.1-25, 2009.

C. G. Cassandras and S. Lafortune, Introduction to discrete event systems , Second Edition, p.75, 2008.

F. Cassez, T. Chatain, and C. Jard, Symbolic Unfoldings for Networks of Timed Automata, Proc. of the 4th International Symposium on Automated Technology for Verification and Analysis, ATVA 2006, number 4218 in Lecture Notes in Computer Science, pp.307-321, 2006.
DOI : 10.1007/11901914_24

URL : https://hal.archives-ouvertes.fr/inria-00363033

F. Cassez and O. Roux, From Time Petri Nets to Timed Automata, Fourth International Workshop on Automated Verification of Critical Systems (AVoCS'04), p.63, 2004.
DOI : 10.5772/5320

URL : https://hal.archives-ouvertes.fr/hal-00139236

F. Cassez and O. Roux, Structural translation from Time Petri Nets to Timed Automata, Journal of Systems and Software, vol.79, issue.10, pp.1456-1468, 2006.
DOI : 10.1016/j.jss.2005.12.021

URL : https://hal.archives-ouvertes.fr/hal-00139236

T. Chatain, Symbolic unfoldings of high-level Petri nets and application to supervision of distributed systems, p.34, 2006.

T. Chatain and J. Claude, Sémantique concurrente symbolique des réseaux de Petri saufs et dépliages finis des réseaux temporels, Proceedings of NOTERE, p.75, 2010.

T. Chatain and C. Jard, Time supervision of concurrent systems using symbolic unfoldings of time Petri nets. Formal Modeling and Analysis of Timed Systems, pp.196-210, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000342

T. Chatain and C. Jard, Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets, Proceedings of ICATPN, pp.125-145, 2006.
DOI : 10.1007/11767589_8

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms, p.149, 2001.

D. Corona, A. Giua, and C. Seatzu, Marking estimation of Petri nets with silent transitions, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601), pp.966-971, 2004.
DOI : 10.1109/CDC.2004.1428810

D. D. 'aprile, S. Donatelli, A. Sangnier, and J. Sproston, From time Petri nets to timed automata: an untimed approach, TACAS'07: Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems, pp.216-230, 2007.

C. Daws and P. Kordy, Symbolic robustness analysis of timed automata. Formal Modeling and Analysis of Timed Systems, pp.143-155, 2006.

M. De-wulf, L. Doyen, N. Markey, and J. Raskin, Robust safety of timed automata. Formal Methods in System Design, pp.45-84, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01194592

V. Diekert, P. Gastin, and A. Petit, Removing ??-transitions in timed automata, STACS 97, pp.583-594, 1997.
DOI : 10.1007/BFb0023491

J. Esparza, Model checking using net unfoldings Selected papers of the colloquium on Formal approaches of software engineering The Netherlands, The Netherlands, TAPSOFT '93, pp.151-195, 1994.

J. Esparza and K. Heljanko, A New Unfolding Approach to LTL Model Checking, ICALP '00: Proceedings of the 27th International Colloquium on Automata, Languages and Programming, pp.475-486, 2000.
DOI : 10.1007/3-540-45022-X_40

J. Esparza and K. Heljanko, Unfoldings: A partial-order approach to model checking, pp.75-115, 2008.

E. Fabre, Trellis Processes : A Compact Representation for Runs of Concurrent Systems, Discrete Event Dynamic Systems, vol.12, issue.3, pp.267-306, 2007.
DOI : 10.1007/s10626-006-0001-0

URL : https://hal.archives-ouvertes.fr/inria-00070452

E. Fabre, A. Benveniste, S. Haar, and C. Jard, Distributed Monitoring of Concurrent and Asynchronous Systems*, Discrete Event Dynamic Systems, vol.15, issue.1, pp.33-84, 2005.
DOI : 10.1007/s10626-005-5238-5

URL : https://hal.archives-ouvertes.fr/inria-00638342

C. Fidge, Timestamps in message-passing systems that preserve the partial ordering, Proceedings of the 11th Australian Computer Science Conference, pp.56-66, 1988.

C. Fidge, Logical time in distributed computing systems, Computer, vol.24, issue.8, pp.28-33, 1991.
DOI : 10.1109/2.84874

I. Foster, What is the grid? a three point checklist, GRID today, vol.1, issue.6 2, pp.32-36, 2002.

G. Gardey, D. Lime, M. Magnin, and O. Roux, Romeo: A Tool for Analyzing Time Petri Nets, Computer Aided Verification, pp.418-423, 2005.
DOI : 10.1007/11513988_41

URL : https://hal.archives-ouvertes.fr/hal-00523596

A. Giua, Petri net state estimators based on event observation, Proceedings of the 36th IEEE Conference on Decision and Control, pp.4086-4091, 1997.
DOI : 10.1109/CDC.1997.652507

B. Grabiec and C. Jard, Unfolding of networks of automata and their application in supervision, 9th Annual International Conference on New Technologies of Distributed Systems, pp.76-104, 2009.

B. Grabiec, L. Traonouez, C. Jard, D. Lime, and O. H. Roux, Diagnosis Using Unfoldings of Parametric Time Petri Nets, 8th International Conference on Formal Modelling and Analysis of Timed Systems, p.175, 2010.
DOI : 10.1007/978-3-642-15297-9_12

URL : https://hal.archives-ouvertes.fr/hal-00523597

B. Grahlmann, The PEP tool, Computer Aided Verification, pp.440-443, 1997.
DOI : 10.1007/3-540-63166-6_43

V. Gupta, T. Henzinger, and R. Jagadeesan, Robust timed automata, Hybrid and Real-Time Systems, pp.331-345, 1997.
DOI : 10.1007/BFb0014736

S. Haar, L. Kaiser, F. Simonot-lion, and J. Toussaint, Equivalence of timed state machines and safe TPN, Sixth International Workshop on Discrete Event Systems, 2002. Proceedings., pp.119-124, 2002.
DOI : 10.1109/WODES.2002.1167678

URL : https://hal.archives-ouvertes.fr/inria-00100864

T. Henzinger, P. Kopke, A. Puri, P. Varaiya, J. Jessen et al., What's Decidable about Hybrid Automata?, Proceedings of the 19th International Conference on Formal Modeling and Analysis of Timed Systems, pp.94-124, 1998.
DOI : 10.1006/jcss.1998.1581

URL : http://doi.org/10.1006/jcss.1998.1581

N. D. Jones, L. H. Landweber, and Y. E. Lien, Complexity of some problems in Petri nets, Theoretical Computer Science, vol.4, issue.3, pp.277-299, 1977.
DOI : 10.1016/0304-3975(77)90014-7

V. Khomenko and M. Koutny, Branching Processes of High-Level Petri Nets, Proceedings of TACAS, pp.458-472, 2003.
DOI : 10.1007/3-540-36577-X_34

V. Khomenko, M. Koutny, and A. Yakovlev, Detecting state encoding conflicts in STG unfoldings using SAT, Fundamenta Informaticae, vol.62, issue.17, pp.221-241, 2004.

V. Khomenko, M. Koutny, and A. Yakovlev, Logic synthesis for asynchronous circuits based on STG unfoldings and incremental SAT, Fundamenta Informaticae, vol.70, issue.17, pp.49-73, 2006.

K. Larsen and W. Yi, Time abstracted bisimulation: Implicit specifications and decidability, Mathematical Foundations of Programming Semantics, pp.160-176, 1994.

K. G. Larsen, P. Pettersson, and W. Yi, Uppaal in a nutshell, International Journal on Software Tools for Technology Transfer, vol.1, issue.1-2, pp.134-152, 1997.
DOI : 10.1007/s100090050010

S. Lasota and I. Walukiewicz, Alternating timed automata, ACM Transactions on Computational Logic, vol.9, issue.2, pp.1-27, 2008.
DOI : 10.1145/1342991.1342994

URL : https://hal.archives-ouvertes.fr/hal-00335734

D. Lime and O. Roux, State class timed automaton of a time Petri net, 10th International Workshop on Petri Nets and Performance Models, 2003. Proceedings., pp.124-133, 2003.
DOI : 10.1109/PNPM.2003.1231549

URL : https://hal.archives-ouvertes.fr/hal-00523588

D. Lime and O. Roux, Model checking of time Petri nets using the state class timed automaton. Discrete Event Dynamic Systems, pp.179-205, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00488957

A. Madalinski and E. Fabre, Modular construction of finite and complete prefixes, Workshop Organisation, pp.69-178, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00204548

F. Mattem, Virtual time and global states of distributed systems. Parallel and Distributed Algorithms, pp.215-226, 1989.

K. L. Mcmillan, Using unfolding to avoid the state space explosion problem in the verification of asynchronous circuits, Proceedings of CAV, pp.164-177, 1992.

K. L. Mcmillan, Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, CAV '92: Proceedings of the Fourth International Workshop on Computer Aided Verification, pp.164-177, 1993.
DOI : 10.1007/3-540-56496-9_14

P. M. Merlin, A study of the recoverability of computing systems, pp.53-112, 1974.

R. Meyer, V. Khomenko, and T. Strazny, A Practical Approach to Verification of Mobile Systems Using Net Unfoldings, Fundamenta Informaticae, vol.94, issue.17, pp.439-471, 2009.
DOI : 10.1007/978-3-540-68746-7_22

D. L. Mills, Computer network time synchronization: The Network Time Protocol, p.178, 2006.
DOI : 10.1201/9781420006155

X. Nicollin and J. Sifakis, An overview and synthesis on timed process algebras, Computer Aided Verification, pp.376-398
DOI : 10.1007/3-540-55179-4_36

J. Ouaknine and J. Worrell, On the language inclusion problem for timed automata: closing a decidability gap, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.54-63, 2004.
DOI : 10.1109/LICS.2004.1319600

J. L. Peterson, Petri net theory and the modeling of systems, p.123, 1981.

C. A. Petri, Kommunikation mit Automaten, p.52, 1962.

C. Ramchandani, Analysis of asynchronous concurrent systems by timed Petri nets, p.53, 1974.

J. Raskin, An introduction to hybrid automata. Handbook of networked and embedded control systems, pp.491-517, 2005.
DOI : 10.1007/0-8176-4404-0_21

C. Schröter, S. Schwoon, J. Esparza, and ]. Srba, The model-checking kit The Netherlands Comparing the expressiveness of timed automata and timed extensions of Petri nets, Applications and Theory of Petri Nets 2003: 24th International Conference , ICATPN 2003 Proceedings Proceedings of the 6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08), pp.1021-1022, 2003.

C. Stehno, Real-time systems design with PEP. Tools and Algorithms for the Construction and Analysis of Systems, pp.476-480, 2002.

L. M. Traonouez, Vérification et dépliages de réseaux de Petri temporels paramétrés, pp.98-161

L. Traonouez, B. Grabiec, C. Jard, D. Lime, and O. H. Roux, Symbolic Unfolding of Parametric Stopwatch Petri Nets, 8th International Symposium on Automated Technology for Verification and Analysis, pp.34-76, 2010.
DOI : 10.1007/978-3-642-15643-4_22

URL : https://hal.archives-ouvertes.fr/hal-00840368

L. Traonouez, D. Lime, and O. H. Roux, Parametric modelchecking of stopwatch Petri nets, Journal of Universal Computer Science, vol.15, issue.75, pp.3273-3304, 1959.
URL : https://hal.archives-ouvertes.fr/hal-00489033

T. Ushio, I. Onishi, and K. Okuda, Fault detection based on Petri net models with faulty behaviors, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), pp.113-118, 1998.
DOI : 10.1109/ICSMC.1998.725394

M. Wulf, L. Doyen, and J. Raskin, Almost ASAP semantics: from timed models to timed implementations, Formal Aspects of Computing, vol.17, issue.3, pp.319-341, 2005.
DOI : 10.1007/s00165-005-0067-8