State Class Constructions for Branching Analysis of Time Petri Nets ,
DOI : 10.1007/3-540-36577-X_33
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets, Petri Nets and Other Models of Concurrency -ICATPN 2006, pp.125-145, 2006. ,
DOI : 10.1007/11767589_8
Algebraic analysis of branching processes, Sixth International Conference on Advances in System Testing and Validation Lifecycle, pp.21-27, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01111142
An algebra for branching processes, 2013 International Conference on Control, Decision and Information Technologies (CoDIT), pp.625-634, 2013. ,
DOI : 10.1109/CoDIT.2013.6689616
URL : https://hal.archives-ouvertes.fr/hal-01111131
Boundedness of Reset P/T Nets, Proceedings of the 26th ICALP'99, pp.301-310, 1999. ,
DOI : 10.1007/3-540-48523-6_27
Branching processes of Petri nets, Acta Informatica, vol.4, issue.6, pp.575-591, 1991. ,
DOI : 10.1007/BF01463946
Unfoldings -a partial-order approach to model checking, EATCS Monographs in Theoretical Computer Science, 2008. ,
An improvement of McMillan's unfolding algorithm, 1996. ,
DOI : 10.1007/3-540-61042-1_40
An improvement of mcmillan's unfolding algorithm. Formal Methods in System Design, pp.285-310, 2002. ,
Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, Computer Aided Verification, pp.164-177, 1993. ,
A technique of state space search based on unfolding, Formal Methods in System Design, vol.22, issue.12, pp.45-65, 1995. ,
DOI : 10.1007/BF01384314
Vérification et mise en oeuvre des réseaux de Petri. Traité IC2, Hermès Science, 2003. ,
Communication with automata, 1962. ,