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. Bollig.
  Automata and Logics for Concurrent Systems: Realizability and Verification, ENS Cachan, June 2015, Habilitation à diriger des recherches.
  https://hal.archives-ouvertes.fr/tel-01242861

Articles in International Peer-Reviewed Journals

• 12S. Akshay, P. Gastin, M. Mukund, K. Narayan Kumar.
  Checking conformance for time-constrained scenario-based specifications, in: Journal of Theoretical Computer Science (TCS), 2015, vol. 549, pp. 24-43.
  https://hal.archives-ouvertes.fr/hal-01242876
• 13P. Ballarini, B. Barbot, M. Duflot, S. Haddad, N. Pekergin.
  HASL: A new approach for performance evaluation and model checking from concepts to experimentation, in: Performance Evaluation, August 2015, vol. 90, pp. 53-77. [ DOI : 10.1016/j.peva.2015.04.003 ]
  https://hal.inria.fr/hal-01221815
• 14B. Barbot, S. Haddad, M. Heiner, C. Picaronny.
  Rare Event Handling in Signalling Cascades, in: International Journal On Advances in Systems and Measurements, 2015, vol. 8, n^o 1-2, pp. 69-79.
  https://hal.archives-ouvertes.fr/hal-01242981
• 15E. Fraca, S. Haddad.
  Complexity Analysis of Continuous Petri Nets, in: Fundamenta Informaticae, 2015, vol. 137, n^o 1, pp. 1-28. [ DOI : 10.3233/FI-2015-1168 ]
  https://hal.archives-ouvertes.fr/hal-01241119
• 16V. Germanos, S. Haar, V. Khomenko, S. Schwoon.
  Diagnosability under Weak Fairness, in: ACM Transactions in Embedded Computing Systems, 2015, vol. 14, n^o 4.
  https://hal.archives-ouvertes.fr/hal-01242989
• 17S. Haar.
  Cyclic Ordering through Partial Orders, in: Journal of Multiple-Valued Logic and Soft Computing, 2015, forthcoming.
  https://hal.archives-ouvertes.fr/hal-01242990
• 18H. 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, 2015, forthcoming.
  https://hal.archives-ouvertes.fr/hal-01242994

Invited Conferences

