Bibliography

Major publications by the team in recent years

• 1S. Balaguer, Th. Chatain.
  Avoiding Shared Clocks in Networks of Timed Automata, in: Logical Methods in Computer Science, November 2013, vol. 9, n^o 4:13.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BC-lmcs13.pdf
• 2P. Baldan, A. Bruni, A. Corradini, B. König, C. Rodríguez, S. Schwoon.
  Efficient unfolding of contextual Petri nets, in: Theoretical Computer Science, August 2012, vol. 449, n^o 1, pp. 2-22.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bbckrs-tcs12.pdf
• 3B. Barbot, S. Haddad, C. Picaronny.
  Coupling and Importance Sampling for Statistical Model Checking, in: Proceedings of the 18th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'12), Tallinn, Estonia, C. Flanagan, B. König (editors), Lecture Notes in Computer Science, Springer, March 2012, vol. 7214, pp. 331-346.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHP-tacas12.pdf
• 4B. Bollig.
  Logic for Communicating Automata with Parameterized Topology, in: Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/IEEE Symposium on Logic In Computer Science (CSL/LICS'14), Vienna, Austria, ACM Press, July 2014.
  http://hal.inria.fr/hal-00872807/
• 5B. Bollig, P. Gastin, B. Monmege, M. Zeitoun.
  Pebble Weighted Automata and Weighted Logics, in: ACM Transactions on Computational Logic, April 2014, vol. 15, n^o 2:15.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGMZ-tocl13.pdf
• 6A. Cyriac, P. Gastin, K. Narayan Kumar.
  MSO Decidability of Multi-Pushdown Systems via Split-Width, in: Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), Newcastle, UK, M. Koutny, I. Ulidowski (editors), Lecture Notes in Computer Science, Springer, September 2012, vol. 7454, pp. 547-561.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CGN-concur12.pdf
• 7S. Haar, S. Haddad, T. Melliti, S. Schwoon.
  Optimal Constructions for Active Diagnosis, in: Proceedings of the 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), Guwahati, India, A. Seth, N. Vishnoi (editors), Leibniz International Proceedings in Informatics, Leibniz-Zentrum für Informatik, December 2013, vol. 24, pp. 527-539.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HHMS13-fsttcs.pdf
• 8S. Haar, C. Kern, S. Schwoon.
  Computing the Reveals Relation in Occurrence Nets, in: Theoretical Computer Science, July 2013, vol. 493, pp. 66-79.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HKS-tcs13.pdf
• 9S. Haddad, J. Mairesse, H.-T. Nguyen.
  Synthesis and Analysis of Product-form Petri Nets, in: Fundamenta Informaticae, 2013, vol. 122, n^o 1-2, pp. 147-172.
  https://hal.archives-ouvertes.fr/hal-00925774
• 10H. Ponce De León, S. Haar, D. Longuet.
  Model-Based Testing for Concurrent Systems with Labeled Event Structures, in: Software Testing, Verification and Reliability, November 2014, vol. 24, n^o 7, pp. 558-590.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/PHL-stvr14.pdf

Publications of the year

Doctoral Dissertations and Habilitation Theses

• 11B. Barbot.
  Acceleration for Statistical Model Checking, ENS Cachan, November 2014.
  https://hal.archives-ouvertes.fr/tel-01110159
• 12A. Cyriac.
  Verification of Communicating Recursive Programs via Split-width, ENS Cachan, January 2014.
  https://hal.archives-ouvertes.fr/tel-01110177
• 13H. Ponce De León.
  Testing Concurrent Systems Through Event Structures, Ecole Normale Superieure de Cachan, November 2014.
  https://hal.inria.fr/tel-01095412

Articles in International Peer-Reviewed Journals

• 14S. Akshay, B. Bollig, P. Gastin, M. Mukund, K. Narayan Kumar.
  Distributed Timed Automata with Independently Evolving Clocks, in: Fundamenta Informaticae, April 2014, vol. 130, n^o 4, pp. 377-407.
  https://hal.archives-ouvertes.fr/hal-01089524
