EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1S. Akshay, B. Bollig, P. Gastin, M. Mukund, K. Narayan Kumar.

    Distributed Timed Automata with Independently Evolving Clocks, in: Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), Toronto, Canada, F. van Breugel, M. Chechik (editors), Lecture Notes in Computer Science, Springer, August 2008, vol. 5201, pp. 82-97. [ DOI : 10.1007/978-3-540-85361-9_10 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABGMN-concur08.pdf
  • 2S. Balaguer, Th. Chatain, S. Haar.

    A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata, in: Formal Methods in System Design, June 2012, vol. 40, no 3, pp. 330-355. [ DOI : 10.1007/s10703-012-0146-4 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCH-fmsd12.pdf
  • 3P. 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, no 10, pp. 1169-1192.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHK-icomp10.pdf
  • 4B. Bollig, P. Gastin, B. Monmege, M. Zeitoun.

    Pebble weighted automata and transitive closure logics, in: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) – Part II, Bordeaux, France, S. Abramsky, F. Meyer auf der Heide, P. Spirakis (editors), Lecture Notes in Computer Science, Springer, July 2010, vol. 6199, pp. 587-598.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGMZ-icalp10.pdf
  • 5B. Bollig, D. Kuske, I. Meinecke.

    Propositional Dynamic Logic for Message-Passing Systems, in: Logical Methods in Computer Science, September 2010, vol. 6, no 3:16.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKM-lmcs10.pdf
  • 6P. Bouyer, S. Haddad, P.-A. Reynier.

    Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences, in: Information and Computation, January 2008, vol. 206, no 1, pp. 73-107. [ DOI : 10.1016/j.ic.2007.10.004 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-ic07.pdf
  • 7B. Bérard, F. Cassez, S. Haddad, D. Lime, O. H. Roux.

    When are Timed Automata Weakly Timed Bisimilar to Time Petri Nets ?, in: Theoretical Computer Science, September 2008, vol. 403, no 2-3, pp. 202-220. [ DOI : 10.1016/j.tcs.2008.03.030 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHLR-tcs08.pdf
  • 8Th. 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
  • 9P. Gastin, D. Kuske.

    Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces, in: Information and Computation, July 2010, vol. 208, no 7, pp. 797-816.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GK-icomp10.pdf
  • 10S. Haar.

    Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets, in: IEEE Transactions on Automatic Control, October 2010, vol. 55, no 10, pp. 2310-2320.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/haar-tac10.pdf
  • 11L. Recalde, S. Haddad, M. Silva.

    Continuous Petri Nets: Expressive Power and Decidability Issues, in: International Journal of Foundations of Computer Science, April 2010, vol. 21, no 2, pp. 235-256.
  • 12C. 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
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 13T. Chatain.

    Concurrency in Real-Time Distributed Systems, from Unfoldings to Implementability, École normale supérieure de Cachan - ENS Cachan, December 2013, Habilitation à Diriger des Recherches.

    http://hal.inria.fr/tel-00926306
  • 14B. Monmege.

    Spécification et vérification de propriétés quantitatives : expressions, logiques et automates, École normale supérieure de Cachan - ENS Cachan, October 2013.

    http://hal.inria.fr/tel-00908990
  • 15C. Rodríguez.

    Verification Based on Unfoldings of Petri Nets with Read Arcs, École normale supérieure de Cachan - ENS Cachan, December 2013.

    http://hal.inria.fr/tel-00927064
  • 16S. Schwoon.

    Efficient verification of sequential and concurrent systems, École normale supérieure de Cachan - ENS Cachan, December 2013, Habilitation à Diriger des Recherches.

    http://hal.inria.fr/tel-00927066

Articles in International Peer-Reviewed Journals

  • 17S. Akshay, B. Bollig, P. Gastin.

    Event-clock Message Passing Automata: A logical characterization and an emptiness checking algorithm, in: Formal Methods in System Design, 2013, vol. 42, no 3, pp. 262-300.

    http://hal.inria.fr/hal-00925745
  • 18S. Balaguer, T. Chatain.

    Avoiding Shared Clocks in Networks of Timed Automata, in: Logical Methods in Computer Science, 2013, vol. 9, no 4:13, pp. 1-26.

    http://hal.inria.fr/hal-00925723
  • 19S. Balaguer, T. Chatain, S. Haar.

    Building Occurrence Nets from Reveals Relations, in: Fundamenta Informaticae, 2013, vol. 123, no 3, pp. 245-272.

    http://hal.inria.fr/hal-00925754
  • 20B. Berard, F. Cassez, S. Haddad, D. Lime, O. H. Roux.

    The Expressive Power of Time Petri Nets, in: Theoretical Computer Science, 2013, vol. 474, pp. 1-20.

    http://hal.inria.fr/hal-00925765
  • 21R. Bonnet, A. Finkel, S. Haddad, F. Rosa-Velardo.

    Ordinal Theory for Expressiveness of Well-Structured Transition Systems, in: Information and Computation, 2013, vol. 224, pp. 1-22.

    http://hal.inria.fr/hal-00925762
  • 22P. Gastin, N. Sznajder.

    Fair Synthesis for Asynchronous Distributed Systems, in: ACM Transactions on Computational Logic, 2013, vol. 14, no 2:9, pp. 1-31.

    http://hal.inria.fr/hal-00925735
  • 23S. Haar, C. Kern, S. Schwoon.

    Computing the Reveals Relation in Occurrence Nets, in: Theoretical Computer Science, 2013, vol. 493, pp. 66-79.

    http://hal.inria.fr/hal-00925742
  • 24S. Haddad, J. Mairesse, H.-T. Nguyen.

    Synthesis and Analysis of Product-form Petri Nets, in: Fundamenta Informaticae, 2013, vol. 122, no 1-2, pp. 147-172.

    http://hal.inria.fr/hal-00925774
  • 25S. Haddad, L. Mokdad, S. Youcef.

    Bounding models families for performance evaluation in composite Web services, in: Journal of Computational Science, March 2013, vol. 4, no 4, pp. 232-241. [ DOI : 10.1016/j.jocs.2011.11.003 ]

    http://hal.inria.fr/hal-00920332

International Conferences with Proceedings

  • 26S. 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), LNCS, Springer, September 2013, vol. 8054, pp. 290-304.

    http://hal.inria.fr/hal-00879355
  • 27E. G. Amparore, B. Barbot, M. Beccuti, S. Donatelli, G. Franceschinis.

    Simulation-based Verification of Hybrid Automata Stochastic Logic Formulas for Stochastic Symmetric Nets, in: 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (PADS'13), Canada, ACM Press, 2013, pp. 253-264. [ DOI : 10.1145/2486092.2486124 ]

    http://hal.inria.fr/hal-00926210
  • 28É. André, B. Barbot, C. Démoulins, L. Messan Hillah, F. Hulin-Hubard, F. Kordon, A. Linard, L. Petrucci.

    A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems, in: 15th International Conference on Formal Engineering Methods (ICFEM'13), New Zealand, Lecture Notes in Computer Science, Springer, 2013, pp. 199-214.

    http://hal.inria.fr/hal-00926126
  • 29É. André, L. Hillah, F. Hulin-Hubard, F. Kordon, Y. Lembachar, A. Linard, L. Petrucci.

    CosyVerif: An Open Source Extensible Verification Environment, in: 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'13), Singapore, IEEE Computer Society Press, 2013, pp. 33-36.

    http://hal.inria.fr/hal-00926165
  • 30N. Bertrand, E. Fabre, S. Haar, S. Haddad, L. Helouet.

    Active diagnosis for probabilistic systems, in: FOSSACS'2014, Grenoble, France, A. Muscholl (editor), Springer, April 2014.

    http://hal.inria.fr/hal-00930919
  • 31B. Bollig, A. Cyriac, L. Helouet, A. Kara, T. Schwentick.

    Dynamic Communicating Automata and Branching High-Level MSCs, in: LATA 2013, bilbao, Spain, A. Horia Dediu, C. Martín-Vide, B. Truthe (editors), LNCS, Springer, April 2013, vol. 7810, pp. 177-189.

    http://hal.inria.fr/hal-00879353
  • 32B. Bollig, P. Gastin, B. Monmege.

    Weighted Specifications over Nested Words, in: Foundations of Software Science and Computation Structures (FoSSaCS'13), Rome, Italy, Lecture Notes in Computer Science, March 2013, vol. 7794, pp. 385-400. [ DOI : 10.1007/978-3-642-37075-5_25 ]

    http://hal.inria.fr/hal-00909035
  • 33B. Bollig, P. Habermehl, M. Leucker, B. Monmege.

    A Fresh Approach to Learning Register Automata, in: Developments in Language Theory, France, Lecture Notes in Computer Science, June 2013, vol. 7907, pp. 118-130. [ DOI : 10.1007/978-3-642-38771-5_12 ]

    http://hal.inria.fr/hal-00908998
  • 34B. Bollig, D. Kuske, R. Mennicke.

    The Complexity of Model Checking Multi-Stack Systems, in: 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), United States, IEEE Computer Society Press, 2013, pp. 163-170. [ DOI : 10.1109/LICS.2013.22 ]

    http://hal.inria.fr/hal-00926182
  • 35B. Bérard, S. Haddad, A. Jovanovic, D. Lime.

    Parametric Interrupt Timed Automata, in: 7th Workshop on Reachability Problems in Computational Models (RP'13), Sweden, 2013, pp. 59-69.

    http://hal.inria.fr/hal-00936961
  • 36T. Chatain, S. Haar.

    A Canonical Contraction for Safe Petri Nets, in: 7th International Workshop on Petri Nets and Software Engineering (PNSE'13), Germany, D. M. ;. H. Rölke (editor), CEUR Workshop Proceedings, 2013, vol. 969, pp. 25-39.

    http://hal.inria.fr/hal-00926190
  • 37T. Chatain, C. Jard.

    Back in Time Petri Nets, in: FORMATS'13, Argentina, Lecture Notes in Computer Science, Springer, 2013, vol. 8053, pp. 91-105.

    http://hal.inria.fr/hal-00925467
  • 38J. Esparza, L. Jezequel, S. Schwoon.

    Computation of summaries using net unfoldings, in: 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), India, Leibniz International Proceedings in Informatics, 2013, vol. 24, pp. 225-236.

    http://hal.inria.fr/hal-00925457
  • 40S. Haar, S. Haddad, T. Melliti, S. Schwoon.

    Optimal Constructions for Active Diagnosis, in: 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), Guwahati, India, Leibniz International Proceedings in Informatics, December 2013, pp. 527-539.

    http://hal.inria.fr/hal-00926098
  • 41S. Haar, C. Rodríguez, S. Schwoon.

    Reveal Your Faults: It's Only Fair!, in: 13th International Conference on Application of Concurrency to System Design (ACSD'13), Spain, IEEE Computer Society Press, 2013, pp. 120-129.

    http://hal.inria.fr/hal-00926171
  • 42S. Haddad, R. Hennicker, M. H. Møller.

    Channel Properties of Asynchronously Composed Petri Nets, in: 34th International Conference on Applications and Theory of Petri Nets (ICATPN'13), Italy, Lecture Notes in Computer Science, Springer, 2013, vol. 7927, pp. 369-388. [ DOI : 10.1007/978-3-642-38697-8_20 ]

    http://hal.inria.fr/hal-00926200
  • 43H. Ponce De León, G. Bonigo, L. Brandán Briones.

    Distributed Analysis of Diagnosability in Concurrent Systems, in: 24th International Workshop on Principles of Diagnosis (DX'13), Israel, 2013, pp. 142-147.

    http://hal.inria.fr/hal-00926145
  • 44H. Ponce De León, S. Haar, D. Longuet.

    Unfolding-based Test Selection for Concurrent Conformance, in: 25th IFIP International Conference on Testing Software and Systems (ICTSS'13), Turkey, Lecture Notes in Computer Science, Springer, 2013, vol. 8254, pp. 98-113.

    http://hal.inria.fr/hal-00926103
  • 45C. 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 ]

    http://hal.inria.fr/hal-00926202
  • 46C. Rodríguez, S. Schwoon.

    An Improved Construction of Petri Net Unfoldings, in: 1st French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13), Singapore, Open Access Series in Informatics, Leibniz-Zentrum für Informatik, 2013, pp. 47-52.

    http://hal.inria.fr/hal-00926177
  • 47C. Rodríguez, S. Schwoon.

    Cunf: A Tool for Unfolding and Verifying Petri Nets with Read arcs, in: 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), Viet Nam, Lecture Notes in Computer Science, Springer, 2013, vol. 8172, pp. 492-495.

    http://hal.inria.fr/hal-00925448

Scientific Books (or Scientific Book chapters)

  • 48S. Haar, E. Fabre.

    Diagnosis with Petri Net Unfoldings, in: Control of Discrete-Event Systems - Automata and Petri Net Perspectives, Lecture Notes in Control and Information Sciences, Springer, 2013, pp. 301-318.

    http://hal.inria.fr/hal-00926087
  • 49S. Haar, T. Masopust.

    Languages, Decidability, and Complexity, in: Control of Discrete-Event Systems - Automata and Petri Net Perspectives, Lecture Notes in Control and Information Sciences, Springer, 2013, pp. 23-43.

    http://hal.inria.fr/hal-00926094

Other Publications

  • 50B. Bollig, P. Habermehl, M. Leucker, B. Monmege.

    A Robust Class of Data Languages and an Application to Learning, 2013.

    http://hal.inria.fr/hal-00920945
  • 51F. Kordon, A. Linard, M. Becutti, D. Buchs, L. Fronc, F. Hulin-Hubard, F. Legond-Aubry, N. Lohmann, A. Marechal, E. Paviot-Adet, F. Pommereau, C. Rodríguez, C. Rohr, Y. Thierry-Mieg, H. Wimmel, C. Wolf.

    Web Report on the Model Checking Contest @ Petri Net 2013, 2013.

    http://mcc.lip6.fr, http://hal.inria.fr/hal-00926989
  • 52H. Ponce De León, S. Haar, D. Longuet.

    Model Based Testing for Concurrent Systems with Labeled Event Structures, March 2013, Submitted to a journal.

    http://hal.inria.fr/hal-00796006
References in notes
  • 53W. Kuich, H. Vogler, M. Droste (editors)

    Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, Springer, 2009.
  • 54S. 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.
  • 55S. Akshay, B. Bollig, P. Gastin, M. Mukund, K. Narayan Kumar.

    Distributed Timed Automata with Independently Evolving Clocks, in: Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), Toronto, Canada, F. van Breugel, M. Chechik (editors), Lecture Notes in Computer Science, Springer, August 2008, vol. 5201, pp. 82-97.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABGMN-concur08.pdf
  • 56R. Alur, K. Etessami, M. Yannakakis.

    Realizability and Verification of MSC Graphs, in: Theor. Comput. Sci., 2005, vol. 331, no 1, pp. 97–114.
  • 57P. 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.
  • 58P. 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.
  • 59F. 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
  • 60A. 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.
  • 61P. 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
  • 62G. 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.
  • 63B. 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
  • 64A. 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
  • 65P. 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
  • 66G. 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, no 11, pp. 1343-1360.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/CDFH-toc93.ps
  • 67A. Church.

    Logic, arithmetics, and automata, in: Proc. of Int. Congr. of Mathematicians, 1962, pp. 23–35.
  • 68R. 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.
  • 69D. 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
  • 70J. Esparza, K. Heljanko.

    Unfoldings - A Partial-Order Approach to Model Checking, EATCS Monographs in Theoretical Computer Science, Springer, 2008.
  • 71É. 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.
  • 72É. 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.
  • 73B. 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.
  • 74P. 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
  • 75P. 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
  • 76S. 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.
  • 77S. Haar.

    Probabilistic Cluster Unfoldings, in: Fundamenta Informaticae, 2003, vol. 53 (3-4), pp. 281-314.
  • 78S. 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.
  • 79O. 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.
  • 80S. 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, no 99, pp. 95–110.
  • 81K. 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.
  • 82S. 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.
  • 83A. 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.
  • 84L. Ricker, K. Rudie.

    Know Means No: Incorporating Knowledge into Discrete-Event Control Systems, in: IEEE Transactions on Automatic Control, September 2000, vol. 45, no 9, pp. 1656–1668.
  • 85L. 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, no 3, pp. 428–441.
  • 86H. 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


previous Previous | up Home