• 19B. Bollig.
  Automata and Logics for Concurrent Systems: Five Models in Five Pages, in: 20th International Conference on Implementation and Application of Automata (CIAA'15), Umeå, Sweden, Springer (editor), 2015, vol. 9223, pp. 3-12. [ DOI : 10.1007/978-3-319-22360-5_1 ]
  https://hal.archives-ouvertes.fr/hal-01241125
• 20B. Bollig.
  Towards Formal Verification of Distributed Algorithms, in: 22nd International Symposium on Temporal Representation and Reasoning, Kassel, Germany, IEEE Computer Society Press, 2015.
  https://hal.archives-ouvertes.fr/hal-01242959

International Conferences with Proceedings

• 21C. Aiswarya, B. Bollig, P. Gastin.
  An Automata-Theoretic Approach to the Verification of Distributed Algorithms, in: 26th International Conference on Concurrency Theory (CONCUR'15), Madrid, Spain, Leibniz-Zentrum für Informatik, 2015, vol. 42, pp. 340-353.
  https://hal.archives-ouvertes.fr/hal-01241122
• 22E. André, T. Chatain, C. Rodriguez.
  Preserving Partial Order Runs in Parametric Time Petri Nets, in: 15th International Conference on Application of Concurrency to System Design (ACSD'15), Brussels, Belgium, IEEE Computer Society Press, 2015.
  https://hal.archives-ouvertes.fr/hal-01242847
• 23K. Athanasiou, H. Ponce De León, S. Schwoon.
  Test Case Generation for Concurrent Systems Using Event Structures, in: 9th International Conference on Tests and Proofs (TAP'15), L'Aquila, Italy, Springer, 2015, vol. 9154.
  https://hal.archives-ouvertes.fr/hal-01242923
• 24N. Bertrand, S. Haddad, E. Lefaucheux.
  Accurate approximate diagnosability of stochastic systems, in: 10th International Conference on Language and Automata Theory and Applications, Prague, Czech Republic, Springer, March 2016.
  https://hal.inria.fr/hal-01220954
• 25T. Brihaye, G. Geeraerts, A. Haddad, E. Lefaucheux, B. Monmege.
  Simple Priced Timed Games Are Not That Simple, in: 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), Banaglore, India, Leibniz-Zentrum für Informatik, 2015.
  https://hal.archives-ouvertes.fr/hal-01242902
• 26B. Bérard, S. Haddad, C. Picaronny, M. Safey El Din, M. Sassolas.
  Polynomial Interrupt Timed Automata, in: The 9th Workshop on Reachability Problems (RP'15), Warsaw, Poland, Lecture Notes in Computer Science, Springer, September 2015, vol. 9328, pp. 20-32. [ DOI : 10.1007/978-3-319-24537-9_3 ]
  https://hal.archives-ouvertes.fr/hal-01222572
• 27S. Böhm, S. Haar, S. Haddad, P. Hofman, S. Schwoon.
  Active Diagnosis with Observable Quiescence, in: 54th IEEE Conference on Decision and Control (CDC'15), Osaka, Japan, IEEE Control System Society, 2015.
  https://hal.archives-ouvertes.fr/hal-01242934
• 28T. Chatain, S. Haar, M. Koutny, S. Schwoon.
  Non-Atomic Transition Firing in Contextual Nets, in: 36th International Conference on Applications and Theory of Petri Nets (ICATPN'15), Brussels, Belgium, Springer (editor), 2015, vol. 9115.
  https://hal.archives-ouvertes.fr/hal-01241129
• 29S. Haar, S. Perchy, C. Rueda, F. Valencia.
  An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic, in: 17th International Conference on Principles and Practice of Declarative Programming (PPDP'15), Siena, Italy, ACM Press, 2015, pp. 161-172.
  https://hal.archives-ouvertes.fr/hal-01242971
• 30S. Haar, S. Theissing.
  A Hybrid-Dynamical Model for Passenger-flow in Transportation Systems, in: 5th IFAC Conference on Analysis and Design of Hybrid Systems (ADHS'15), Atlanta, Georgia, United States, 2015.
  https://hal.archives-ouvertes.fr/hal-01242903
• 31A. Methni, M. Lemerre, B. Ben Hedia, S. Haddad, K. Barkaoui.
  State Space Reduction Strategie for Model Checking Concurrent C Programs, in: 9th Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS'15), Bucharest, Romania, 2015, vol. 1431, pp. 65-76.
  https://hal.archives-ouvertes.fr/hal-01242951
• 32H. Ponce De Leon, 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
• 33H. Ponce de León, C. Rodriguez, J. Carmona, K. Heljanko, S. Haar.
  Unfolding-Based Process Discovery, in: 13th International Symposium on Automated Technology for Verification and Analysis (ATVA'15), Shanghai, China, Springer, 2015, vol. 9364.
  https://hal.archives-ouvertes.fr/hal-01242885

Conferences without Proceedings

• 34S. Haar, S. Perchy, C. Rueda, F. Valencia.
  An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic, in: 17th International Symposium on Principles and Practice of Declarative Programming (PPDP 2015), Siena, Italy, E. Albert, M. Falaschi (editors), ACM SIGPLAN, July 2015, pp. 161-172. [ DOI : 10.1145/2790449.2790520 ]
  https://hal.inria.fr/hal-01256984

Scientific Books (or Scientific Book chapters)

• 35N. Bertrand, S. Haddad.
  Contrôle, probabilités et observation partielle, in: Informatique Mathématique. Une photographie en 2015, CNRS Édition, 2015, pp. 177-227.
  https://hal.archives-ouvertes.fr/hal-01242962
• 36M. Koutny, J. Desel, S. Haddad.
  Transactions on Petri Nets and Other Models of Concurrency X, Springer, 2015, vol. 9410.
  https://hal.archives-ouvertes.fr/hal-01242977
• 37A. Methni, M. Lemerre, B. Ben Hedia, S. Haddad, K. Barkaoui.
  Specifying and Verifying Concurrent C Programs with TLA+, in: Formal Techniques for Safety-Critical Systems, Communications in Computer and Information Science, Springer, 2015, vol. 476, pp. 206-222.
  https://hal.archives-ouvertes.fr/hal-01242954

Books or Proceedings Editing

• 38S. Haar, R. Meyer (editors)
  Proceedings 15th International Conference on Application of Concurrency to System Design (ACSD), 2015 , IEEE, Brussels, Belgium, 2015. [ DOI : 10.1109/ACSD.2015.23 ]
  https://hal.inria.fr/hal-01250369

Internal Reports

• 39M. Blondin, A. Finkel, C. Haase, S. Haddad.
  Approaching the Coverability Problem Continuously, Computing Research Repository, 2015, n^o 1510.05724.
  https://hal.archives-ouvertes.fr/hal-01242916

Other Publications

• 40M. Guzman, S. Haar, S. Perchy, C. Rueda, F. Valencia.
  Space and Extrusion in Epistemic Concurrent Constraint Systems, January 2016, Submitted to the Journal of Logical and Algebraic Methods in Programming.
  https://hal.inria.fr/hal-01257113
• 41S. Haar, S. Theissing.
  Forecasting Passenger Loads in Transportation Networks, January 2016, working paper or preprint.
  https://hal.inria.fr/hal-01259585

References in notes

• 42W. Kuich, H. Vogler, M. Droste (editors)
  Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, Springer, 2009.
• 43S. 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.
• 44S. 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
• 45R. Alur, K. Etessami, M. Yannakakis.
  Realizability and Verification of MSC Graphs, in: Theor. Comput. Sci., 2005, vol. 331, n^o 1, pp. 97–114.
• 46P. 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
• 47P. 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.
• 48P. 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.
• 49F. 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
• 50A. 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.
• 51P. 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
• 52G. 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.
• 53B. 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
• 54A. 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
• 55P. 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
• 56Th. 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
• 57T. 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 International Publishing, November 2014, vol. 8859, 14 p. [ DOI : 10.1007/978-3-319-12982-2_10 ]
  https://hal.archives-ouvertes.fr/hal-01060450
• 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.
• 71O. 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.
• 72S. 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.
• 73K. 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.
• 74S. 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.
• 75M. Noual, D. Regnault, S. Sené.
  About non-monotony in Boolean automata networks, in: Theoretical Computer Science, 2012, vol. 504, pp. 12-25.
• 76A. 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.
• 77L. 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.
• 78L. 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.
• 79C. 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
• 80H. 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