• 15M. Beccuti, G. Franceschinis, D. Codetta-Raiteri, S. Haddad.
  Computing Optimal Repair Strategies by Means of NdRFT Modeling and Analysis, in: The Computer Journal, 2014, vol. 57, n^o 12, pp. 1870-1892. [ DOI : 10.1093/comjnl/bxt134 ]
  https://hal.archives-ouvertes.fr/hal-01110130
• 16L. Bernardinello, C. Ferigato, S. Haar, L. Pomello.
  Closed Sets in Occurrence Nets with Conflicts, in: Fundamenta Informaticae, 2014, vol. 133, n^o 4, pp. 323-344.
  https://hal.archives-ouvertes.fr/hal-01091152
• 17B. Bollig, A. Cyriac, P. Gastin, M. Zeitoun.
  Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking, in: Journal of Applied Logic, 2014, vol. 12, n^o 4, pp. 395-416. [ DOI : 10.1016/j.jal.2014.05.001 ]
  https://hal.archives-ouvertes.fr/hal-01005353
• 18B. Bollig, P. Gastin, B. Monmege, M. Zeitoun.
  Pebble Weighted Automata and Weighted Logics, in: ACM Transactions on Computational Logic, April 2014, vol. 15, n^o 2, 15 p, 34 pages. [ DOI : 10.1145/2579819 ]
  https://hal.archives-ouvertes.fr/hal-00964994
• 19T. Chatain, S. Haar.
  A Canonical Contraction for Safe Petri Nets, in: Transactions on Petri Nets and Other Models of Concurrency, 2014, vol. LNCS 8910, pp. 83-98.
  https://hal.archives-ouvertes.fr/hal-01091171
• 20P. Gastin, B. Monmege.
  Adding Pebbles to Weighted Automata - Easy Specification & Efficient Evaluation, in: Theoretical Computer Science, 2014, vol. 534, pp. 24-44.
  https://hal.archives-ouvertes.fr/hal-01091105
• 21H. Ponce De León, S. Haar, D. Longuet.
  Model Based Testing for Concurrent Systems with Labeled Event Structures, in: Journal of Software Testing, Verification, and Reliability, August 2014, vol. 24, n^o 7, pp. 558–590. [ DOI : 10.1002/stvr.1543 ]
  https://hal.inria.fr/hal-00914796
• 22H. Ponce De León, S. Haar, D. Longuet.
  Model-based Testing for Concurrent Systems: Unfolding-based Test Selection, in: International Journal on Software Tools for Technology Transfer, November 2014, pp. 14-28. [ DOI : 10.1007/s10009-014-0353-y ]
  https://hal.inria.fr/hal-00996000

Invited Conferences

• 23C. Aiswarya, P. Gastin.
  Reasoning about distributed systems: WYSIWYG, in: 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), New Delhi, India, December 2014.
  https://hal.archives-ouvertes.fr/hal-01091168

International Conferences with Proceedings

• 24C. Aiswarya, P. Gastin, K. Narayan Kumar.
  Controllers for the Verification of Communicating Multi-Pushdown Systems, in: 25th International Conference on Concurrency Theory (CONCUR), Rome, Italy, Springer, 2014, vol. LNCS 8704, pp. 297-311.
  https://hal.archives-ouvertes.fr/hal-01057525
• 25B. Barbot, S. Haddad, M. Heiner, C. Picaronny.
  Rare Event Handling in Signalling Cascades, in: 6th International Conference on Advances in System Simulation (SIMUL'14), Nice, France, 2014, pp. 126-131.
  https://hal.archives-ouvertes.fr/hal-01091144
• 26N. Bertrand, E. Fabre, S. Haar, S. Haddad, L. Hélouët.
  Active diagnosis for probabilistic systems, in: 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'14), Grenoble, France, A. Muscholl (editor), Proceedings of FOSSACS 2014, Springer, April 2014. [ DOI : 10.1007/978-3-642-54830-7_2 ]
  https://hal.inria.fr/hal-00930919
• 27N. Bertrand, S. Haddad, E. Lefaucheux.
  Foundation of Diagnosis and Predictability in Probabilistic Systems, in: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), New Delhi, India, December 2014.
  https://hal.inria.fr/hal-01088117
