J. Alglave, A. F. Donaldson, D. Kroening, and M. Tautschnig, Making Software Verification Tools Really Work, Proc. ATVA. Ed. by Tevfik Bultan and Pao-Ann Hsiung, pp.28-42, 2011.
DOI : 10.1007/978-3-642-24372-1_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.233.688

[. Agerwala and M. Flynn, Comments on capabilities, limitations and correctness of Petri nets, Proc. of the Annual Symposium on Computer Architecture. ISCA '73, pp.81-86, 1973.

[. Abdulla, S. P. Iyer, and A. Nylén, SAT-Solving the Coverability Problem for Petri Nets, Formal Methods in System Design, vol.24, issue.1, pp.25-43, 2004.
DOI : 10.1023/B:FORM.0000004786.30007.f8

A. Agarwal, A. Madalinski, and S. Haar, Effective Verification of Weak Diagnosability Supervision and Safety for Technical Processes . Mexico City, Mexico: IFAC, 2012. [Avi67] Algirdas Avi?ienis Design of fault-tolerant computers, Proc. IFAC Symposium on Fault Detection Proc. AFIPS'67 (Fall), pp.733-743, 1967.

J. C. Baeten, A brief history of process algebra, Theoretical Computer Science, vol.335, issue.2-3, pp.131-146, 2005.
DOI : 10.1016/j.tcs.2004.07.036

[. Baldan, A. Bruni, A. Corradini, B. König, and S. Schwoon, On the Computation of McMillan???s Prefix for Contextual Nets and Graph Grammars, In: Proc. ICGT. LNCS, vol.6372, pp.91-106, 2010.
DOI : 10.1007/978-3-642-15928-2_7

[. Baldan, A. Bruni, A. Corradini, B. König, C. Rodríguez et al., Efficient unfolding of contextual Petri nets, Theoretical Computer Science, vol.449, pp.2-22, 2012.
DOI : 10.1016/j.tcs.2012.04.046
URL : https://hal.archives-ouvertes.fr/hal-00776752

J. P. Bowen, R. W. Butler, D. L. Dill, R. L. Glass, D. Gries et al., An Invitation to Formal Methods, Computer, vol.29, issue.4, p.16, 1996.
DOI : 10.1109/MC.1996.488298

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development -Coq'Art: The Calculus of Inductive Constructions, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00344237

S. Balaguer, T. Chatain, and S. Haar, Building Tight Occurrence Nets from Reveals Relations, 2011 Eleventh International Conference on Application of Concurrency to System Design, pp.44-53, 2011.
DOI : 10.1109/ACSD.2011.16
URL : https://hal.archives-ouvertes.fr/inria-00638232

[. Baldan, A. Corradini, B. König, and S. Schwoon, McMillan???s Complete Prefix for Contextual Nets, ToPNoC, pp.199-220, 2008.
DOI : 10.1007/BFb0055644

[. Baldan, A. Corradini, and U. Montanari, 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

E. [. Burch, K. L. Clarke, D. L. Mcmillan, L. J. Dill, and . Hwang, Symbolic model checking: 10/sup 20/ states and beyond, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.142-170, 1992.
DOI : 10.1109/LICS.1990.113767

A. [. Baldan, U. Corradini, and . Montanari, An event structure semantics for P/T contextual nets: Asymmetric event structures, Proc. FoSSaCS, pp.63-80, 1998.
DOI : 10.1007/BFb0053542

E. Best, Partial Order Verification with PEP In: Proc. of Workshop on Partial Order Methods in Verification (POMIV), pp.305-328, 1996.

A. Benveniste, É. Fabre, S. Haar, and C. Jard, Diagnosis of Asynchronous Discrete Event Systems: A Net Unfolding Approach, IEEE Transactions on Automatic Control, vol.485, pp.714-727, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00638345

E. Best and B. Grahlmann, Format descriptions Appendix of: PEP Documentation and User Guide 1.8 Distributed Unfolding of Petri Nets, Proc. FoSSaCS, pp.126-141, 1998.

P. Bishop, Does Software Have to Be Ultra Reliable in Safety Critical Systems?, LNCS, vol.8153, pp.118-129, 2013.
DOI : 10.1007/978-3-642-40793-2_11

C. [. Bonet, R. Llado, W. J. Puijaner, and . Knottenbelt, PIPE v2.5: A Petri Net Tool for Performance Modelling, Proc. CLEI, pp.91-106, 2007.

N. Busi and G. M. Pinna, Non sequential semantics for contextual P/T nets, Proc. ICATPN, pp.113-132, 1996.
DOI : 10.1007/3-540-61363-3_7

T. Ball and S. K. Rajamani, Bebop: A Symbolic Model Checker for Boolean Programs, Proc. SPIN, pp.113-130, 2000.
DOI : 10.1007/10722468_7

. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers C-35, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819

E. M. Clarke and E. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Proc. of Logics of Programs, pp.52-71, 1982.

. [. Clarke, Orna Grumberg, and Doron Peled. Model Checking, 1999.

[. Codish, S. Genaim, and P. J. Stuckey, A declarative encoding of telecommunications feature subscription in SAT, Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, PPDP '09, pp.255-266, 2009.
DOI : 10.1145/1599410.1599442

[. Christensen and N. D. Hansen, Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs, Proc. ICATPN. Ed. by Gerhard Goos, pp.186-205, 1993.
DOI : 10.1007/3-540-56863-8_47
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7925

J. Cook, D. Kroening, and N. Sharygina, A new SAT encoding of the at-most-one constraint Verification of Boolean programs with unbounded thread creation, Proc. Constraint Modelling and Reformulation, pp.1-3, 2007.

G. Christos, S. Cassandras, and . Lafortune, Introduction to Discrete Event Systems, 2008.

E. M. Clarke, The Birth of Model Checking, Orna Grumberg and Helmut Veith. LNCS. Berlin, vol.5000, pp.1-26, 2008.
DOI : 10.1007/978-3-540-69850-0_1

C. James and . Corbett, Evaluating Deadlock Detection Methods for Concurrent Software, IEEE Transactions on Software Engineering, vol.22, pp.161-180, 1996.

]. E. Dij65 and . Dijkstra, Solution of a problem in concurrent programming control, In: Commun. ACM, vol.8, issue.9, p.569, 1965.

A. David, L. Jacobsen, M. Jacobsen, K. Y. Jørgensen, M. H. Møller et al., TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets, Proc. TACAS. 2012, pp.492-497
DOI : 10.1007/978-3-642-28756-5_36

J. Esparza and K. Heljanko, Implementing LTL model checking with net unfoldings, In: Proc. SPIN. LNCS, vol.2057, pp.37-56, 2001.
DOI : 10.1007/3-540-45139-0_4

J. Esparza and K. Heljanko, Unfoldings -A Partial-Order Approach to Model Checking, EATCS Monographs in Theoretical Computer Science, 2008.

J. Esparza and C. Kern, Reactive and Proactive Diagnosis of Distributed Systems Using Net Unfoldings, 2012 12th International Conference on Application of Concurrency to System Design, pp.154-163
DOI : 10.1109/ACSD.2012.19

J. Esparza, P. Kanade, and S. Schwoon, A negative result on depth-first net unfoldings, International Journal on Software Tools for Technology Transfer, vol.6, issue.1, pp.161-166, 2007.
DOI : 10.1007/s10009-007-0030-5

J. Esparza and S. Römer, An Unfolding Algorithm for Synchronous Products of Transition Systems, In: Proc. CON- CUR. LNCS, vol.1664, pp.2-20, 1999.
DOI : 10.1007/3-540-48320-9_2

J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan's unfolding algorithm, In: Formal Methods in System Design, vol.20, pp.285-310, 2002.
DOI : 10.1007/3-540-61042-1_40

J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan's unfolding algorithm, Proc. TACAS. Ed. by Tiziana Margaria and Bernhard Steffen, pp.87-106, 1996.
DOI : 10.1007/3-540-61042-1_40

J. Esparza and C. Schröter, Unfolding Based Algorithms for the Reachability Problem, In: Fund. Inf, vol.47, pp.3-4, 2001.

[. Eén and N. Sörensson, An Extensible SAT-solver, Proc. SAT. LNCS 2919, pp.502-518, 2003.

J. Esparza, A False History of True Concurrency: From Petri to Tools, Proc. SPIN. Ed. by Jaco van de Pol and Michael Weber, pp.180-186, 2010.

E. Fabre and A. Benveniste, Partial Order Techniques for Distributed Discrete Event Systems: Why You Cannot Avoid Using Them, Discrete Event Dynamic Systems, vol.12, issue.3, pp.355-403, 2007.
DOI : 10.1007/s10626-007-0016-1

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

A. M. Frisch, T. J. Peugniez, A. J. Doggett, and P. Nightingale, Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings, Fra86] Nissim Francez. Fairness, pp.1-3, 1986.

M. Gardner, Mathematical games: The fantastic combinations of John Conway's new solitaire game 'Life', In: Scientific American, vol.2234, pp.120-123, 1970.

[. Gershenson, Introduction to Random Boolean Networks the Simulation and Synthesis of Living Systems, Proc. International Conference on, pp.160-173, 2004.

L. Robert, . [. Glass, U. Gadducci, and . Montanari, Formal Methods are a Surrogate for a More Serious Software Concern Axioms for contextual net processes In: Automata, Languages and Programming, In: Computer LNCS, vol.29, issue.1443, pp.16-296, 1996.

[. Haar, Unfold and cover: Qualitative diagnosability for Petri Nets, 2007 46th IEEE Conference on Decision and Control, pp.1886-1891, 2007.
DOI : 10.1109/CDC.2007.4434691
URL : https://hal.archives-ouvertes.fr/inria-00638308

S. Haar, Qualitative diagnosability of labeled petri nets revisited, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, pp.1248-1253, 2009.
DOI : 10.1109/CDC.2009.5400917
URL : https://hal.archives-ouvertes.fr/inria-00638286

S. Haar, Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets, IEEE Transactions on Automatic Control, vol.55, issue.10, pp.2310-2320, 2010.
DOI : 10.1109/TAC.2010.2063490
URL : https://hal.archives-ouvertes.fr/inria-00379540

[. Holloway and R. W. Butler, Impediments to Industrial Use of Formal Methods, In: Computer, vol.29, issue.4, p.16, 1996.

[. Haar, A. Benveniste, E. Fabre, and C. Jard, Partial order diagnosability of discrete event systems using petri net unfoldings, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475), pp.3748-3753, 2003.
DOI : 10.1109/CDC.2003.1271732
URL : https://hal.archives-ouvertes.fr/inria-00638329

H. Heljanko, Deadlock and reachability checking with finite complete prefixes Licentiate's thesis, 1999.

K. Heljanko, Minimizing Finite Complete Prefixes Specification & Programming 1999, Proc. of the Workshop Concurrency, pp.83-95, 1999.
DOI : 10.1007/3-540-44618-4_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.2902

[. Heljanko, Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets, In: Fund. Inf, vol.373, pp.247-268, 1999.
DOI : 10.1007/3-540-49059-0_17

[. Heljanko, Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets, Proc. TACAS, pp.240-254, 1999.
DOI : 10.1007/3-540-49059-0_17

S. Haar and É. Fabre, Diagnosis with Petri Net Unfoldings, pp.301-318, 2013.
DOI : 10.1007/978-1-4471-4276-8_15
URL : https://hal.archives-ouvertes.fr/hal-00926087

[. Haar, C. Kern, and S. Schwoon, Computing the reveals relation in occurrence nets, Theoretical Computer Science, vol.493, pp.66-79, 2013.
DOI : 10.1016/j.tcs.2013.04.028
URL : https://hal.archives-ouvertes.fr/inria-00638262

[. Haar, C. Rodríguez, and S. Schwoon, Reveal Your Faults: It's Only Fair!, 2013 13th International Conference on Application of Concurrency to System Design, pp.120-129
DOI : 10.1109/ACSD.2013.15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.9818

[. Janicki and M. Koutny, Invariant semantics of nets with inhibitor arcs, Proc. CONCUR, pp.317-331, 1991.
DOI : 10.1007/3-540-54430-5_97

R. Janicki and M. Koutny, Structure of concurrency, Theoretical Computer Science, vol.112, issue.1, pp.5-52, 1993.
DOI : 10.1016/0304-3975(93)90238-O

M. [. Janicki and . Koutny, Semantics of Inhibitor Nets, Information and Computation, vol.123, issue.1, pp.1-16, 1995.
DOI : 10.1006/inco.1995.1153

V. Kho, . Khomenko, and . Punf, Model Checking Based on Prefixes of Petri Net Unfoldings, 2003.

V. Khomenko and M. Koutny, LP Deadlock Checking Using Partial Order Dependencies, Proc. CONCUR. LNCS 1877, pp.410-425, 2000.
DOI : 10.1007/3-540-44618-4_30

V. Khomenko and M. Koutny, Towards an Efficient Algorithm for Unfolding Petri Nets, Proc. CONCUR. LNCS 2154, pp.366-380, 2001.
DOI : 10.1007/3-540-44685-0_25

V. Khomenko and M. Koutny, Verification of bounded Petri nets using integer programming, Formal Methods in System Design, vol.30, issue.2, pp.143-176, 2007.
DOI : 10.1007/s10703-006-0022-1

[. Khomenko, A. Kondratyev, M. Koutny, and W. Vogler, Merged Processes ? a New Condensed Representation of Petri Net Behaviour, In: Acta Inf, vol.435, pp.307-330, 2006.

[. Khomenko, M. Koutny, and W. Vogler, Canonical prefixes of Petri net unfoldings, Acta Informatica, vol.402, pp.95-118, 2003.

[. Kordon, A. Linard, M. Becutti, D. Buchs, L. Fronc et al., Web Report on the Model Checking Contest @ Petri Net 2013 An Algorithm for Direct Construction of Complete Merged Processes, Proc. ICATPN. LNCS 6709, pp.89-108, 2011.

V. Khomenko and A. Mokhov, Direct Construction of Complete Merged Processes, The Computer Journal, vol.57, issue.5, 2013.
DOI : 10.1093/comjnl/bxt014

C. John and . Knight, Safety critical systems: challenges and directions, Proc. ICSE, p.547, 2002.

M. Leucker and C. Schallhart, A brief account of runtime verification, The Journal of Logic and Algebraic Programming, vol.78, issue.5, pp.293-303, 2009.
DOI : 10.1016/j.jlap.2008.08.004

L. Kenneth and . Mcmillan, Symbolic model checking, 1993.

L. Kenneth and . Mcmillan, Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, Proc. CAV'92, pp.164-177, 1993.

L. Kenneth and . Mcmillan, Trace theoretic verification of asynchronous circuits using unfoldings, Proc. CAV. Ed. by Pierre Wolper, pp.180-195, 1995.

]. K. Mcm95b and . Mcmillan, A technique of state space search based on unfolding, In: Form. Methods Syst. Des, vol.61, pp.45-65, 1995.

[. Rossi, Verification of Fault Tolerant Algorithms Using PEP. Tech. rep Contextual occurrence nets and concurrent constraint programming, In: Proc. ICGT. LNCS, vol.776, pp.280-295, 1994.

U. Montanari and F. Rossi, Contextual nets, Acta Informatica, vol.112, issue.6, pp.545-596, 1995.
DOI : 10.1007/BF01178907

S. Melzer and S. Römer, Deadlock checking using net unfoldings, In: Proc CAV. LNCS, vol.1254, pp.352-363, 1997.
DOI : 10.1007/3-540-63166-6_35

T. Murata, Petri nets: Properties, analysis and applications, Proc. of the IEEE, pp.541-580, 1989.
DOI : 10.1109/5.24143

[. 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

[. Parnas, Really Rethinking 'Formal Methods', Computer, vol.43, issue.1, pp.28-34, 2010.
DOI : 10.1109/MC.2010.22

D. Peled, All from one, one for all: on model checking using representatives, Proc. CAVPEP] PEP Project. PEP homepage, pp.409-423, 1993.
DOI : 10.1007/3-540-56922-7_34

C. Adam and P. , Communication with automata, 1966.

C. Adam and P. , Non-sequential Processes Research Report 77- 05 Bonn: GMD-ISF, 1977. [Pet81] J.L. Peterson. Petri Nets and the Modeling of Systems, 1981.

[. Pike, S. Niller, and N. Wegmann, Runtime Verification for Ultra-Critical Systems, Proc. Runtime Verification, pp.310-324, 2012.
DOI : 10.1007/978-3-642-29860-8_23

C. Adam, P. , and W. Reisig, Petri net, p.6477, 2008.

J. P. Queille and J. Sifakis, Specification and verification of concurrent systems in CESAR, International Symposium on Programming, pp.337-351, 1982.
DOI : 10.1007/3-540-11494-7_22

]. M. Ray86, Algorithms for Mutual Exclusion Understanding petri nets modeling techniques, analysis methods, case studies [Ris94] Gioia Ristori Modelling Systems with Shared Resources via Petri Nets, Rei13] Wolfgang Reisig, 1986.

[. Rodríguez, Implementation of a complete prefix unfolder for contextual nets, 2010.

[. Rodríguez and S. Schwoon, Verification of Petri Nets with Read Arcs. Tech. rep. LSV-12-12. LSV, ENS de Cachan, France, 2012. [RS12b] César Rodríguez and Stefan Schwoon Verification of Petri Nets with Read Arcs In: CONCUR 2012 ? Concurrency Theory, Maciej Koutny and Irek Ulidowski. LNCS, vol.7454, pp.471-485, 2012.

[. Rodríguez and S. Schwoon, An Improved Construction of Petri Net Unfoldings, Proc. of the French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13 OASICS. Leibniz-Zentrum für Informatik, pp.47-52, 2013.

C. Rodríguez and S. Schwoon, Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs In: Automated Technology for Verification and Analysis (ATVA), LNCS, vol.8172, pp.492-495, 2013.

[. Rodríguez, S. Schwoon, and P. Baldan, Efficient contextual unfolding. Tech. rep. LSV-11-14. This is a full version of, 2011.

[. Rodríguez, S. Schwoon, and P. Baldan, Efficient Contextual Unfolding, LNCS, vol.20, pp.342-357, 2011.
DOI : 10.1007/BFb0055644

[. Rodríguez, S. Schwoon, and V. Khomenko, Contextual Merged Processes, Proc. International Conference on Application and Theory of Petri Nets and Concurrency (ICATPN)
DOI : 10.1007/978-3-642-38697-8_3

P. Darsh, D. Ranjan, S. Tang, and . Malik, A Comparative Study of 2QBF Algorithms, Proc. SAT, 2004.

[. Sinz, Towards an Optimal CNF Encoding of Boolean Cardinality Constraints, Proc. CP. 2005, pp.827-831
DOI : 10.1007/11564751_73

S. Schwoon and C. Rodríguez, Construction and SATbased verification of Contextual Unfoldings, Proc. of the 13th International Workshop on Descriptional Complexity of Formal Systems (DCFS'11, pp.34-42, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00779945

P. M. João, K. A. Silva, and . Sakallah, GRASP -a new search algorithm for satisfiability, Proc. ICCAD, pp.220-227, 1996.

[. Sampath, R. Sengupata, S. Lafortune, K. Sinnamohideen, and D. Teneketzis, Diagnosability of discrete-event systems, IEEE Transactions on Automatic Control, vol.40, issue.9, pp.1555-1575, 1995.
DOI : 10.1109/9.412626

A. Valmari, The state explosion problem, LNCS, vol.1491, pp.429-528, 1998.
DOI : 10.1007/3-540-65306-6_21

W. Vogler, Fairness and partial order semantics, Information Processing Letters, vol.55, issue.1, pp.33-39, 1995.
DOI : 10.1016/0020-0190(95)00049-I

W. Vogler, Partial order semantics and read arcs, Proc. MFCS, pp.508-517, 1997.
DOI : 10.1007/bfb0029994
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.9831

[. Vogler, A. L. Semenov, and A. Yakovlev, Unfolding and finite prefix for nets with read arcs, In: Proc. CONCUR. LNCS, vol.1466, pp.501-516, 1998.
DOI : 10.1007/BFb0055644

A. Wassyng, Who Are We, and What Are We Doing Here?, Proc. FM. Ed. by Dimitra Giannakopoulou and Dominique Méry, pp.7-9, 2012.
DOI : 10.1007/978-3-642-32759-9_3

]. Wik13, . Wikipedia, . Petri, and . Wikipedia, The Free Encyclopedia. [Online; accessed 18, 2013.

J. Winkowski, Reachability in Contextual Nets, In: Fund. Inf, vol.51, pp.1-2, 2002.

J. Winkowski, Processes of Contextual Nets and their Characteristics, In: Fundamenta Informaticae, vol.36, issue.1, pp.71-101, 1998.