EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1P. Gastin, F. Laroussinie (editors)

    Proceedings of the 21st International Conference on Concurrency Theory (CONCUR'10), Lecture Notes in Computer Science, Springer, August-September 2010, vol. 6269.

    http://www.springerlink.com/content/978-3-642-15374-7
  • 2S. Akshay.

    Spécification et vérification pour des systèmes distribués et temporisés, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2010.
  • 3S. 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, p. 82-97. [ DOI : 10.1007/978-3-540-85361-9_10 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABGMN-concur08.pdf
  • 4S. Akshay, P. Gastin, M. Mukund, K. Narayan Kumar.

    Model checking time-constrained scenario-based specifications, in: Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10), Chennai, India, K. Lodaya, M. Mahajan (editors), Leibniz International Proceedings in Informatics, Leibniz-Zentrum für Informatik, December 2010, To appear.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/AGMN-fsttcs10.pdf
  • 5S. Balaguer, Th. Chatain, S. Haar.

    A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata, in: Proceedings of the 17th International Symposium on Temporal Representation and Reasoning (TIME'10), Paris, France, N. Markey, J. Wijsen (editors), IEEE Computer Society Press, September 2010, p. 77-84.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCH-time10.pdf
  • 6P. Baldan, A. Bruni, A. Corradini, B. König, S. Schwoon.

    On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars, in: Proceedings of the 5th International Conference on Graph Transformations (ICGT'10), Enschede, The Netherlands, H. Ehrig, A. Rensink, G. Rozenberg, A. Schürr (editors), Lecture Notes in Computer Science, Springer, September-October 2010, vol. 6372, p. 91-106. [ DOI : 10.1007/978-3-642-15928-2_7 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/bbcks-icgt10.pdf
  • 7P. Baldan, A. Bruni, A. Corradini, B. König, S. Schwoon.

    On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars, in: Proceedings of the 5th International Conference on Graph Transformation (ICGT'10), Enschede, The Netherlands, H. Ehrig, A. Rensink, G. Rozenberg, A. Schürr (editors), Lecture Notes in Computer Science, Springer, 2010, vol. 6372, p. 91–106.
  • 8P. 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, p. 1169-1192.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHK-icomp10.pdf
  • 9P. 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, p. 199–220, Volume 5100 of Lecture Notes in Computer Science.
  • 10M. Ben Hmida, S. Haddad.

    Client Synthesis for Aspect Oriented Web Services, in: Revised Selected Papers of the 15th Monterey Workshop on Foundations of Computer Software (MONTEREY'08), Budapest, Hungary, Ch. Choppy, O. Sokolsky (editors), Lecture Notes in Computer Science, Springer, April 2010, vol. 6028, p. 24-42.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BH-monterey08.pdf
  • 11P. 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, p. 76-87. [ DOI : 10.1007/978-3-540-74240-1_8 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGMN-fct07.pdf
  • 12B. 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, p. 18-38. [ DOI : 10.1007/978-3-642-02737-6_2 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BG-dlt09.pdf
  • 13B. 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, p. 587-598.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGMZ-icalp10.pdf
  • 14B. Bollig, L. Hélouët.

    Realizability of Dynamic MSC Languages, in: Proceedings of the 5th International Computer Science Symposium in Russia (CSR'10), Kazan, Russia, E. W. Mayr (editor), Lecture Notes in Computer Science, Springer, June 2010, vol. 6072, p. 48-59.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BH-csr10.pdf
  • 15B. Bollig, J.-P. Katoen, C. Kern, M. Leucker.

    Learning Communicating Automata from MSCs, in: IEEE Transactions on Software Engineering, May/June 2010, vol. 36, no 3, p. 390-408.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-tse09.pdf
  • 16B. Bollig, J.-P. Katoen, C. Kern, M. Leucker.

    SMA—The Smyle Modeling Approach, in: Computing and Informatics, 2010, vol. 29, no 1, p. 45-72.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKL-cai09.pdf
  • 17B. Bollig, J.-P. Katoen, C. Kern, M. Leucker, D. Neider, D. R. Piegdon.

    libalf: the Automata Learning Framework, in: Proceedings of the 22nd International Conference on Computer Aided Verification (CAV'10), Edinburgh, Scotland, UK, B. Cook, P. Jackson, T. Touili (editors), Lecture Notes in Computer Science, Springer, July 2010, vol. 6174, p. 360-364.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BKKLNP-cav10.pdf
  • 18B. 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
  • 19P. 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, p. 73-107. [ DOI : 10.1016/j.ic.2007.10.004 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-ic07.pdf
  • 20A. Bušić, H. Djafri, J.-M. Fourneau.

    Stochastic Bounds for Censored Markov Chains, in: Proceedings of the 6th International Meeting on the Numerical Solution of Markov Chains (NSMC'10), Williamsburg, Virginia, USA, M. Benzi, T. Dayar (editors), sep 2010.
  • 21B. 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, p. 202-220. [ DOI : 10.1016/j.tcs.2008.03.030 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHLR-tcs08.pdf
  • 22B. Bérard, S. Haddad, M. Sassolas.

    Real Time Properties for Interrupt Timed Automata, in: Proceedings of the 17th International Symposium on Temporal Representation and Reasoning (TIME'10), Paris, France, N. Markey, J. Wijsen (editors), IEEE Computer Society Press, September 2010, p. 69-76.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHS-time10.pdf
  • 23B. Bérard, S. Haddad, M. Sassolas, M. Zeitoun.

    Distributed Synthesis with Incomparable Information, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2010, no LSV-10-17, 20 pages.

    http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-17.pdf
  • 24T. Chatain, É. Fabre.

    Factorization Properties of Symbolic Unfoldings of Colored Petri Nets, in: Proceedings of the 31st International Conference on Applications and Theory of Petri Nets (ICATPN'10), Braga, Portugal, J. Lilius, W. Penczek (editors), Lecture Notes in Computer Science, Springer, June 2010, vol. 6128, p. 165-184.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CF-pn10.pdf
  • 25Th. 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, p. 141-152. [ DOI : 10.1007/978-3-540-95891-8_16 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CGS-sofsem09.pdf
  • 26Th. Chatain, C. Jard.

    Sémantique concurrente symbolique des réseaux de Petri saufs et dépliages finis des réseaux temporels, in: Actes de la 10ème Conférence Internationale sur les NOuvelles TEchnologies de la RÉpartition (NOTERE'10), Tozeur, Tunisia, IEEE Computer Society Press, May-June 2010.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CJ-notere10.pdf
  • 27S. Demri, P. Gastin.

    Specification and Verification using Temporal Logics, in: Modern applications of automata theory, D. D'Souza, P. Shankar (editors), IISc Research Monographs, World Scientific, 2010, vol. 2, To appear.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DG-iis09.pdf
  • 28M. Droste, P. Gastin.

    Weighted automata and weighted logics, in: Theoretical Computer Science, June 2007, vol. 380, no 1-2, p. 69-86. [ DOI : 10.1016/j.tcs.2007.02.055 ]

    http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2005-13.pdf
  • 29D. 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
  • 30É. 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), p. 33-84, Preliminary version: Proc. CONCUR 2003, LNCS 2761, pp.1–28, Springer..
  • 31P. Gastin, D. Kuske.

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

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GK-icomp10.pdf
  • 32P. Gastin, N. Sznajder.

    Decidability of well-connectedness for distributed synthesis, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2010, no LSV-10-02, 15 pages.

    http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2010-02.pdf
  • 33P. 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, p. 321-332. [ DOI : 10.1007/11944836_30 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GSZ-fsttcs2006.pdf
  • 34S. Haar.

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

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/haar-tac10.pdf
  • 35S. Haar.

    What Topology Tells us about Diagnosability in Partial Order Semantics, in: Proceedings of the 10th Workshop on Discrete Event Systems (WODES'10), Berlin, Germany, August-September 2010, p. 221-226.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/SH-wodes10.pdf
  • 36S. Haddad, L. Mokdad, S. Youcef.

    Response time of BPEL4WS constructors, in: Proceedings of the 15th IEEE Symposium on Computers and Communications (ISCC'10), Riccione, Italy, IEEE Computer Society Press, June 2010, p. 695-700.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HMY-iscc10.pdf
  • 37S. Haddad, L. Mokdad, S. Youcef.

    Selection of the Best composite Web Service Based on Quality of Service, in: Proceedings of the 2nd International Symposium on Services Science and 3rd International Conference on Business Process and Services Computing (ISSS/BPSC'10), Leipzig, Germany, W. Abramowicz, R. Alt, K.-P. Fähnrich, B. Franczyk, L. A. Maciaszek (editors), Lecture Notes in Informatics, Gesellschaft für Informatik, September-October 2010, vol. 177, p. 255-266.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/hmy-bpsc10.pdf
  • 38S. Li, S. Balaguer, A. David, K. Larsen, B. Nielsen, S. Pusinskas.

    Scenario-based verification of real-time systems using Uppaal, in: Formal Methods in System Design, 2010, p. 1-65, 10.1007/s10703-010-0103-z.

    http://dx.doi.org/10.1007/s10703-010-0103-z
  • 39B. Monmege.

    Propriétés quantitatives des mots et des arbres – Applications aux langages XML, Master Parisien de Recherche en Informatique, Paris, France, September 2010.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/monmege-m2.pdf
  • 40L. 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, p. 235-256.
  • 41C. Rodríguez.

    Implementation of a complete prefix unfolder for contextual nets, Master Parisien de Recherche en Informatique, Paris, France, September 2010.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/cr-m2.pdf
  • 42C. 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, p. 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

  • 43S. Balaguer.

    Concurrency in Real-Time Distributed Systems, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012.
  • 44H. Djafri.

    Approches numériques et statistiques pour le model checking des processus stochastiques, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2012.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/djafri-these11.pdf

Articles in International Peer-Reviewed Journals

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

    Event-clock Message Passing Automata: A logical characterization and an emptiness checking algorithm, in: Formal Methods in System Design, 2012, To appear.
  • 46S. 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, p. 330-355. [ DOI : 10.1007/s10703-012-0146-4 ]
  • 47S. Balaguer, Th. Chatain, S. Haar.

    Building Occurrence Nets from Reveals Relations, in: Fundamenta Informaticae, 2012, To appear.
  • 48P. 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, no 1, p. 2-22. [ DOI : 10.1016/j.tcs.2012.04.046 ]
  • 49B. Bollig, D. Kuske.

    An optimal construction of Hanf sentences, in: Journal of Applied Logic, June 2012, vol. 10, no 2, p. 179-186. [ DOI : 10.1016/j.jal.2012.01.002 ]
  • 50R. Bonnet, A. Finkel, S. Haddad, F. Rosa-Velardo.

    Ordinal Theory for Expressiveness of Well-Structured Transition Systems, in: Information and Computation, 2013, To Appear.
  • 51B. Bérard, F. Cassez, S. Haddad, D. Lime, O. H. Roux.

    The Expressive Power of Time Petri Nets, in: Theoretical Computer Science, 2013, To appear.
  • 52B. Bérard, S. Haddad, M. Sassolas.

    Interrupt Timed Automata: verification and expressiveness, in: Formal Methods in System Design, February 2012, vol. 40, no 1, p. 41-87. [ DOI : 10.1007/s10703-011-0140-2 ]
  • 53P. Ganty, R. Majumdar, B. Monmege.

    Bounded underapproximations, in: Formal Methods in System Design, April 2012, vol. 40, no 2, p. 206-231. [ DOI : 10.1007/s10703-011-0136-y ]
  • 54P. Gastin, N. Sznajder.

    Decidability of well-connectedness for distributed synthesis, in: Information Processing Letters, 2012, To appear. [ DOI : 10.1016/j.ipl.2012.08.018 ]
  • 55P. Gastin, N. Sznajder.

    Fair Synthesis for Asynchronous Distributed Systems, in: ACM Transactions on Computational Logic, 2012, To appear.
  • 56S. Haar.

    What topology tells us about diagnosability in partial order semantics, in: Discrete Event Dynamic Systems: Theory and Applications, December 2012, vol. 22, no 4, p. 383-402. [ DOI : 10.1007/s10626-011-0121-z ]

International Conferences with Proceedings

  • 57A. Agarwal, A. Madalinski, S. Haar.

    Effective Verification of Weak Diagnosability, in: Proceedings of the 8th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes (SAFEPROCESS'12), Mexico City, Mexico, IFAC, August 2012. [ DOI : 10.3182/20120829-3-MX-2028.00083 ]
  • 58S. Balaguer, Th. Chatain.

    Avoiding Shared Clocks in Networks of Timed Automata, 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, p. 100-114. [ DOI : 10.1007/978-3-642-32940-1_9 ]
  • 59B. 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, p. 331-346. [ DOI : 10.1007/978-3-642-28756-5_23 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHP-tacas12.pdf
  • 60B. Barbot, S. Haddad, C. Picaronny.

    Importance Sampling for Model Checking of Continuous Time Markov Chains, in: Proceedings of the 4th International Conference on Advances in System Simulation (SIMUL'12), Lisbon, Portugal, XPS, November 2012, To appear.
  • 61B. Bollig, A. Cyriac, P. Gastin, K. Narayan Kumar.

    Model Checking Languages of Data Words, in: Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'12), Tallinn, Estonia, L. Birkedal (editor), Lecture Notes in Computer Science, Springer, March 2012, vol. 7213, p. 391-405. [ DOI : 10.1007/978-3-642-28729-9_26 ]
  • 62B. Bollig, N. Decker, M. Leucker.

    Frequency Linear-time Temporal Logic, in: Proceedings of the 6th International Symposium on Theoretical Aspects of Software Engineering (TASE'12), Beijing, China, IEEE Computer Society Press, July 2012, p. 85-92. [ DOI : 10.1109/TASE.2012.43 ]
  • 63B. Bollig, P. Gastin, B. Monmege, M. Zeitoun.

    A Probabilistic Kleene Theorem, in: Proceedings of the 10th International Symposium on Automated Technology for Verification and Analysis (ATVA'12), Thiruvananthapuram, India, M. Mukund, S. Chakraborty (editors), Lecture Notes in Computer Science, Springer, October 2012, p. 400-415. [ DOI : 10.1007/978-3-642-33386-6_31 ]
  • 64A. Bušić, H. Djafri, J.-M. Fourneau.

    Bounded state space truncation and censored Markov chains, in: Proceedings of the 51st IEEE Conference on Decision and Control (CDC'12), Maui, Hawaii, USA, IEEE Control System Society, December 2012, To appear.
  • 65B. Bérard, S. Haddad, M. Sassolas, N. Sznajder.

    Concurrent Games on VASS with Inhibition, 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, p. 39-52. [ DOI : 10.1007/978-3-642-32940-1_5 ]
  • 66A. 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, p. 547-561. [ DOI : 10.1007/978-3-642-32940-1_38 ]
  • 67P. Gastin, B. Monmege.

    Adding Pebbles to Weighted Automata, in: Proceedings of the 17th International Conference on Implementation and Application of Automata (CIAA'12), Porto, Portugal, N. Moreira, R. Reis (editors), Lecture Notes in Computer Science, Springer-Verlag, July 2012, vol. 7381, p. 28-51. [ DOI : 10.1007/978-3-642-31606-7_4 ]
  • 68S. Haddad, S. Schmitz, Ph. Schnoebelen.

    The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets, in: Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS'12), Dubrovnik, Croatia, IEEE Computer Society Press, June 2012, p. 355-364. [ DOI : 10.1109/LICS.2012.46 ]
  • 69H. Ponce de León, S. Haar, D. Longuet.

    Conformance Relations for Labeled Event Structures, in: Proceedings of the 6th International Conference on Tests and Proofs (TAP'12), Prague, Czech Republic, A. D. Brucker, J. Julliand (editors), Lecture Notes in Computer Science, Springer, May-June 2012, vol. 7305, p. 83-98. [ DOI : 10.1007/978-3-642-30473-6_8 ]
  • 70C. Rodríguez, S. Schwoon.

    Verification of Petri Nets with Read Arcs, 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, p. 471-485. [ DOI : 10.1007/978-3-642-32940-1_33 ]

Scientific Books (or Scientific Book chapters)

  • 71S. Demri, P. Gastin.

    Specification and Verification using Temporal Logics, in: Modern applications of automata theory, D. D'Souza, P. Shankar (editors), IISc Research Monographs, World Scientific, July 2012, vol. 2, chap. 15, p. 457-494.
  • 72D. El Hog-Benzina, S. Haddad, R. Hennicker.

    Refinement and Asynchronous Composition of Modal Petri Nets, in: Transactions on Petri Nets and Other Models of Concurrency V, Lecture Notes in Computer Science, Springer, 2012, vol. 6900, p. 96-120. [ DOI : 10.1007/978-3-642-29072-5_4 ]
  • 73S. Haar, É. Fabre.

    Diagnosis with Petri Net Unfoldings, in: Control of Discrete-Event Systems, C. Seatzu, M. Silva, J. H. van Schuppen (editors), Lecture Notes in Control and Information Sciences, Springer, 2013, vol. 433, p. 301-318, To appear.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HS-lncis433.pdf
  • 74S. Haar, T. Masopust.

    Languages, Decidability, and Complexity, in: Control of Discrete-Event Systems, C. Seatzu, M. Silva, J. H. van Schuppen (editors), Lecture Notes in Control and Information Sciences, Springer, 2013, vol. 433, p. 23-43, To appear.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HM-lncis433.pdf

Books or Proceedings Editing

  • 75S. Haddad, L. Pomello (editors)

    Proceedings of the 33rd International Conference on Applications and Theory of Petri Nets (ICATPN'12), Lecture Notes in Computer Science, Springer, Hamburg, Germany, June 2012, vol. 7347. [ DOI : 10.1007/978-3-642-31131-4 ]

Internal Reports

  • 76B. Bollig, A. Cyriac, L. Hélouët, A. Kara, T. Schwentick.

    Dynamic Communicating Automata and Branching High-Level MSCs, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2012, no LSV-12-20, 35 pages.
  • 77B. Bollig, P. Habermehl, M. Leucker, B. Monmege.

    A Fresh Approach to Learning Register Automata, HAL, October 2012, no hal-00743240, 18 pages.

    http://hal.archives-ouvertes.fr/hal-00743240
References in notes
  • 78W. Kuich, H. Vogler, M. Droste (editors)

    Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, Springer, 2009.
  • 79S. 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.
  • 80S. 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, p. 82-97.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ABGMN-concur08.pdf
  • 81R. Alur, D. Dill.

    A Theory of Timed Automata, in: Theoretical Computer Science, 1994, vol. 126, no 2, p. 183–235.
  • 82R. Alur, K. Etessami, M. Yannakakis.

    Realizability and Verification of MSC Graphs, in: Theor. Comput. Sci., 2005, vol. 331, no 1, p. 97–114.
  • 83P. Baldan, T. Chatain, S. Haar, B. Koenig.

    Unfolding-based Diagnosis of Systems with an Evolving Topology, 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, p. 203-217, Extended version accepted for publication in: Information and Computation.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHK-concur08.pdf
  • 84P. Baldan, S. Haar, B. Koenig.

    Distributed Unfolding of Petri Nets, in: Proc.FOSSACS 2006, LNCS, Springer, 2006, vol. 3921, p. 126-141, Extended version: Technical Report CS-2006-1. Department of Computer Science, University Ca' Foscari of Venice..
  • 85F. 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, p. 248–260.

    http://doi.acm.org/10.1145/321879.321887
  • 86A. Benveniste, É. Fabre, S. Haar.

    Markov Nets: Probabilistic Models for distributed and concurrent Systems, in: IEEE Transactions on Automatic Control, 2003, vol. 48 (11), p. 1936-1950, Extended version: IRISA Research Report 1538..
  • 87P. 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, p. 76-87.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BGMN-fct07.pdf
  • 88G. 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, p. 169-183.
  • 89P. Bouyer, S. Haddad, P.-A. Reynier.

    Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences, in: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06) — Part II, Venice, Italy, M. Buglesi, B. Preneel, V. Sassone, I. Wegener (editors), Lecture Notes in Computer Science, Springer, July 2006, vol. 4052, p. 420-431.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-icalp06.pdf
  • 90P. 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, p. 292-306.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BHR-atva06.pdf
  • 91M. Boyer, O. H. Roux.

    On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets, in: Fundamenta Informaticae, 2008, vol. 88, no 3, p. 225-249.
  • 92B. Bérard, F. Cassez, S. Haddad, D. Lime, O. H. Roux.

    Comparison of the Expressiveness of Timed Automata and Time Petri Nets, in: Proceedings of the 3rd International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'05), Uppsala, Sweden, P. Pettersson, W. Yi (editors), Lecture Notes in Computer Science, Springer, November 2005, vol. 3829, p. 211-225.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BCHLR-formats2005.pdf
  • 93F. Cassez, O. H. Roux.

    Structural Translation from Time Petri Nets to Timed Automata, in: Journal of Systems and Software, 2006.
  • 94G. 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, p. 1343-1360.

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

    Logic, arithmetics, and automata, in: Proc. of Int. Congr. of Mathematicians, 1962, p. 23–35.
  • 96R. 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, p. 33–86.
  • 97J. Esparza, K. Heljanko.

    Unfoldings - A Partial-Order Approach to Model Checking, EATCS Monographs in Theoretical Computer Science, Springer, 2008.
  • 98É. 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), p. 714-727.
  • 99É. 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), p. 33-84, Preliminary version: Proc. CONCUR 2003, LNCS 2761, pp.1–28, Springer..
  • 100B. 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, p. 321–330.
  • 101P. 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, p. 275-286.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GLZ-fsttcs04.pdf
  • 102P. 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, p. 321-332.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GSZ-fsttcs2006.pdf
  • 103S. 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.
  • 104S. Haar.

    Probabilistic Cluster Unfoldings, in: Fundamenta Informaticae, 2003, vol. 53 (3-4), p. 281-314.
  • 105S. Haar, C. Jard, G.-V. Jourdan.

    Testing Input/Output Partial Order Automata., in: Proc. TESTCOM/FATES, LNCS, SpringerLNCS 4581, pp. 171–185., 2007, vol. 4581, p. 171-185.
  • 106S. Haddad, P. Poizat.

    Transactional Reduction of Component Compositions, in: Proceedings of 27th IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'07), Tallinn, Estonia, J. Derrick, J. Vain (editors), Lecture Notes in Computer Science, Springer, June 2007, vol. 4574, p. 341-357.

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/HP-forte07.pdf
  • 107V. Khomenko, A. Mokhov.

    An Algorithm for Direct Construction of Complete Merged Processes, in: Proceedings of the 32nd International Conference on Applications and Theory of Petri Nets, Newcastle, UK, L. M. Kristensen, L. Petrucci (editors), Lecture Notes in Computer Science, Springer, June 2011, vol. 6709, p. 89-108.
  • 108O. 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.
  • 109D. König, N. Lohmann, S. Moser, C. Stahl, K. Wolf.

    Extending the compatibility notion for abstract WS-BPEL processes, in: WWW, ACM, 2008, p. 785-794.
  • 110S. 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, p. 95–110.
  • 111K. G. Larsen, P. Pettersson, W. Yi.

    Compositional and symbolic model-checking of real-time systems, in: Proc. of RTSS 1995, IEEE Computer Society, 1995, p. 76-89.
  • 112P. M. Merlin, D. J. Farber.

    Recoverability of Communication Protocols – Implications of a Theorical Study, in: IEEE Transactions on Communications, 1976, vol. 24.
  • 113S. 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, p. 338–351.
  • 114A. 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, p. 746–757.
  • 115W. Reisig.

    Towards a Theory of Services, in: UNISCON, Lecture Notes in Business Information Processing, Springer, 2008, vol. 5, p. 271-281.
  • 116L. 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, p. 1656–1668.
  • 117L. 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, p. 428–441.
  • 118J. Srba.

    Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets, in: FORMATS, 2008, p. 15-32.
  • 119S. Staab, W. van der Aalst, V. Benjamins, A. Sheth, J. Miller, C. Bussler, A. Maedche, D. Fensel, D. Gannon.

    Web Services: Been There, Done That?, in: IEEE Intelligent Systems, 2003, vol. 18, p. 72-85.
  • 120H. L. S. Younes, R. G. Simmons.

    Statistical probabilistic model checking with a focus on time-bounded properties, in: Inf. Comput., September 2006, vol. 204, p. 1368–1409. [ DOI : 10.1016/j.ic.2006.05.002 ]

    http://dl.acm.org/citation.cfm?id=1182767.1182770
  • 121M. B. van Riemsdijk, R. Hennicker, M. Wirsing, A. Schroeder.

    Service Specification and Matchmaking Using Description Logic, in: AMAST, Lecture Notes in Computer Science, Springer, 2008, vol. 5140, p. 392-406.


previous Previous | up Home