• 28B. Bollig.
  Logic for Communicating Automata with Parameterized Topology, in: Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/IEEE Symposium on Logic in Computer Science (CSL-LICS'14), Vienna, Austria, July 2014.
  https://hal.archives-ouvertes.fr/hal-00872807
• 29B. Bollig, P. Gastin, A. Kumar.
  Parameterized Communicating Automata: Complementation and Model Checking, in: 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), New Delhi, India, December 2014.
  https://hal.archives-ouvertes.fr/hal-01030765
• 30B. Bollig, P. Gastin, B. Monmege, M. Zeitoun.
  Logical Characterization of Weighted Pebble Walking Automata, in: CSL-LICS '14, Vienna, Austria, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), July 2014. [ DOI : 10.1145/2603088.2603118 ]
  https://hal.archives-ouvertes.fr/hal-01006125
• 31B. Bollig, P. Gastin, J. Schubert.
  Parameterized Verification of Communicating Automata under Context Bounds, in: 8th Workshop on Reachability Problems in Computational Models (RP'14), Oxford, United Kingdom, Springer, 2014, vol. LNCS 8762, pp. 45-57.
  https://hal.archives-ouvertes.fr/hal-00984421
• 32R. Chadha, U. Mathur, S. Schwoon.
  Computing Information Flow Using Symbolic Model-Checking, in: 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), New Delhi, India, December 2014, pp. 505-516. [ DOI : 10.4230/LIPIcs.FSTTCS.2014.505 ]
  https://hal.archives-ouvertes.fr/hal-01110118
• 33T. Chatain, S. Haar, L. Jezequel, L. Paulevé, S. Schwoon.
  Characterization of Reachable Attractors Using Petri Net Unfoldings, in: CMSB 2014, Manchester, United Kingdom, P. Mendes, J. Dada, K. Smallbone (editors), LNCS/LNBI, Springer Berlin Heidelberg, November 2014, in press.
  https://hal.archives-ouvertes.fr/hal-01060450
