K. [. Abdulla, B. Cer¯-ans, Y. K. Jonsson, and . Tsay, Algorithmic Analysis of Programs with Well Quasi-ordered Domains, Information and Computation, vol.160, issue.1-2, pp.109-127, 2000.
DOI : 10.1006/inco.1999.2843

P. A. Abdulla, S. P. Iyer, and A. Nylén, Unfoldings of Unbounded Petri Nets, Proc. of 12th Int. Conf. on Computer Aided Verification, pp.495-507, 2000.
DOI : 10.1007/10722167_37

P. A. Abdulla, B. Jonsson, M. Kindahl, and D. Peled, A general approach to partial order reductions in symbolic verification, Proc. of 10th Int. Conf. on Computer Aided Verification (CAV '98)Arn94] A. Arnold. Finite Transition Systems. Semantics of Communicating Systems, pp.379-390, 1994.
DOI : 10.1007/BFb0028760

J. Couvreur, S. Grivet, D. Poitrenaud, J. Desel, G. Juhás et al., Unfolding of products of symmetrical petri nets Finite unfoldings of unbounded petri nets An unfolding algorithm for synchronous products of transition systems, Proc. 22nd Int. Conf. on Application and Theory of Petri Nets (ICATPN'01), volume 2075 of Lecture Notes in Computer Science Proc. 25th Int. Conf. on Applications and Theory of Petri Nets 10th Int. Conf. on Concurrency Theory (CONCUR'99), volume 1664 of Lecture Notes in Computer Science, pp.121-143, 1999.

J. Esparza, S. Römer, W. Voglerfs01, ]. Finkel, P. Schnoebelengod96-]-p et al., Reduction and covering of infinite reachability trees Information and Computation Well-structured transition systems everywhere! Theoretical Computer Science Partial-order methods for the verification of concurrent systems: An approach to the state-explosion problem Branching processes of high-level petri nets An approach to unfolding asynchronous communication protocols, Formal Methods in System Design Proc. 9th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03) Proc. 13th Int. Symp. on Formal Methods (FM'05) Advances in Petri Nets, pp.285-310144, 1986.

K. L. Mcmillan, A technique of state space search based on unfolding, Formal Methods in System Design, vol.22, issue.12, pp.45-45, 1995.
DOI : 10.1007/BF01384314

M. Nielsen, G. Plotkin, and G. Winskel, Petri nets, event structures and domains, part I, Theoretical Computer Science, vol.13, issue.1, pp.85-108, 1981.
DOI : 10.1016/0304-3975(81)90112-2
URL : http://doi.org/10.1016/0304-3975(81)90112-2

M. Nielsen, G. Rozenberg, and P. S. Thiagarajan, Transition systems, event structures and unfoldings. Information and Computation [Pel93] D. Peled. All from one, one for all: on model checking using representatives Stubborn sets for reduced state space generation, Proc. of the 5th Int. Conf. on Computer Aided Verification Proc. of 10th Int. Conf. on Applications and Theory of Petri Nets (ICATPN'90), number 483 in Lecture Notes in Computer Science, pp.191-207, 1991.
DOI : 10.7146/dpb.v20i353.6583
URL : http://dx.doi.org/10.1006/inco.1995.1062