C. André, F. Boulanger, and A. Girault, Software implementation of synchronous programs, Proceedings Second International Conference on Application of Concurrency to System Design, 2001.
DOI : 10.1109/CSD.2001.981771

G. Berry, The foundations of Esterel, Language and Interaction: Essays in Honour of Robin Milner, 1998.

E. Best and R. P. Hopkins, B(PN) 2 ??? a basic Petri net programming notation, PARLE'93, 1993.
DOI : 10.1007/3-540-56891-3_30

E. Best and H. Wimmel, Reducing k-Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets, 2000.
DOI : 10.1007/3-540-44988-4_6

E. Boufa¨?edboufa¨?ed, Machines d'exécution pour langages synchrones, 1998.

C. Bui-thanh, H. Klaudel, and F. Pommereau, Petri nets with causal time for system verification, MTCS'02, ENTCS, 2002.

R. Durchholz, Causality, time, and deadlines, Data & Knowledge Engineering, vol.6, issue.6, 1991.
DOI : 10.1016/0169-023X(91)90024-R

J. Esparza, Model checking using net unfoldings, Science of Computer Programming, 1994.

T. Junttila, On the Symmetry Reduction Method for Petri Nets and Similar Formalisms, 2003.

H. Klaudel and F. Pommereau, A Concurrent Semantics of Static Exceptions in a Parallel Programming Language, ICATPN'01, 2001.
DOI : 10.1007/3-540-45740-2_13
URL : https://hal.archives-ouvertes.fr/hal-00114689

H. Klaudel and F. Pommereau, A class of composable and preemptible high-level Petri nets with an application to multi-tasking systems, Fundamenta Informaticae, vol.50, issue.1, pp.33-55, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00114685

F. Pommereau, Modèles composables et concurrents pour le temps-réel, 2002.

F. Pommereau, Causal Time Calculus, FORMATS'03, LNCS

G. Richter, Counting interfaces for discrete time modeling, 1998.