Time processes for time Petri nets, ICATPN, pp.136-155, 1997. ,
DOI : 10.1007/3-540-63139-9_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.946
Contextual Petri Nets, Asymmetric Event Structures, and Processes, Information and Computation, vol.171, issue.1, pp.1-49, 2001. ,
DOI : 10.1006/inco.2001.3060
URL : http://doi.org/10.1006/inco.2001.3060
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
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
State Class Constructions for Branching Analysis of Time Petri Nets, TACAS, pp.442-457, 2003. ,
DOI : 10.1007/3-540-36577-X_33
Structure Theory of Petri Nets, pp.168-205, 1987. ,
DOI : 10.1007/978-3-642-38143-0_5
Symbolic Diagnosis of Partially Observable Concurrent Systems, In FORTE, pp.326-342, 2004. ,
DOI : 10.1007/978-3-540-30232-2_21
Branching processes of Petri nets, Acta Informatica, vol.4, issue.6, pp.575-591, 1991. ,
DOI : 10.1007/BF01463946
An improvement of McMillan's unfolding algorithm, TACAS, pp.87-106, 1996. ,
DOI : 10.1007/3-540-61042-1_40
Computing a Finite Prefix of a Time Petri Net, ICATPN, pp.163-181, 2002. ,
DOI : 10.1007/3-540-48068-4_11
Recoverability of communication protocols ? implications of a theorical study, IEEE Transactions on Communications, vol.24, 1976. ,
Scenario duration characterization of ttimed Petri nets using linear logic, IEEE PNPM, pp.208-217, 1999. ,
Verification of asynchronous circuits using time Petri net unfolding, DAC'96: Proceedings of the 33rd annual conference on Design automation, pp.59-62, 1996. ,