• 34A. Cyriac, P. Gastin, K. Narayan Kumar.
  Verifying Communicating Multi-pushdown Systems, in: 12th International Symposium on Automated Technology for Verification and Analysis (ATVA'14), Sydney, Australia, Springer, 2014, vol. LNCS 8837, pp. 1-17.
  https://hal.archives-ouvertes.fr/hal-00943690
• 35V. Germanos, S. Haar, V. Khomenko, S. Schwoon.
  Diagnosability under Weak Fairness, in: 14th International Conference on Application of Concurrency to System Design (ACSD'14), Tunis, Tunisia, IEEE Computer Society Press, 2014.
  https://hal.archives-ouvertes.fr/hal-01091162
• 36S. Haddad, R. Hennicker, M. H. Møller.
  Specification of Asynchronous Component Systems with Modal I/O-Petri Nets, in: 8th Symposium on Trustworthy Global Computing (TGC'13), Buenos Aires, Argentina, Revised Selected Papers of the 8th Symposium on Trustworthy Global Computing (TGC'13), Springer, 2014, vol. LNCS 8358, pp. 219-234.
  https://hal.archives-ouvertes.fr/hal-01091099
• 37S. Haddad, B. Monmege.
  Reachability in MDPs: Refining Convergence of Value Iteration, in: 8th Workshop on Reachability Problems in Computational Models (RP'14), Oxford, United Kingdom, Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), Springer, 2014, vol. LNCS 8762, pp. 125-137.
  https://hal.archives-ouvertes.fr/hal-01091122
• 38F. Kordon, F. Hulin-Hubard.
  BenchKit, a Tool for Massive Concurrent Benchmarking, in: 14th International Conference on Application of Concurrency to System Design (ACSD'14), Tunis, Tunisia, IEEE Computer Society Press, 2014.
  https://hal.archives-ouvertes.fr/hal-01091157
• 39H. Ponce De León, S. Haar, D. Longuet.
  Distributed Testing of Concurrent Systems: Vector Clocks to the Rescue, in: Theoretical Aspects of Computing, Bucharest, Romania, September 2014. [ DOI : 10.1007/978-3-319-10882-7_22 ]
  https://hal.inria.fr/hal-00996002
• 40H. Ponce De León, A. Mokhov.
  Building Bridges Between Sets of Partial Orders, in: International Conference on Language and Automata Theory and Applications, Nice, France, March 2015.
  https://hal.inria.fr/hal-01060449

Other Publications

• 41L. Brandan-Briones, A. Madalinski, H. Ponce De León.
  Parallel Diagnosability Analysis with LTL-X Model Checking based on Petri Net Unfoldings, September 2014, Workshop on Principles of Diagnosis.
  https://hal.inria.fr/hal-00915478
• 42H. Ponce De León, S. Schwoon, K. Athanasiou.
  TOURS (Testing On Reactive Unfolded Systems), November 2014, tool.
  https://hal.inria.fr/hal-01097360

References in notes

• 43W. Kuich, H. Vogler, M. Droste (editors)
  Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, Springer, 2009.
• 44S. Abbes, A. Benveniste, S. Haar.
  A Petri net model for distributed estimation, in: Proc. MTNS 2004, Sixteenth International Symposium on Mathematical Theory of Networks and Systems, Louvain (Belgium), ISBN 90-5682-517-8, 2004.
• 45S. Akshay, N. Bertrand, S. Haddad, L. Helouet.
  The steady-state control problem for Markov decision processes, in: Qest 2013, Buenos Aires, Argentina, K. R. Joshi, M. Siegle, M. Stoelinga, P. R. D'Argenio (editors), Springer, September 2013, vol. 8054, pp. 290-304.
  https://hal.inria.fr/hal-00879355
• 46R. Alur, K. Etessami, M. Yannakakis.
  Realizability and Verification of MSC Graphs, in: Theor. Comput. Sci., 2005, vol. 331, n^o 1, pp. 97–114.
• 47P. Baldan, Th. Chatain, S. Haar, B. König.
  Unfolding-based Diagnosis of Systems with an Evolving Topology, in: Information and Computation, October 2010, vol. 208, n^o 10, pp. 1169-1192.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHK-icomp10.pdf
• 48P. Baldan, A. Corradini, B. König, S. Schwoon.
  McMillan's complete prefix for contextual nets, in: Transactions on Petri Nets and Other Models of Concurrency, November 2008, vol. 1, pp. 199–220, Volume 5100 of Lecture Notes in Computer Science.
• 49P. Baldan, S. Haar, B. Koenig.
  Distributed Unfolding of Petri Nets, in: Proc.FOSSACS 2006, LNCS, Springer, 2006, vol. 3921, pp. 126-141, Extended version: Technical Report CS-2006-1. Department of Computer Science, University Ca' Foscari of Venice.
• 50F. Baskett, K. M. Chandy, R. R. Muntz, F. G. Palacios.
  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, in: J. ACM, April 1975, vol. 22, pp. 248–260.
  http://doi.acm.org/10.1145/321879.321887
• 51A. Benveniste, É. Fabre, S. Haar.
  Markov Nets: Probabilistic Models for distributed and concurrent Systems, in: IEEE Transactions on Automatic Control, 2003, vol. 48 (11), pp. 1936-1950, Extended version: IRISA Research Report 1538.
• 52P. Bhateja, P. Gastin, M. Mukund, K. Narayan Kumar.
  Local testing of message sequence charts is difficult, in: Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT'07), Budapest, Hungary, E. Csuhaj-Varjú, Z. Ésik (editors), Lecture Notes in Computer Science, Springer, August 2007, vol. 4639, pp. 76-87. [ DOI : 10.1007/978-3-540-74240-1_8 ]
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGMN-fct07.pdf
• 53G. V. Bochmann, S. Haar, C. Jard, G.-V. Jourdan.
  Testing Systems Specified as Partial Order Input/Output Automata, in: Proc. TESTCOM/Fates 08, 20th IFIP International Conference on Testing of Communicating Systems and 8th International Workshop on Formal Approaches to Testing of Software, LNCS, Springer, 2008, vol. 5047, pp. 169-183.
• 54B. Bollig, P. Gastin.
  Weighted versus Probabilistic Logics, in: Proceedings of the 13th International Conference on Developments in Language Theory (DLT'09), Stuttgart, Germany, V. Diekert, D. Nowotka (editors), Lecture Notes in Computer Science, Springer, June-July 2009, vol. 5583, pp. 18-38. [ DOI : 10.1007/978-3-642-02737-6_2 ]
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BG-dlt09.pdf
• 55A. Bouillard, S. Haar, S. Rosario.
  Critical paths in the Partial Order Unfolding of a Stochastic Petri Net, in: Proceedings of the 7th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'09), Budapest, Hungary, J. Ouaknine, F. Vaandrager (editors), Lecture Notes in Computer Science, Springer, September 2009, vol. 5813, pp. 43-57. [ DOI : 10.1007/978-3-642-04368-0_6 ]
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-formats09.pdf
• 56P. Bouyer, S. Haddad, P.-A. Reynier.
  Timed Unfoldings for Networks of Timed Automata, in: Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), Beijing, ROC, S. Graf, W. Zhang (editors), Lecture Notes in Computer Science, Springer, October 2006, vol. 4218, pp. 292-306.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-atva06.pdf
• 57Th. Chatain, P. Gastin, N. Sznajder.
  Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems, in: Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09), Špindlerův Mlýn, Czech Republic, M. Nielsen, A. Kučera, P. Bro Miltersen, C. Palamidessi, P. Tůma, F. Valencia (editors), Lecture Notes in Computer Science, Springer, January 2009, vol. 5404, pp. 141-152. [ DOI : 10.1007/978-3-540-95891-8_16 ]
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CGS-sofsem09.pdf
• 58G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad.
  Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications, in: IEEE Transactions on Computers, November 1993, vol. 42, n^o 11, pp. 1343-1360.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CDFH-toc93.ps
• 59A. Church.
  Logic, arithmetics, and automata, in: Proc. of Int. Congr. of Mathematicians, 1962, pp. 23–35.
• 60R. Debouk, D. Teneketzis.
  Coordinated decentralized protocols for failure diagnosis of discrete-event systems, in: Journal of Discrete Event Dynamical Systems: Theory and Application, 2000, vol. 10, pp. 33–86.
• 61D. El Hog-Benzina, S. Haddad, R. Hennicker.
  Process Refinement and Asynchronous Composition with Modalities, in: Proceedings of the 2nd International Workshop on Abstractions for Petri Nets and Other Models of Concurrency (APNOC'10), Braga, Portugal, N. Sidorova, A. Serebrenik (editors), June 2010.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/EHH-apnoc10.pdf
• 62J. Esparza, K. Heljanko.
  Unfoldings - A Partial-Order Approach to Model Checking, EATCS Monographs in Theoretical Computer Science, Springer, 2008.
• 63É. Fabre, A. Benveniste, C. Jard, S. Haar.
  Diagnosis of Asynchronous Discrete Event Systems, a Net Unfolding Approach, in: IEEE Trans. Aut. Control, 2003, vol. 48 (5), pp. 714-727.
• 64É. Fabre, A. Benveniste, C. Jard, S. Haar.
  Distributed monitoring of concurrent and asynchronous systems, in: Discrete Event Dynamic Systems: theory and application, 2005, vol. 15 (1), pp. 33-84, Preliminary version: Proc. CONCUR 2003, LNCS 2761, pp.1–28, Springer.
• 65B. Finkbeiner, S. Schewe.
  Uniform distributed synthesis, in: Proc. of the 20th IEEE Annual Symposium on Logic in Computer Science (LICS'05), IEEE Computer Society Press, 2005, pp. 321–330.
• 66P. Gastin, B. Lerman, M. Zeitoun.
  Distributed games with causal memory are decidable for series-parallel systems, in: Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'04), Chennai, India, K. Lodaya, M. Mahajan (editors), Lecture Notes in Computer Science, Springer, December 2004, vol. 3328, pp. 275-286.
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GLZ-fsttcs04.pdf
• 67P. Gastin, N. Sznajder, M. Zeitoun.
  Distributed synthesis for well-connected architectures, in: Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), Kolkata, India, N. Garg, S. Arun-Kumar (editors), Lecture Notes in Computer Science, Springer, December 2006, vol. 4337, pp. 321-332. [ DOI : 10.1007/11944836_30 ]
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GSZ-fsttcs2006.pdf
• 68S. Haar, A. Benveniste, É. Fabre, C. Jard.
  Partial Order Diagnosability Of Discrete Event Systems Using Petri Net Unfoldings, in: 42nd IEEE Conference on Decision and Control (CDC), 2003.
• 69S. Haar.
  Probabilistic Cluster Unfoldings, in: Fundamenta Informaticae, 2003, vol. 53 (3-4), pp. 281-314.
• 70S. Haar, C. Jard, G.-V. Jourdan.
  Testing Input/Output Partial Order Automata, in: Proc. TESTCOM/FATES, LNCS, Springer, 2007, vol. 4581, pp. 171-185, LNCS 4581.
• 71S. Haar, C. Rodríguez, S. Schwoon.
  Reveal Your Faults: It's Only Fair!, in: Proceedings of the 13th International Conference on Application of Concurrency to System Design (ACSD'13), Barcelona, Spain, M. Pietkiewicz-Koutny, M. T. Lazarescu (editors), IEEE Computer Society Press, July 2013, pp. 120-129. [ DOI : 10.1109/ACSD.2013.15 ]
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HRS-acsd13.pdf
• 72O. Kupferman, M. Y. Vardi.
  Synthesizing Distributed Systems, in: Proc. of the 16th IEEE Annual Symposium on Logic in Computer Science (LICS'01), IEEE Computer Society Press, 2001.
• 73S. Lafortune, Y. Wang, T.-S. Yoo.
  Diagnostic Decentralisé Des Systèmes A Evénements Discrets, in: Journal Europeen des Systèmes Automatisés (RS-JESA), August 2005, vol. 99, n^o 99, pp. 95–110.
• 74K. G. Larsen, P. Pettersson, W. Yi.
  Compositional and symbolic model-checking of real-time systems, in: Proc. of RTSS 1995, IEEE Computer Society, 1995, pp. 76-89.
• 75S. Mohalik, I. Walukiewicz.
  Distributed Games, in: Proc. of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'03), LNCS, Springer, 2003, vol. 2914, pp. 338–351.
• 76M. Noual, D. Regnault, S. Sené.
  About non-monotony in Boolean automata networks, in: Theoretical Computer Science, 2012, vol. 504, pp. 12-25.
• 77A. Pnueli, R. Rosner.
  Distributed reactive systems are hard to synthesize, in: Proc. of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS'90), IEEE Computer Society Press, 1990, vol. II, pp. 746–757.
• 78L. Ricker, K. Rudie.
  Know Means No: Incorporating Knowledge into Discrete-Event Control Systems, in: IEEE Transactions on Automatic Control, September 2000, vol. 45, n^o 9, pp. 1656–1668.
• 79L. Ricker, K. Rudie.
  Knowledge Is a Terrible Thing to Waste: Using Inference in Discrete-Event Control Problems, in: IEEE Transactions on Automatic Control, MarchSeptember 2007, vol. 52, n^o 3, pp. 428–441.
• 80C. Rodríguez, S. Schwoon, P. Baldan.
  Efficient contextual unfolding, in: Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), Aachen, Germany, J.-P. Katoen, B. König (editors), Lecture Notes in Computer Science, Springer, September 2011, vol. 6901, pp. 342-357. [ DOI : 10.1007/978-3-642-23217-6_23 ]
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/RSB-concur11.pdf
• 81C. Rodríguez, S. Schwoon, V. Khomenko.
  Contextual Merged Processes, in: 34th International Conference on Applications and Theory of Petri Nets (ICATPN'13), Italy, Lecture Notes in Computer Science, Springer, 2013, vol. 7927, pp. 29-48. [ DOI : 10.1007/978-3-642-38697-8_3 ]
  https://hal.archives-ouvertes.fr/hal-00926202
• 82C. Rodríguez, S. Schwoon.
  Cunf, January 2011, n^o N/A.
  https://hal.inria.fr/hal-00779948
• 83H. L. S. Younes, R. G. Simmons.
  Statistical probabilistic model checking with a focus on time-bounded properties, in: Inf. Comput., September 2006, vol. 204, pp. 1368–1409. [ DOI : 10.1016/j.ic.2006.05.002 ]
  http://dl.acm.org/citation.cfm?id=1182767.1182770