Publications : MEXICO

[BCC21b]: M. Boltenhagen, T. Chatain, and J. Carmona. Optimized SAT encoding of conformance checking artefacts. Computing, 103(1):29--50, 2021.
doi: 10.1007/s00607-020-00831-8.
[ BibTex | DOI | Web page ]
[BCC21a]: M. Boltenhagen, T. Chatain, and J. Carmona. Anti-alignments—Measuring the precision of process models and event logs. Information Systems, 98, 2021. To appear.
doi: https://doi.org/10.1016/j.is.2020.101708.
[ BibTex | DOI | Web page ]
[HHSY20]: S. Haar, S. Haddad, S. Schwoon, and L. Ye. Active Prediction for Discrete Event Systems. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, pages 48:1--48:16, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.48.
[ BibTex | DOI | Web page | PDF ]
[BCH20]: M. Boltenhagen, B. Chetioui, and L. Huber. Cost-Based Classification of Log Traces Using Machine-Learning. In Process Mining Workshops (ICPM'20), pages 136--148, Padua, Italy, October 2020. SPRINGER.
doi: https://doi.org/10.1007/978-3-030-72693-5_11.
[ BibTex | DOI | Web page | PDF ]
[CFH⁺20]: D. Cho, M. Függer, C. Hopper, M. Kushwaha, T. Nowak, and Q. Soubeyran. Distributed Computation with Continual Population Growth. In Proceedings of the 34th International Symposium on Distributed Computing (DISC'20), Leibniz International Proceedings in Informatics, pages 7:1--7:17, Freiburg, Germany, October 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.DISC.2020.7.
[ BibTex | DOI | Web page | PDF ]
[SBvdA20]: M. F. Sani, M. Boltenhagen, and W. M. van der Aalst. Prototype Selection using Clustering and Conformance Metrics for Process Discovery. In Business Process Management Workshops (BPM'20), Revised Selected Papers, volume 397 of Lecture Notes in Business Information Processing, pages 281--294, Sevilla, Spain, September 2020. Springer.
doi: https://doi.org/10.1007/978-3-030-66498-5_21.
[ BibTex | DOI | Web page | PDF ]
[KNR⁺20]: I. Khmelnitsky, D. Neider, R. Roy, B. Barbot, B. Bollig, A. Finkel, S. Haddad, M. Leucker, and L. Ye. Property-Directed Verification of Recurrent Neural Networks. Research Report 2009.10610, Computing Research Repository, September 2020.
[ BibTex | Web page | PDF ]
[HPS20]: S. Haar, L. Paulevé, and S. Schwoon. Drawing the Line: Basin Boundaries in Safe Petri Nets. In Proceedings of the 18th Conference on Computational Methods in System Biology (CMSB'20), volume 12314 of Lecture Notes in Bioinformatics, pages 321--336, held online, September 2020. Springer-Verlag.
doi: 10.1007/978-3-030-60327-4_17.
[ BibTex | DOI ]
[BBB⁺20]: B. Bérard, B. Bollig, P. Bouyer, M. Függer, and N. Sznajder. Synthesis in Presence of Dynamic Links. In Proceedings of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), volume 326 of Electronic Proceedings in Theoretical Computer Science, page 33?49, Brussels, Belgium, September 2020.
doi: 10.4204/EPTCS.326.3.
[ BibTex | DOI | Web page | PDF ]
[DH20b]: S. Donatelli and S. Haddad. Guarded Autonomous Transitions Increase Conciseness and Expressiveness of Timed Automata. In Proceedings of the 18th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'20), Lecture Notes in Computer Science, pages 215--230, Vienna, Austria, September 2020. Springer.
[ BibTex | Web page ]
[PKCH20]: L. Paulevé, J. Kolcák, T. Chatain, and S. Haar. Reconciling qualitative, abstract, and scalable modeling of biological networks. Nature Communications, 11(4256), August 2020.
doi: 10.1038/s41467-020-18112-5.
[ BibTex | DOI | Web page ]
[HK20]: S. Haddad and I. Khmelnitsky. Dynamic Recursive Petri Nets. In Proceedings of the 41st International Conference on Applications and Theory of Petri Nets (PETRI NETS'20), volume 12152 of Lecture Notes in Computer Science, pages 345--366, Paris, France, June 2020. Springer.
doi: 10.1007/978-3-030-51831-8_17.
[ BibTex | DOI | Web page ]
[BFL⁺20]: J. Bund, M. Függer, C. Lenzen, M. Medina, and W. Rosenbaum. PALS: Plesiochronous and Locally Synchronous Systems. In Proceedings of the 26th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'20), Publication only, May 2020. IEEE Computer Society.
[ BibTex | PDF ]
[KDH⁺20]: J. Kolcák, J. Dubut, I. Hasuo, S.-Y. Katsumata, D. Sprunger, and A. Yamada. Relational Differential Dynamic Logic. In Proceedings of the 26th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'20), volume 12078 of Lecture Notes in Computer Science, pages 191--208, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45190-5_11.
[ BibTex | DOI | Web page ]
[DH20a]: S. Donatelli and S. Haddad. Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models. In Proceedings of the 14th International Conference on Language and Automata Theory and Applications (LATA'20), volume 12038 of Lecture Notes in Computer Science, pages 170--183, Milan, Italy, March 2020. Springer.
[ BibTex ]
[CHK⁺20]: Th. Chatain, S. Haar, J. Kolcák, L. Paulevé, and A. Thakkar. Concurrency in Boolean networks. Natural Computing, 19:91--109, 2020.
[ BibTex | Web page | PDF ]
[CJS20]: T. Chatain, R. Janicki, and N. Sidorova, editors. Proceedings of the 41st Conference on Petri Nets (PN'20), Paris, France, 2020. Springer.
[ BibTex | Web page ]
[JMS20]: L. Jezequel, A. Madalinski, and S. Schwoon. Distributed computation of vector clocks in Petri net unfoldings for test selection. Discrete Event Dynamic Systems: Theory and Applications, 30(3):441--464, 2020.
[ BibTex ]
[BCC20]: M. Boltenhagen, T. Chatain, and J. Carmona. Model-based trace variant analysis of event logs. Information Systems, 2020. To appear.
doi: https://doi.org/10.1016/j.is.2020.101675.
[ BibTex | DOI | Web page ]
[FHK20]: A. Finkel, S. Haddad, and I. Khmelnitsky. Commodification of accelerations for the Karp and Miller Construction. Discrete Event Dynamic Systems: Theory and Applications, 2020.
doi: 10.1007/s10626-020-00331-z.
[ BibTex | DOI | Web page ]
[BHL20]: N. Bertrand, S. Haddad, and E. Lefaucheux. Diagnosis and Degradation Control for Probabilistic Systems. Discrete Event Dynamic Systems: Theory and Applications, 30:695–723, 2020.
doi: 10.1007/s10626-020-00320-2.
[ BibTex | DOI | Web page ]
[FKN20]: M. Függer, M. Kushwaha, and T. Nowak. Digital Circuit Design for Biological and Silicon Computers. In Advances in Synthetic Biology. Springer, 2020. To appear.
[ BibTex ]
[BHL19]: N. Bertrand, S. Haddad, and E. Lefaucheux. A Tale of Two Diagnoses in Probabilistic Systems. Information and Computation, 269, December 2019.
doi: 10.1016/j.ic.2019.104441.
[ BibTex | DOI | PDF ]
[Man19]: H. Mandon. Algorithms for Cell Reprogramming Strategies in Boolean Networks. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, December 2019.
[ BibTex | Web page | PDF ]
[DH19b]: S. Donatelli and S. Haddad. Autonomous Transitions Enhance CSLTA Expressiveness and Conciseness. Research Report hal-02306021, HAL, October 2019. 23 pages.
[ BibTex | Web page | PDF ]
[MSH⁺19]: H. Mandon, C. Su, S. Haar, J. Pang, and L. Paulevé. Sequential Reprogramming of Boolean Networks Made Practical. In Proceedings of the 17th Conference on Computational Methods in System Biology (CMSB'19), volume 11773 of Lecture Notes in Bioinformatics, pages 3--19, Trieste, Italy, September 2019. Springer-Verlag.
doi: 10.1007/978-3-030-31304-3_1.
[ BibTex | DOI ]
[BCC19a]: M. Boltenhagen, T. Chatain, and J. Carmona. Encoding Conformance Checking Artefacts in SAT. In Business Process Management Workshops (BPM'19), Revised Selected Papers, volume 362 of Lecture Notes in Business Information Processing, pages 160--171, Vienna, Austria, September 2019. Springer.
doi: 10.1007/978-3-030-37453-2_14.
[ BibTex | DOI | Web page | PDF ]
[ÖMFS19]: D. Öhlinger, J. Maier, M. Függer, and U. Schmid. The Involution Tool for Accurate Digital Timingand Power Analysis. In Proceedings of the 29th International Symposium on Power and Timing Modeling, Optimization and Simulation (PATMOS'19), pages 1--8, Rhodes, Greece, July 2019. IEEE Press.
doi: 10.1109/PATMOS.2019.8862165.
[ BibTex | DOI | Web page ]
[BCC19b]: M. Boltenhagen, T. Chatain, and J. Carmona. Generalized Alignment-Based Trace Clustering of Process Behavior. In Proceedings of the 40th International Conference on Applications and Theory of Petri Nets (PETRI NETS'19), volume 11522 of Lecture Notes in Computer Science, pages 237--257, Aachen, Germany, June 2019. Springer.
doi: 10.1007/978-3-030-21571-2_14.
[ BibTex | DOI | Web page | PDF ]
[DH19a]: S. Donatelli and S. Haar, editors. Proceedings of the 40th International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS'19), volume 11522 of Lecture Notes in Computer Science, Aachen, Germany, June 2019. Springer.
doi: 10.1007/978-3-030-21571-2.
[ BibTex | DOI | Web page ]
[MFNS19]: J. Maier, M. Függer, T. Nowak, and U. Schmid. Transistor-Level Analysis of Dynamic Delay Models. In Proceedings of the 25th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'19), pages 76--85, Hirosaki, Japan, May 2019. IEEE Computer Society.
doi: 10.1109/ASYNC.2019.00019.
[ BibTex | DOI ]
[AFMS19]: É. André, L. Fribourg, J.-M. Mota, and R. Soulat. Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking. In Proceedings of the 20th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'19), Lecture Notes in Computer Science, pages 409--424, Cascais/Lisbon, Portugal, January 2019. Springer.
[ BibTex | PDF ]
[HKP19]: S. Haar, J. Kolcák, and L. Paulevé. Combining Refinement of Parametric Models with Goal-Oriented Reduction of Dynamics. In Proceedings of the 20th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'19), Lecture Notes in Computer Science, pages 555--576, Cascais/Lisbon, Portugal, January 2019. Springer.
[ BibTex | Web page | PDF ]
[KŠHP19]: J. Kolcák, D. Šafránek, S. Haar, and L. Paulevé. Parameter Space Abstraction and Unfolding Semantics of Discrete Regulatory Networks. Theoretical Computer Science, 765:120--144, 2019.
doi: 10.1016/j.tcs.2018.03.009.
[ BibTex | DOI | Web page | PDF ]
[MSP⁺19]: H. Mandon, C. Su, J. Pang, S. Paul, S. Haar, and L. Paulevé. Algorithms for the Sequential Reprogramming of Boolean Networks. IEEE/ACM Transaction on Computational Biology and Bioinformatics, 16(5):1610--1619, 2019.
[ BibTex | Web page | PDF ]
[vdACCvD19]: W. M. P. van der Aalst, J. Carmona, T. Chatain, and B. F. van Dongen. A Tour in Process Mining: From Practice to Algorithmic Challenges. Transactions on Petri Nets and Other Models of Concurrency, 14:1--35, 2019.
doi: 10.1007/978-3-662-60651-3_1.
[ BibTex | DOI | Web page ]
[FNNS19]: M. Függer, R. Najvirt, T. Nowak, and U. Schmid. A faithful binary circuit model. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2019.
doi: 10.1109/TCAD.2019.2937748.
[ BibTex | DOI | Web page ]
[BHH18]: B. Bérard, S. Haar, and L. Hélouët. Hyper Partial Order Logic. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), volume 122 of Leibniz International Proceedings in Informatics, pages 20:1--20:21, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.20.
[ BibTex | DOI | Web page | PDF ]
[Dup18]: Y. Duplouy. Applying Formal Methods to Autonomous Vehicle Control. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2018.
[ BibTex | Web page ]
[CHK⁺18]: Th. Chatain, S. Haar, J. Kolcák, A. Thakkar, and L. Paulevé. Concurrency in Boolean networks. Research Report hal-01893106, HAL, October 2018. 33 pages.
[ BibTex | Web page | PDF ]
[FN18]: M. Függer and Th. Nowak. Fast Multidimensional Asymptotic and Approximate Consensus. In Proceedings of the 32nd International Symposium on Distributed Computing (DISC'18), volume 121 of Leibniz International Proceedings in Informatics, pages 27:1--27:15, New Orleans, USA, October 2018. Leibniz-Zentrum für Informatik.
[ BibTex | Web page ]
[Lef18]: E. Lefaucheux. Controlling Information in Probabilistic Systems. Thèse de doctorat, Université Rennes 1, Rennes, France, September 2018.
[ BibTex | Web page | PDF ]
[CHP18b]: Th. Chatain, S. Haar, and L. Paulevé. Most Permissive Semantics of Boolean Networks. Research Report 1808.10240, Computing Research Repository, August 2018. 15 pages.
[ BibTex | Web page | PDF ]
[FFL18]: S. Friedrichs, M. Függer, and C. Lenzen. Metastability-Containing Circuits. IEEE Transactions on Computers, 67(8):1167--1183, August 2018.
doi: 10.1109/TC.2018.2808185.
[ BibTex | DOI | Web page ]
[HM18]: S. Haddad and B. Monmege. Interval iteration algorithm for MDPs and IMDPs. Theoretical Computer Science, 735:111--131, July 2018.
doi: 10.1016/j.tcs.2016.12.003.
[ BibTex | DOI | Web page ]
[FNS18]: M. Függer, Th. Nowak, and M. Schwarz. Tight Bounds for Asymptotic and Approximate Consensus. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC'18), pages 325--334, Egham, UK, July 2018. ACM Press.
doi: 10.1145/3212734.3212762.
[ BibTex | DOI | Web page ]
[LFV18]: A. Le Coënt, L. Fribourg, and J. Vacher. Control Synthesis for Stochastic Switched Systems using the Tamed Euler Method. In Proceedings of the 6th IFAC Conference on Analysis and Design of Hybrid Systems (ADHS'18), volume 51 of IFAC-PapersOnLine, pages 259--264, Oxford, UK, July 2018. Elsevier Science Publishers.
doi: 10.1016/j.ifacol.2018.08.044.
[ BibTex | DOI | Web page | PDF ]
[FHLM18]: É. Fabre, L. Hélouët, E. Lefaucheux, and H. Marchand. Diagnosability of Repairable Faults. Discrete Event Dynamic Systems: Theory and Applications, 28(2):183--213, June 2018.
doi: 10.1007/s10626-017-0255-8.
[ BibTex | DOI | PDF ]
[CHP18a]: Th. Chatain, S. Haar, and L. Paulevé. Boolean Networks: Beyond Generalized Asynchronicity. In Proceedings of the 24th Annual International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA'18), volume 10875 of Lecture Notes in Computer Science, pages 29--42, Ghent, Belgium, June 2018. Springer.
doi: 10.1007/978-3-319-92675-9_3.
[ BibTex | DOI | Web page ]
[LGS18]: E. Lefaucheux, A. Giua, and C. Seatzu. Basis Coverability Graph for Partially Observable Petri Nets with Application to Diagnosability Analysis. In Proceedings of the 39th International Conference on Applications and Theory of Petri Nets (PETRI NETS'18), volume 10877 of Lecture Notes in Computer Science, pages 164--183, Bratislava, Slovakia, June 2018. Springer.
[ BibTex | PDF ]
[BBDH18]: B. Barbot, B. Bérard, Y. Duplouy, and S. Haddad. Integrating Simulink Models into the Model Checker Cosmos. In Proceedings of the 39th International Conference on Applications and Theory of Petri Nets (PETRI NETS'18), volume 10877 of Lecture Notes in Computer Science, pages 363--373, Bratislava, Slovakia, June 2018. Springer.
doi: 10.1007/978-3-319-91268-4_19.
[ BibTex | DOI | Web page | PDF ]
[SGF18b]: A. Saoud, A. Girard, and L. Fribourg. On the Composition of Discrete and Continuous-time Assume-Guarantee Contracts for Invariance. In Proceedings of the European Control Conference (ECC'18), pages 435--440, Limassol, Cyprus, June 2018. IEEE Press.
doi: 10.23919/ECC.2018.8550622.
[ BibTex | DOI | Web page | PDF ]
[FKLW18]: M. Függer, A. Kinali, C. Lenzen, and B. Wiederhake. Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance. In Proceedings of the 24th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'18), pages 68--77, Vienna, Austria, May 2018. IEEE Computer Society.
doi: 10.1109/ASYNC.2018.00025.
[ BibTex | DOI | Web page ]
[JMS18]: L. Jezequel, A. Madalinski, and S. Schwoon. Distributed computation of vector clocks in Petri nets unfolding for test selection. In Proceedings of the 14th Workshop on Discrete Event Systems (WODES'18), volume 51(7) of IFAC-PapersOnLine, pages 106--111, Sorrento Coast, Italy, May-June 2018. Elsevier Science Publishers.
[ BibTex | PDF ]
[SGF18a]: A. Saoud, A. Girard, and L. Fribourg. Contract based Design of Symbolic Controllers for Vehicle Platooning. In Proceedings of the 21st ACM International Conference on Hybrid Systems: Computation and Control (HSCC'18), pages 277--278, Porto, Portugal, April 2018. ACM Press. Poster.
doi: 10.1145/3178126.3187001.
[ BibTex | DOI | PDF ]
[Had18]: S. Haddad. Memoryless determinacy of finite parity games: Another simple proof. Information Processing Letters, 132:19--21, April 2018.
doi: 10.1016/j.ipl.2017.11.012.
[ BibTex | DOI | PDF ]
[CCD⁺18]: Th. Chatain, M. Comlan, D. Delfieu, L. Jezequel, and O. H. Roux. Pomsets and Unfolding of Reset Petri Nets. In Proceedings of the 12th International Conference on Language and Automata Theory and Applications (LATA'18), volume 10792 of Lecture Notes in Computer Science, pages 258--270, Bar-Ilan, Israel, April 2018. Springer.
doi: 10.1007/978-3-319-77313-1_20.
[ BibTex | DOI | Web page ]
[FMN⁺18]: M. Függer, J. Maier, R. Najvirt, Th. Nowak, and U. Schmid. A Faithful Binary Circuit Model with Adversarial Noise. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE'18), pages 1327--1332, Dresden, Germany, March 2018. IEEE Computer Society Press.
doi: 10.23919/DATE.2018.8342219.
[ BibTex | DOI | Web page | PDF ]
[BFG18]: B. Bollig, M. Fortin, and P. Gastin. Communicating Finite-State Machines and Two-Variable Logic. In Proceedings of the 35th Annual Symposium on Theoretical Aspects of Computer Science (STACS'18), volume 96 of Leibniz International Proceedings in Informatics, pages 17:1--17:14, Caen, France, February 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2018.17.
[ BibTex | DOI | Web page | PDF ]
[BGH18]: B. Bollig, M.-L. Grindei, and P. Habermehl. Realizability of Concurrent Recursive Programs. Formal Methods in System Design, 53(3):339--362, 2018.
doi: 10.1007/s10703-017-0282-y.
[ BibTex | DOI ]
[BHSS18]: B. Bérard, S. Haar, S. Schmitz, and S. Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundamenta Informaticae, 161(4):317--349, 2018.
doi: 10.3233/FI-2018-1706.
[ BibTex | DOI | Web page ]
[LFM⁺18]: A. Le Coënt, L. Fribourg, N. Markey, F. De Vuyst, and L. Chamoin. Compositional synthesis of state-dependent switching control. Theoretical Computer Science, 750:53--68, 2018.
doi: 10.1016/j.tcs.2018.01.021.
[ BibTex | DOI | Web page | PDF ]
[LACF18]: A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, and L. Fribourg. An improved algorithm for the control synthesis of nonlinear sampled switched systems. Formal Methods in System Design, 53(3):363--383, 2018.
doi: 10.1007/s10703-017-0305-8.
[ BibTex | DOI | Web page | PDF ]
[BHL17a]: B. Bérard, S. Haddad, and E. Lefaucheux. Probabilistic Disclosure: Maximisation vs. Minimisation. In Proceedings of the 37th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'17), volume 93 of Leibniz International Proceedings in Informatics, pages 13:1--13:14, Kanpur, India, December 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2017.13.
[ BibTex | DOI | Web page | PDF ]
[CHKP17]: K. Chatzikokolakis, S. Haddad, A. Kassem, and C. Palamidessi. Trading Optimality for Performance in Location Privacy. In Proceedings of the 11th International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS'17), pages 221--222, Venice, Italy, December 2017.
doi: 10.1145/3150928.3150962.
[ BibTex | DOI | Web page | PDF ]
[CCvD17]: Th. Chatain, J. Carmona, and B. van Dongen. Alignment-Based Trace Clustering. In Proceedings of the 36th International Conference on Conceptual Modeling (ER'17), volume 10650 of Lecture Notes in Computer Science, pages 295--308, Valencia, Spain, November 2017. Springer. To appear.
doi: 10.1007/978-3-319-69904-2_24.
[ BibTex | DOI | Web page | PDF ]
[BHL17b]: N. Bertrand, S. Haddad, and E. Lefaucheux. Diagnostic et contrôle de la dégradation des systèmes probabilistes. In Actes du 11ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'17), Marseille, France, November 2017. HAL.
[ BibTex | PDF ]
[FNS17]: M. Függer, Th. Nowak, and M. Schwarz. Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks. In Proceedings of the 31st International Symposium on Distributed Computing (DISC'17), volume 91 of Leibniz International Proceedings in Informatics, pages 51:1--51:3, Vienna, Austria, October 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.DISC.2017.51.
[ BibTex | DOI | Web page | PDF ]
[MHP17]: H. Mandon, S. Haar, and L. Paulevé. Temporal Reprogramming of Boolean Networks. In Proceedings of the 15th Conference on Computational Methods in System Biology (CMSB'17), volume 10545 of Lecture Notes in Bioinformatics, pages 179--195, Darmstadt, Germany, September 2017. Springer-Verlag.
doi: 10.1007/978-3-319-67471-1_11.
[ BibTex | DOI | PDF ]
[Fri17]: L. Fribourg. Euler's Method Applied to the Control of Switched Systems. In Proceedings of the 15th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'17), volume 10419 of Lecture Notes in Computer Science, pages 3--21, Berlin, Germany, September 2017. Springer.
doi: 10.1007/978-3-319-65765-3_1.
[ BibTex | DOI | Web page | PDF ]
[LAC⁺17]: A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, L. Fribourg, F. De Vuyst, and L. Chamoin. Distributed Control Synthesis Using Euler's Method. In Proceedings of the 11th Workshop on Reachability Problems in Computational Models (RP'17), volume 10506 of Lecture Notes in Computer Science, pages 118--131, London, UK, September 2017. Springer.
doi: 10.1007/978-3-319-67089-8_9.
[ BibTex | DOI | Web page | PDF ]
[CP17]: Th. Chatain and L. Paulevé. Goal-Driven Unfolding of Petri Nets. In Proceedings of the 28th International Conference on Concurrency Theory (CONCUR'17), volume 85 of Leibniz International Proceedings in Informatics, pages 18:1--18:16, Berlin, Germany, September 2017. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2017.18.
[ BibTex | DOI | Web page | PDF ]
[Had17]: S. Haddad. Memoryless Determinacy of Finite Parity Games: Another Simple Proof. Research Report hal-01541508, HAL-inria, June 2017. 7 pages.
[ BibTex | Web page | PDF ]
[vCCT17]: B. van Dongen, J. Carmona, Th. Chatain, and F. Taymouri. Aligning Modeled and Observed Behavior: A Compromise Between Complexity and Quality. In Proceedings of the 29th International Conference on Advanced Information Systems Engineering (CAiSE'17), volume 10253 of Lecture Notes in Computer Science, pages 94--109, Essen, Germany, June 2017. Springer.
doi: 10.1007/978-3-319-59536-8_7.
[ BibTex | DOI | PDF ]
[BHSS17]: B. Bérard, S. Haar, S. Schmitz, and S. Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. In Proceedings of the 38th International Conference on Applications and Theory of Petri Nets (PETRI NETS'17), volume 10258 of Lecture Notes in Computer Science, pages 200--220, Zaragoza, Spain, June 2017. Springer.
doi: 10.1007/978-3-319-57861-3_13.
[ BibTex | DOI | Web page ]
[TFL17]: G. Tarawneh, M. Függer, and C. Lenzen. Metastability Tolerant Computing. In Proceedings of the 23rd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'17), pages 25--32, San Diego, California, USA, May 2017. IEEE Computer Society.
doi: 10.1109/ASYNC.2017.9.
[ BibTex | DOI | Web page | PDF ]
[FKLP17]: M. Függer, A. Kinali, C. Lenzen, and T. Polzer. Metastability-Aware Memory-Efficient Time-to-Digital Converter. In Proceedings of the 23rd IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'17), pages 49--56, San Diego, California, USA, May 2017. IEEE Computer Society.
doi: 10.1109/ASYNC.2017.12.
[ BibTex | DOI | Web page | PDF ]
[LDCF17]: A. Le Coënt, F. De Vuyst, L. Chamoin, and L. Fribourg. Control Synthesis of Nonlinear Sampled Switched Systems using Euler's Method. In Proceedings of the 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR'17), volume 247 of Electronic Proceedings in Theoretical Computer Science, pages 18--33, Uppsala, Sweden, April 2017.
doi: 10.4204/EPTCS.247.2.
[ BibTex | DOI | Web page | PDF ]
[BBDH17]: B. Barbot, B. Bérard, Y. Duplouy, and S. Haddad. Statistical Model-Checking for Autonomous Vehicle Safety Validation. In SIA Simulation Numérique, Montigny-le-Bretonneux, France, March 2017.
[ BibTex | Web page | PDF ]
[CFNS17]: B. Charron-Bost, M. Függer, Th. Nowak, and M. Schwarz. New transience bounds for max-plus linear systems. Discrete Applied Mathematics, 219:83--99, March 2017.
doi: 10.1016/j.dam.2016.11.003.
[ BibTex | DOI | Web page | PDF ]
[HHMS17]: S. Haar, S. Haddad, T. Melliti, and S. Schwoon. Optimal constructions for active diagnosis. Journal of Computer and System Sciences, 83(1):101--120, 2017.
doi: 10.1016/j.jcss.2016.04.007.
[ BibTex | DOI | PDF ]
[BKM17]: B. Bollig, D. Kuske, and R. Mennicke. The Complexity of Model Checking Multi-Stack Systems. Theory of Computing Systems, 60(4):695--736, 2017.
doi: 10.1007/s00224-016-9700-6.
[ BibTex | DOI | Web page ]
[BFHH17]: M. Blondin, A. Finkel, C. Haase, and S. Haddad. The Logical View on Continuous Petri Nets. ACM Transactions on Computational Logic, 18(3):24:1--24:28, 2017.
doi: 10.1145/3105908.
[ BibTex | DOI | Web page | PDF ]
[HPV17]: S. Haar, S. Perchy, and F. Valencia. D-SPACES: Implementing Declarative Semantics for Spatially Structured Information. In Proceedings of the 11th International Conference on Semantic Computing (ICSC'17), volume 11 of IEEE ICSC, pages 227--233, San Diego, CA, USA, January 2017. IEEE Press.
doi: 10.1109/ICSC.2017.34.
[ BibTex | DOI | Web page | PDF ]
[GHP⁺17]: M. Guzmán, S. Haar, S. Perchy, C. Rueda, and F. Valencia. Belief, Knowledge, Lies and Other Utterances in an Algebra for Space and Extrusion. Journal of Logic and Algebraic Methods in Programming, 86(1):107--133, January 2017.
doi: 10.1016/j.jlamp.2016.09.001.
[ BibTex | DOI | Web page | PDF ]
[ACR17]: É. André, Th. Chatain, and C. Rodríguez. Preserving Partial-Order Runs in Parametric Time Petri Nets. ACM Transactions in Embedded Computing Systems, 16(2):43:1--43:26, 2017.
doi: 10.1145/3012283.
[ BibTex | DOI | PDF ]
[Bol16]: B. Bollig. One-Counter Automata with Counter Observability. In Proceedings of the 36th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'16), volume 65 of Leibniz International Proceedings in Informatics, pages 20:1--20:14, Chennai, India, December 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2016.20.
[ BibTex | DOI | Web page ]
[vDCC16a]: B. van Dongen, J. Carmona, and Th. Chatain. Alignment-based Quality Metrics in Conformance Checking. In Proceedings of the 7th Int. Workshop on Enterprise Modelling and Information Systems Architectures (EMISA'16), volume 1701 of CEUR Workshop Proceedings, pages 87--90, Vienna, Austria, October 2016. CEUR-WS.org.
[ BibTex | DOI | Web page | PDF ]
[MHP16]: H. Mandon, S. Haar, and L. Paulevé. Relationship between the Reprogramming Determinants of Boolean Networks and their Interaction Graph. In Proceedings of the 5th International Workshop on Hybrid Systems Biology, Lecture Notes in Computer Science, pages 113--127, Grenoble France, October 2016. Springer.
doi: 10.1007/978-3-319-47151-8_8.
[ BibTex | DOI | Web page | PDF ]
[Haa16]: S. Haar. Cyclic Ordering through Partial Orders. Journal of Multiple-Valued Logic and Soft Computing, 27(2-3):209--228, September 2016.
[ BibTex | Web page | PDF ]
[KŠHP16]: J. Kolcák, D. Šafránek, S. Haar, and L. Paulevé. Unfolding of Parametric Logical Regulatory Networks. In Proceedings of The Seventh International Workshop on Static Analysis and Systems Biology (SASB 2016), Electronic Notes in Theoretical Computer Science, Edinburgh, UK, September 2016. Elsevier Science Publishers. To appear.
[ BibTex | Web page | PDF ]
[vDCC16b]: B. F. van Dongen, J. Carmona, and Th. Chatain. A Unified Approach for Measuring Precision and Generalization Based on Anti-Alignments. In Proceedings of the 14th International Conference on Business Process Management (BPM'16), volume 9850 of Lecture Notes in Computer Science, pages 39--56, Rio de Janeiro, Brazil, September 2016. Springer.
doi: 10.1007/978-3-319-45348-4_3.
[ BibTex | DOI | Web page | PDF ]
[Leh16]: M. Lehaut. PDL on infinite alphabet. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, August 2016. 19 pages.
[ BibTex | Web page | PDF ]
[HT16b]: S. Haar and S. Theissing. Decoupling Passenger Flows for Improved Load Prediction. In Proceedings of the 13th International Conference on Quantitative Evaluation of Systems (QEST'16), volume 9826 of Lecture Notes in Computer Science, pages 364--379, Québec City, Canada, August 2016. Springer.
doi: 10.1007/978-3-319-43425-4_24.
[ BibTex | DOI | Web page | PDF ]
[AGK16]: S. Akshay, P. Gastin, and S. N. Krishna. Analyzing Timed Systems Using Tree Automata. In Proceedings of the 27th International Conference on Concurrency Theory (CONCUR'16), volume 59 of Leibniz International Proceedings in Informatics, pages 27:1--27:14, Québec City, Canada, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2016.27.
[ BibTex | DOI | Web page | PDF ]
[BHL16b]: N. Bertrand, S. Haddad, and E. Lefaucheux. Diagnosis in Infinite-State Probabilistic Systems. In Proceedings of the 27th International Conference on Concurrency Theory (CONCUR'16), volume 59 of Leibniz International Proceedings in Informatics, pages 37:1--37:15, Québec City, Canada, August 2016. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2016.37.
[ BibTex | DOI | Web page | PDF ]
[HT16d]: S. Haar and S. Theissing. Predicting Traffic Load in Public Transportation Networks. In Proceedings of the 35th American Control Conference (ACC'16), pages 821--826, Boston, Massachusetts, USA, July 2016. IEEE Control System Society.
doi: 10.1109/ACC.2016.7525015.
[ BibTex | DOI | Web page | PDF ]
[PHL16]: H. Ponce de León, S. Haar, and D. Longuet. Model-based Testing for Concurrent Systems: Unfolding-based Test Selection. International Journal on Software Tools for Technology Transfer, 18(3):305--318, June 2016.
doi: 10.1007/s10009-014-0353-y.
[ BibTex | DOI | Web page | PDF ]
[CC16]: J. Carmona and Th. Chatain. Anti-Alignments in Conformance Checking -- The Dark Side of Process Models. In Proceedings of the 37th International Conference on Applications and Theory of Petri Nets (PETRI NETS'16), volume 9698 of Lecture Notes in Computer Science, pages 240--258, Torún, Poland, June 2016. Springer.
doi: 10.1007/978-3-319-39086-4_15.
[ BibTex | DOI | Web page | PDF ]
[LBB⁺16]: A. Linard, B. Barbot, D. Buchs, M. Colange, C. Démoulins, L. Hillah, and A. Martin. Layered Data: A Modular Formal Definition without Formalisms. In Proceedings of the 10th International Workshop on Petri Nets and Software Engineering (PNSE'16), volume 1591 of CEUR Workshop Proceedings, pages 287--306, Torun, Poland, June 2016. CEUR-WS.org.
[ BibTex | Web page | PDF ]
[HT16a]: S. Haar and S. Theissing. A Passenger-centric Multi-agent System Model for Multimodal Public Transportation. Research Report hal-01322956, HAL-inria, May 2016. 12 pages.
[ BibTex | Web page | PDF ]
[FHLM16]: É. Fabre, L. Hélouët, E. Lefaucheux, and H. Marchand. Diagnosability of Repairable Faults. In Proceedings of the 13th Workshop on Discrete Event Systems (WODES'16), pages 230--236, Xi'an, China, May-June 2016. IEEE Control System Society.
doi: 10.1109/WODES.2016.7497853.
[ BibTex | DOI | Web page | PDF ]
[HT16c]: S. Haar and S. Theissing. Forecasting Passenger Loads in Transportation Networks. In Proceedings of the 8th International Workshop on Practical Applications of Stochastic Modelling (PASM'16), volume 327 of Electronic Notes in Theoretical Computer Science, pages 49--69, Münster, Germany, April 2016. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2016.09.023.
[ BibTex | DOI | Web page | PDF ]
[FG16]: M. Fortin and P. Gastin. Verification of parameterized communicating automata via split-width. In Proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'16), volume 9634 of Lecture Notes in Computer Science, pages 197--213, Eindhoven, The Netherlands, April 2016. Springer.
doi: 10.1007/978-3-662-49630-5_12.
[ BibTex | DOI | Web page | PDF ]
[BFHH16a]: M. Blondin, A. Finkel, C. Haase, and S. Haddad. Approaching the Coverability Problem Continuously. In Proceedings of the 22th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'16), volume 9636 of Lecture Notes in Computer Science, pages 480--496, Eindhoven, The Netherlands, April 2016. Springer.
doi: 10.1007/978-3-662-49674-9_28.
[ BibTex | DOI | Web page | PDF ]
[BHJL16]: B. Bérard, S. Haddad, A. Jovanović, and D. Lime. Interrupt Timed Automata with Auxiliary Clocks and Parameters. Fundamenta Informaticae, 143(3-4):235--259, March 2016.
doi: 10.3233/FI-2016-1313.
[ BibTex | DOI | Web page | PDF ]
[BHL16a]: N. Bertrand, S. Haddad, and E. Lefaucheux. Accurate Approximate Diagnosability of Stochastic Systems. In Proceedings of the 10th International Conference on Language and Automata Theory and Applications (LATA'16), volume 9618 of Lecture Notes in Computer Science, pages 549--561, Prague, Czech Republic, March 2016. Springer.
doi: 10.1007/978-3-319-30000-9_42.
[ BibTex | DOI | Web page | PDF ]
[BFHH16b]: M. Blondin, A. Finkel, C. Haase, and S. Haddad. QCover: an efficient coverability verifier for discrete and continuous Petri nets, 2016.
[ BibTex | Web page ]
[KGH⁺16]: F. Kordon, H. Garavel, L. Hillah, E. Paviot-Adet, L. Jezequel, C. Rodríguez, and F. Hulin-Hubard. MCC'2015 - The Fifth Model Checking Contest. Transactions on Petri Nets and Other Models of Concurrency, 11:262--273, 2016.
doi: 10.1007/978-3-662-53401-4_12.
[ BibTex | DOI | Web page | PDF ]
[GHKS15]: V. Germanos, S. Haar, V. Khomenko, and S. Schwoon. Diagnosability under Weak Fairness. ACM Transactions in Embedded Computing Systems, 14(4:69), December 2015.
doi: 10.1145/2832910.
[ BibTex | DOI | Web page | PDF ]
[BGH⁺15]: Th. Brihaye, G. Geeraerts, A. Haddad, E. Lefaucheux, and B. Monmege. Simple Priced Timed Games Are Not That Simple. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), volume 45 of Leibniz International Proceedings in Informatics, pages 278--292, Bangalore, India, December 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2015.278.
[ BibTex | DOI | Web page | PDF ]
[BHH⁺15]: S. Böhm, S. Haar, S. Haddad, P. Hofman, and S. Schwoon. Active Diagnosis with Observable Quiescence. In Proceedings of the 54th IEEE Conference on Decision and Control (CDC'15), pages 1663--1668, Osaka, Japan, December 2015. IEEE Control System Society.
doi: 10.1109/CDC.2015.7402449.
[ BibTex | DOI | Web page | PDF ]
[HT15]: S. Haar and S. Theissing. A Hybrid-Dynamical Model for Passenger-flow in Transportation Systems. In Proceedings of the 5th IFAC Conference on Analysis and Design of Hybrid Systems (ADHS'15), volume 48 of IFAC-PapersOnLine, pages 236--241, Atlanta, Georgia, USA, October 2015. Elsevier Science Publishers.
doi: 10.1016/j.ifacol.2015.11.181.
[ BibTex | DOI | Web page | PDF ]
[PRC⁺15]: H. Ponce de León, C. Rodríguez, J. Carmona, K. Heljanko, and S. Haar. Unfolding-Based Process Discovery. In Proceedings of the 13th International Symposium on Automated Technology for Verification and Analysis (ATVA'15), volume 9364 of Lecture Notes in Computer Science, Shanghai, China, October 2015. Springer.
doi: 10.1007/978-3-319-24953-7_4.
[ BibTex | DOI | Web page | PDF ]
[MLB⁺15b]: A. Methni, M. Lemerre, B. Ben Hedia, S. Haddad, and K. Barkaoui. State Space Reduction Strategie for Model Checking Concurrent C Programs. In Proceedings of the 9th Workshop on Verification and Evaluation of Computer and Communication Systems(VECoS'15), volume 1431 of CEUR Workshop Proceedings, pages 65--76, Bucharest, Romania, September 2015. RWTH Aachen, Germany.
[ BibTex | Web page | PDF ]
[BHP⁺15]: B. Bérard, S. Haddad, C. Picaronny, M. Safey El Din, and M. Sassolas. Polynomial Interrupt Timed Automata. In Proceedings of the 9th Workshop on Reachability Problems in Computational Models (RP'15), volume 9328 of Lecture Notes in Computer Science, pages 20--32, Warsaw, Poland, September 2015. Springer.
doi: 10.1007/978-3-319-24537-9_3.
[ BibTex | DOI | Web page | PDF ]
[Bol15c]: B. Bollig. Towards Formal Verification of Distributed Algorithms. In Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning (TIME'15), page 3, Kassel, Germany, September 2015. IEEE Computer Society Press.
doi: 10.1109/TIME.2015.23.
[ BibTex | DOI | Web page | PDF ]
[ABG15]: C. Aiswarya, B. Bollig, and P. Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of Leibniz International Proceedings in Informatics, pages 340--353, Madrid, Spain, September 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2015.340.
[ BibTex | DOI | Web page | PDF ]
[AGMK15]: S. Akshay, P. Gastin, M. Mukund, and K. N. Kumar. Checking conformance for time-constrained scenario-based specifications. Theoretical Computer Science, 594:24--43, August 2015.
doi: 10.1016/j.tcs.2015.03.030.
[ BibTex | DOI | Web page | PDF ]
[Bol15a]: B. Bollig. Automata and Logics for Concurrent Systems: Five Models in Five Pages. In Proceedings of the 20th International Conference on Implementation and Application of Automata (CIAA'15), volume 9223 of Lecture Notes in Computer Science, pages 3--12, Umeå, Sweden, August 2015. Springer-Verlag.
doi: 10.1007/978-3-319-22360-5_1.
[ BibTex | DOI | Web page | PDF ]
[BBD⁺15]: P. Ballarini, B. Barbot, M. Duflot, S. Haddad, and N. Pekergin. HASL: A New Approach for Performance Evaluation and Model Checking from Concepts to Experimentation. Performance Evaluation, 90:53--77, August 2015.
doi: 10.1016/j.peva.2015.04.003.
[ BibTex | DOI | Web page | PDF ]
[HPRV15]: S. Haar, S. Perchy, C. Rueda, and F. Valencia. An Algebraic View of SpaceashBelief and ExtrusionashUtterance for ConcurrencyashEpistemic Logic. In Proceedings of the 17th International Conference on Principles and Practice of Declarative Programming (PPDP'15), pages 161--172, Siena, Italy, July 2015. ACM Press.
doi: 10.1007/978-3-319-19488-2_6.
[ BibTex | DOI | Web page | PDF ]
[APS15]: K. Athanasiou, H. Ponce de León, and S. Schwoon. Test Case Generation for Concurrent Systems Using Event Structures. In Proceedings of the 9th International Conference on Tests and Proofs (TAP'15), volume 9154 of Lecture Notes in Computer Science, pages 19--37, L'Aquila, Italy, July 2015. Springer.
doi: 10.1007/978-3-319-21215-9_2.
[ BibTex | DOI | Web page | PDF ]
[Bol15b]: B. Bollig. Automata and Logics for Concurrent Systems: Realizability and Verification. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, June 2015.
[ BibTex | Web page | PDF ]
[BHHP15]: B. Barbot, S. Haddad, M. Heiner, and C. Picaronny. Rare Event Handling in Signalling Cascades. International Journal on Advances in Systems and Measurements, 8(1-2):69--79, June 2015.
[ BibTex | Web page | PDF ]
[ACR15]: É. André, Th. Chatain, and C. Rodríguez. Preserving Partial Order Runs in Parametric Time Petri Nets. In Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD'15), pages 120--129, Brussels, Belgium, June 2015. IEEE Computer Society Press.
doi: 10.1109/ACSD.2015.16.
[ BibTex | DOI | Web page | PDF ]
[CHKS15]: Th. Chatain, S. Haar, M. Koutny, and S. Schwoon. Non-Atomic Transition Firing in Contextual Nets. In Proceedings of the 36th International Conference on Applications and Theory of Petri Nets (PETRI NETS'15), volume 9115 of Lecture Notes in Computer Science, pages 117--136, Brussels, Belgium, June 2015. Springer.
doi: 10.1007/978-3-319-19488-2_6.
[ BibTex | DOI | Web page | PDF ]
[HM15]: S. Haar and R. Meyer, editors. Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD'15), Brussels, Belgium, June 2015. IEEE Computer Society Press.
[ BibTex | Web page ]
[KDH15]: M. Koutny, J. Desel, and S. Haddad, editors. Transactions on Petri Nets and Other Models of Concurrency X, volume 9410 of Lecture Notes in Computer Science. Springer, 2015.
[ BibTex | Web page ]
[MLB⁺15a]: A. Methni, M. Lemerre, B. Ben Hedia, S. Haddad, and K. Barkaoui. Specifying and Verifying Concurrent C Programs with TLA+. In Proceedings of the 3rd International Workshop on Formal Techniques for Safety-Critical Systems, Nov. 2014 (FTSCS'14), volume 476 of Communications in Computer and Information Science, pages 206--222, Luxembourg, 2015. Springer.
doi: 10.1007/978-3-319-17581-2_14.
[ BibTex | DOI | Web page | PDF ]
[FH15]: E. Fraca and S. Haddad. Complexity Analysis of Continuous Petri Nets. Fundamenta Informaticae, 137(1):1--28, 2015.
doi: 10.3233/FI-2015-1168.
[ BibTex | DOI | Web page | PDF ]
[BH15]: N. Bertrand and S. Haddad. Contrôle, probabilités et observation partielle. In Informatique Mathématique. Une photographie en 2015, chapter 5, pages 177--227. CNRS Éditions, 2015.
[ BibTex | Web page | PDF ]
[BFCH14]: M. Beccuti, G. Franceschinis, D. Codetta-Raiteri, and S. Haddad. Computing Optimal Repair Strategies by Means of NdRFT Modeling and Analysis. The Computer Journal, 57(12):1870--1892, December 2014.
doi: 10.1093/comjnl/bxt134.
[ BibTex | DOI | Web page | PDF ]
[BHLM14]: B. Bollig, P. Habermehl, M. Leucker, and B. Monmege. A Robust Class of Data Languages and an Application to Learning. Logical Methods in Computer Science, 10(4:19), December 2014.
doi: 10.2168/LMCS-10(4:19)2014.
[ BibTex | DOI | Web page | PDF ]
[AG14]: C. Aiswarya and P. Gastin. Reasoning about distributed systems: WYSIWYG. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 11--30, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.11.
[ BibTex | DOI | Web page | PDF ]
[BHL14]: N. Bertrand, S. Haddad, and E. Lefaucheux. Foundation of Diagnosis and Predictability in Probabilistic Systems. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 417--429, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.417.
[ BibTex | DOI | Web page | PDF ]
[BGK14]: B. Bollig, P. Gastin, and A. Kumar. Parameterized Communicating Automata: Complementation and Model Checking. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 625--637, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.625.
[ BibTex | DOI | Web page | PDF ]
[CMS14]: R. Chadha, U. Mathur, and S. Schwoon. Computing Information Flow Using Symbolic Model-Checking. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), volume 29 of Leibniz International Proceedings in Informatics, pages 505--516, New Dehli, India, December 2014. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2014.505.
[ BibTex | DOI | Web page | PDF ]
[BCGZ14]: B. Bollig, A. Cyriac, P. Gastin, and M. Zeitoun. Temporal logics for concurrent recursive programs: Satisfiability and model checking. Journal of Applied Logic, 12(4):395--416, December 2014.
doi: 10.1016/j.jal.2014.05.001.
[ BibTex | DOI | Web page | PDF ]
[Pon14]: H. Ponce de León. Testing Concurrent Systems Through Event Structures. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2014.
[ BibTex | Web page | PDF ]
[Bar14]: B. Barbot. Acceleration for Statistical Model Checking. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2014.
[ BibTex | Web page | PDF ]
[CHJ⁺14]: Th. Chatain, S. Haar, L. Jezequel, L. Paulevé, and S. Schwoon. Characterization of Reachable Attractors Using Petri Net Unfoldings. In Proceedings of the 12th Conference on Computational Methods in System Biology (CMSB'14), volume 8859 of Lecture Notes in Bioinformatics, pages 129--142, Manchester, UK, November 2014. Springer-Verlag.
doi: 10.1007/978-3-319-12982-2_10.
[ BibTex | DOI | Web page | PDF ]
[PHL14b]: H. Ponce de León, S. Haar, and D. Longuet. Model-Based Testing for Concurrent Systems with Labeled Event Structures. Software Testing, Verification and Reliability, 24(7):558--590, November 2014.
doi: 10.1002/stvr.1543.
[ BibTex | DOI | Web page | PDF ]
[AGNK14]: C. Aiswarya, P. Gastin, and K. Narayan Kumar. Verifying Communicating Multi-pushdown Systems via Split-width. In Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA'14), volume 8837 of Lecture Notes in Computer Science, pages 1--17, Sydney, Australia, November 2014. Springer.
doi: 10.1007/978-3-319-11936-6_1.
[ BibTex | DOI | Web page | PDF ]
[BHHP14]: B. Barbot, S. Haddad, M. Heiner, and C. Picaronny. Rare Event Handling in Signalling Cascades. In Proceedings of the 6th International Conference on Advances in System Simulation (SIMUL'14), pages 126--131, Nice, France, October 2014. XPS.
[ BibTex | Web page | PDF ]
[BGS14]: B. Bollig, P. Gastin, and J. Schubert. Parameterized Verification of Communicating Automata under Context Bounds. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 45--57, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_4.
[ BibTex | DOI | Web page | PDF ]
[HM14]: S. Haddad and B. Monmege. Reachability in MDPs: Refining Convergence of Value Iteration. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), volume 8762 of Lecture Notes in Computer Science, pages 125--137, Oxford, UK, September 2014. Springer.
doi: 10.1007/978-3-319-11439-2_10.
[ BibTex | DOI | Web page | PDF ]
[BMP14]: L. Brandán Briones, A. Madalinski, and H. Ponce de León. Distributed Diagnosability Analysis with Petri Nets. In Proceedings of the 25th International Workshop on Principles of Diagnosis (DX'14), Graz, Austria, September 2014.
[ BibTex | Web page | PDF ]
[CGNK14]: A. Cyriac, P. Gastin, and K. Narayan Kumar. Controllers for the Verification of Communicating Multi-Pushdown Systems. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), volume 8704 of Lecture Notes in Computer Science, pages 297--311, Rome, Italy, September 2014. Springer.
doi: 10.1007/978-3-662-44584-6_21.
[ BibTex | DOI | Web page | PDF ]
[PHL14a]: H. Ponce de León, S. Haar, and D. Longuet. Distributed testing of concurrent systems: vector clocks to the rescue. In Proceedings of the 11th International Colloquium on Theoretical Aspects of Computing (ICTAC'14), volume 8687 of Lecture Notes in Computer Science, pages 369--387, Bucharest, Romania, September 2014. Springer.
doi: 10.1007/978-3-319-10882-7_22.
[ BibTex | DOI | Web page | PDF ]
[BGMZ14a]: B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Logical Characterization of Weighted Pebble Walking Automata. 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, July 2014. ACM Press.
doi: 10.1145/2603088.2603118.
[ BibTex | DOI | Web page | PDF ]
[Bol14]: B. 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, July 2014. ACM Press.
doi: 10.1145/2603088.2603093.
[ BibTex | DOI | Web page | PDF ]
[KH14]: F. Kordon and F. Hulin-Hubard. BenchKit, a Tool for Massive Concurrent Benchmarking. In Proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD'14), pages 159--165, Tunis, Tunisia, June 2014. IEEE Computer Society Press.
doi: 10.1109/ACSD.2014.12.
[ BibTex | DOI | Web page | PDF ]
[GHKS14]: V. Germanos, S. Haar, V. Khomenko, and S. Schwoon. Diagnosability under Weak Fairness. In Proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD'14), pages 132--141, Tunis, Tunisia, June 2014. IEEE Computer Society Press.
doi: 10.1109/ACSD.2014.9.
[ BibTex | DOI | Web page | PDF ]
[GM14]: P. Gastin and B. Monmege. Adding Pebbles to Weighted Automata -- Easy Specification & Efficient Evaluation. Theoretical Computer Science, 534:24--44, May 2014.
doi: 10.1016/j.tcs.2014.02.034.
[ BibTex | DOI | Web page | PDF ]
[BFH⁺14]: N. Bertrand, É. Fabre, S. Haar, S. Haddad, and L. Hélouët. Active diagnosis for probabilistic systems. In Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'14), volume 8412 of Lecture Notes in Computer Science, pages 29--42, Grenoble, France, April 2014. Springer.
doi: 10.1007/978-3-642-54830-7_4.
[ BibTex | DOI | Web page | PDF ]
[ABG⁺14]: S. Akshay, B. Bollig, P. Gastin, M. Mukund, and K. Narayan Kumar. Distributed Timed Automata with Independently Evolving Clocks. Fundamenta Informaticae, 130(4):377--407, April 2014.
doi: 10.3233/FI-2014-996.
[ BibTex | DOI | Web page | PDF ]
[BGMZ14b]: B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Pebble Weighted Automata and Weighted Logics. ACM Transactions on Computational Logic, 15(2:15), April 2014.
doi: 10.1145/2579819.
[ BibTex | DOI | Web page | PDF ]
[HHM14]: S. Haddad, R. Hennicker, and M. H. Møller. Specification of Asynchronous Component Systems with Modal IashO-Petri Nets. In Revised Selected Papers of the 8th Symposium on Trustworthy Global Computing (TGC'13), volume 8358 of Lecture Notes in Computer Science, pages 219--234, Buenos Aires, Argentina, March 2014. Springer.
doi: 10.1007/978-3-319-05119-2_13.
[ BibTex | DOI | Web page | PDF ]
[BFHP14]: L. Bernardinello, C. Ferigato, S. Haar, and L. Pomello. Closed Sets in Occurrence Nets with Conflicts. Fundamenta Informaticae, 133(4):323--344, 2014.
doi: 10.3233/FI-2014-1079.
[ BibTex | DOI | Web page | PDF ]
[KHY14]: M. Koutny, S. Haddad, and A. Yakovlev, editors. Transactions on Petri Nets and Other Models of Concurrency IX, volume 8910 of Lecture Notes in Computer Science. Springer, 2014.
[ BibTex | Web page ]
[CH14]: Th. Chatain and S. Haar. A Canonical Contraction for Safe Petri Nets. In Transactions on Petri Nets and Other Models of Concurrency IX, volume 8910 of Lecture Notes in Computer Science, pages 83--98. Springer, 2014.
doi: 10.1007/978-3-662-45730-6_5.
[ BibTex | DOI | Web page | PDF ]
[Cyr14]: A. Cyriac. Verification of Communicating Recursive Programs via Split-width. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2014.
[ BibTex | Web page | PDF ]
[Cha13]: Th. Chatain. Concurrency in Real-Time Distributed Systems, from Unfoldings to Implementability. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, December 2013.
[ BibTex | Web page | PDF ]
[Rod13]: C. Rodríguez. Verification Based on Unfoldings of Petri Nets with Read Arcs. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2013.
[ BibTex | Web page | PDF ]
[Sch13]: S. Schwoon. Efficient verification of sequential and concurrent systems. Mémoire d'habilitation, École Normale Supérieure de Cachan, France, December 2013.
[ BibTex | Web page | PDF ]
[HHMS13]: S. Haar, S. Haddad, T. Melliti, and S. Schwoon. Optimal Constructions for Active Diagnosis. In Proceedings of the 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), volume 24 of Leibniz International Proceedings in Informatics, pages 527--539, Guwahati, India, December 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2013.527.
[ BibTex | DOI | Web page | PDF ]
[EJS13]: J. Esparza, L. Jezequel, and S. Schwoon. Computation of summaries using net unfoldings. In Proceedings of the 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), volume 24 of Leibniz International Proceedings in Informatics, pages 225--236, Guwahati, India, December 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2013.225.
[ BibTex | DOI | Web page | PDF ]
[BC13]: S. Balaguer and Th. Chatain. Avoiding Shared Clocks in Networks of Timed Automata. Logical Methods in Computer Science, 9(4:13), November 2013.
doi: 10.2168/LMCS-9(4:13)2013.
[ BibTex | DOI | Web page | PDF ]
[PHL13]: H. Ponce de León, S. Haar, and D. Longuet. Unfolding-based Test Selection for Concurrent Conformance. In Proceedings of the 25th IFIP International Conference on Testing Software and Systems (ICTSS'13), Lecture Notes in Computer Science, pages 98--113, Istanbul, Turkey, November 2013. Springer.
doi: 10.1007/978-3-642-41707-8_7.
[ BibTex | DOI | Web page | PDF ]
[CFM13]: M. Cadilhac, A. Finkel, and P. McKenzie. Unambiguous Contrained Automata. International Journal of Foundations of Computer Science, 24(7):1099--1116, November 2013.
doi: 10.1142/S0129054113400339.
[ BibTex | DOI | Web page | PDF ]
[Mon13]: B. Monmege. Spécification et vérification de propriétés quantitatives : expressions, logiques, et automates. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2013.
[ BibTex | Web page | PDF ]
[PBB13]: H. Ponce de León, G. Bonigo, and L. Brandán Briones. Distributed Analysis of Diagnosability in Concurrent Systems. In Proceedings of the 24th International Workshop on Principles of Diagnosis (DX'13), Jerusalem, Israel, October 2013.
[ BibTex | Web page | PDF ]
[ABD⁺13]: É. André, B. Barbot, C. Démoulins, L. M. Hillah, F. Hulin-Hubard, F. Kordon, A. Linard, and L. Petrucci. A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems. In Proceedings of the 15th International Conference on Formal Engineering Methods (ICFEM'13), Lecture Notes in Computer Science, pages 199--214, Queenstown, New Zealand, October-November 2013. Springer.
doi: 10.1007/978-3-642-41202-8_14.
[ BibTex | DOI | Web page | PDF ]
[RS13a]: C. Rodríguez and S. Schwoon. Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 492--495, Hanoi, Vietnam, October 2013. Springer.
doi: 10.1007/978-3-319-02444-8_42.
[ BibTex | DOI | Web page | PDF ]
[ABHH13]: S. Akshay, N. Bertrand, S. Haddad, and L. Hélouët. The steady-state control problem for Markov decision processes. In Proceedings of the 10th International Conference on Quantitative Evaluation of Systems (QEST'13), pages 290--304, Buenos Aires, Argentina, August 2013. IEEE Computer Society Press.
doi: 10.1007/978-3-642-40196-1_26.
[ BibTex | DOI | Web page | PDF ]
[CJ13]: Th. Chatain and C. Jard. Back in Time Petri Nets. In Proceedings of the 11th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'13), volume 8053 of Lecture Notes in Computer Science, pages 91--105, Buenos Aires, Argentina, August 2013. Springer.
doi: 10.1007/978-3-642-40229-6_7.
[ BibTex | DOI | Web page | PDF ]
[RS13b]: C. Rodríguez and S. Schwoon. An Improved Construction of Petri Net Unfoldings. In Proceedings of the 1st French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13), volume 31 of Open Access Series in Informatics, pages 47--52, Singapore, July 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.FSFMA.2013.47.
[ BibTex | DOI | Web page | PDF ]
[HMY13]: S. Haddad, L. Mokdad, and S. Youcef. Bounding models families for performance evaluation in composite Web services. Journal of Computational Science, 4(4):232--241, July 2013.
doi: 10.1016/j.jocs.2011.11.003.
[ BibTex | DOI | Web page | PDF ]
[AHH⁺13]: É. André, L. M. Hillah, F. Hulin-Hubard, F. Kordon, Y. Lembachar, A. Linard, and L. Petrucci. CosyVerif: An Open Source Extensible Verification Environment. In Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'13), pages 33--36, Singapore, July 2013. IEEE Computer Society Press.
doi: 10.1109/ICECCS.2013.15.
[ BibTex | DOI | Web page | PDF ]
[HRS13]: S. Haar, C. Rodríguez, and 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), pages 120--129, Barcelona, Spain, July 2013. IEEE Computer Society Press.
doi: 10.1109/ACSD.2013.15.
[ BibTex | DOI | Web page | PDF ]
[HKS13]: S. Haar, C. Kern, and S. Schwoon. Computing the Reveals Relation in Occurrence Nets. Theoretical Computer Science, 493:66--79, July 2013.
doi: 10.1016/j.tcs.2013.04.028.
[ BibTex | DOI | Web page | PDF ]
[ABG13]: S. Akshay, B. Bollig, and P. Gastin. Event-clock Message Passing Automata: A Logical Characterization and an Emptiness-Checking Algorithm. Formal Methods in System Design, 42(3):262--300, June 2013.
doi: 10.1007/s10703-012-0179-8.
[ BibTex | DOI | Web page | PDF ]
[GS13]: P. Gastin and N. Sznajder. Fair Synthesis for Asynchronous Distributed Systems. ACM Transactions on Computational Logic, 14(2:9), June 2013.
doi: 10.1145/2480759.2480761.
[ BibTex | DOI | Web page | PDF ]
[CH13]: Th. Chatain and S. Haar. A Canonical Contraction for Safe Petri Nets. In Proceedings of the 7th International Workshop on Petri Nets and Software Engineering (PNSE'13), volume 969 of CEUR Workshop Proceedings, pages 25--39, Milano, Italy, June 2013. RWTH Aachen, Germany.
[ BibTex | Web page | PDF ]
[BKM13]: B. Bollig, D. Kuske, and R. Mennicke. The Complexity of Model Checking Multi-Stack Systems. In Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), pages 163--170, New-Orleans, Louisiana, USA, June 2013. IEEE Computer Society Press.
doi: 10.1109/LICS.2013.22.
[ BibTex | DOI | Web page | PDF ]
[BHLM13]: B. Bollig, P. Habermehl, M. Leucker, and B. Monmege. A Fresh Approach to Learning Register Automata. In Proceedings of the 17th International Conference on Developments in Language Theory (DLT'13), volume 7907 of Lecture Notes in Computer Science, pages 118--130, Marne-la-Vallée, France, June 2013. Springer.
doi: 10.1007/978-3-642-38771-5_12.
[ BibTex | DOI | Web page | PDF ]
[RSK13]: C. Rodríguez, S. Schwoon, and V. Khomenko. Contextual Merged Processes. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 29--48, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_3.
[ BibTex | DOI | Web page | PDF ]
[FH13]: E. Fraca and S. Haddad. Complexity Analysis of Continuous Petri Nets. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 170--189, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_10.
[ BibTex | DOI | Web page | PDF ]
[HHM13]: S. Haddad, R. Hennicker, and M. H. Møller. Channel Properties of Asynchronously Composed Petri Nets. In Proceedings of the 34th International Conference on Applications and Theory of Petri Nets (PETRI NETS'13), volume 7927 of Lecture Notes in Computer Science, pages 369--388, Milano, Italy, June 2013. Springer.
doi: 10.1007/978-3-642-38697-8_20.
[ BibTex | DOI | Web page | PDF ]
[BCH13a]: S. Balaguer, Th. Chatain, and S. Haar. Building Occurrence Nets from Reveals Relations. Fundamenta Informaticae, 123(3):245--272, May 2013.
doi: 10.3233/FI-2013-809.
[ BibTex | DOI | Web page | PDF ]
[ABB⁺13]: E. G. Amparore, B. Barbot, M. Beccuti, S. Donatelli, and G. Franceschinis. Simulation-based Verification of Hybrid Automata Stochastic Logic Formulas for Stochastic Symmetric Nets. In Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation (PADS'13), pages 253--264, Montreal, Canada, May 2013. ACM Press.
doi: 10.1145/2486092.2486124.
[ BibTex | DOI | Web page | PDF ]
[BCH⁺13c]: B. Bollig, A. Cyriac, L. Hélouët, A. Kara, and Th. Schwentick. Dynamic Communicating Automata and Branching High-Level MSCs. In Proceedings of the 7th International Conference on Language and Automata Theory and Applications (LATA'13), volume 7810 of Lecture Notes in Computer Science, pages 177--189, Bilbao, Spain, April 2013. Springer.
doi: 10.1109/REVET.2012.6195253.
[ BibTex | DOI | Web page | PDF ]
[BFHR13]: R. Bonnet, A. Finkel, S. Haddad, and F. Rosa-Velardo. Ordinal Theory for Expressiveness of Well-Structured Transition Systems. Information and Computation, 224:1--22, March 2013.
doi: 10.1016/j.ic.2012.11.003.
[ BibTex | DOI | Web page | PDF ]
[BGM13]: B. Bollig, P. Gastin, and B. Monmege. Weighted Specifications over Nested Words. In Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), volume 7794 of Lecture Notes in Computer Science, pages 385--400, Rome, Italy, March 2013. Springer.
doi: 10.1007/978-3-642-37075-5_25.
[ BibTex | DOI | Web page | PDF ]
[BCH⁺13b]: B. Bérard, F. Cassez, S. Haddad, D. Lime, and O. H. Roux. The Expressive Power of Time Petri Nets. Theoretical Computer Science, 474:1--20, February 2013.
doi: 10.1016/j.tcs.2012.12.005.
[ BibTex | DOI | Web page | PDF ]
[HM13]: S. Haar and T. Masopust. Languages, Decidability, and Complexity. In Control of Discrete-Event Systems -- Automata and Petri Net Perspectives, volume 433 of Lecture Notes in Control and Information Sciences, pages 23--43. Springer, 2013.
doi: 10.1007/978-1-4471-4276-8_2.
[ BibTex | DOI | Web page | PDF ]
[HF13]: S. Haar and É. Fabre. Diagnosis with Petri Net Unfoldings. In Control of Discrete-Event Systems -- Automata and Petri Net Perspectives, volume 433 of Lecture Notes in Control and Information Sciences, pages 301--318. Springer, 2013.
doi: 10.1007/978-1-4471-4276-8_15.
[ BibTex | DOI | Web page | PDF ]
[BFH⁺13]: P. Bouyer, S. Faucou, S. Haar, A. Jovanivić, D. Lime, N. Markey, O. H. Roux, and O. Sankur. Control tasks for Timed System; Robustness issues. Deliverable ImpRo 5.1, (ANR-10-BLAN-0317), January 2013. 34 pages.
[ BibTex | Web page | PDF ]
[HMN13]: S. Haddad, J. Mairesse, and H.-T. Nguyen. Synthesis and Analysis of Product-form Petri Nets. Fundamenta Informaticae, 122(1-2):147--172, 2013.
doi: 10.3233/FI-2013-786.
[ BibTex | DOI | Web page | PDF ]
[Haa12]: S. Haar. What topology tells us about diagnosability in partial order semantics. Discrete Event Dynamic Systems: Theory and Applications, 22(4):383--402, December 2012.
doi: 10.1007/s10626-011-0121-z.
[ BibTex | DOI | Web page | PDF ]
[Bal12]: S. Balaguer. La concurrence dans les systèmes distribués temps-réel. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012.
[ BibTex | Web page | PDF ]
[GS12]: P. Gastin and N. Sznajder. Decidability of well-connectedness for distributed synthesis. Information Processing Letters, 112(24):963--968, December 2012.
doi: 10.1016/j.ipl.2012.08.018.
[ BibTex | DOI | Web page | PDF ]
[BDF12]: A. Bušić, H. Djafri, and J.-M. Fourneau. Bounded state space truncation and censored Markov chains. In Proceedings of the 51st IEEE Conference on Decision and Control (CDC'12), pages 5828--5833, Maui, Hawaii, USA, December 2012. IEEE Control System Society.
doi: 10.1109/CDC.2012.6426156.
[ BibTex | DOI | Web page | PDF ]
[BHP12b]: B. Barbot, S. Haddad, and 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), pages 30--35, Lisbon, Portugal, November 2012. XPS.
[ BibTex | Web page | PDF ]
[BGMZ12]: B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. A Probabilistic Kleene Theorem. In Proceedings of the 10th International Symposium on Automated Technology for Verification and Analysis (ATVA'12), volume 7561 of Lecture Notes in Computer Science, pages 400--415, Thiruvananthapuram, India, October 2012. Springer.
doi: 10.1007/978-3-642-33386-6_31.
[ BibTex | DOI | Web page | PDF ]
[RS12]: C. Rodríguez and S. Schwoon. Verification of Petri Nets with Read Arcs. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 471--485, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_33.
[ BibTex | DOI | Web page | PDF ]
[CGNK12]: A. Cyriac, P. Gastin, and K. Narayan Kumar. MSO Decidability of Multi-Pushdown Systems via Split-Width. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 547--561, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_38.
[ BibTex | DOI | Web page | PDF ]
[BHSS12]: B. Bérard, S. Haddad, M. Sassolas, and N. Sznajder. Concurrent Games on VASS with Inhibition. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 39--52, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_5.
[ BibTex | DOI | Web page | PDF ]
[BC12]: S. Balaguer and Th. Chatain. Avoiding Shared Clocks in Networks of Timed Automata. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), volume 7454 of Lecture Notes in Computer Science, pages 100--114, Newcastle, UK, September 2012. Springer.
doi: 10.1007/978-3-642-32940-1_9.
[ BibTex | DOI | Web page | PDF ]
[BBC⁺12]: P. Baldan, A. Bruni, A. Corradini, B. König, C. Rodríguez, and S. Schwoon. Efficient unfolding of contextual Petri nets. Theoretical Computer Science, 449(1):2--22, August 2012.
doi: 10.1016/j.tcs.2012.04.046.
[ BibTex | DOI | Web page | PDF ]
[AMH12]: A. Agarwal, A. Madalinski, and 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, August 2012. IFAC.
doi: 10.3182/20120829-3-MX-2028.00083.
[ BibTex | DOI | Web page | PDF ]
[DG12]: S. Demri and P. Gastin. Specification and Verification using Temporal Logics. In Modern applications of automata theory, volume 2 of IISc Research Monographs, chapter 15, pages 457--494. World Scientific, July 2012.
[ BibTex | Web page | PDF ]
[GM12]: P. Gastin and B. Monmege. Adding Pebbles to Weighted Automata. In Proceedings of the 17th International Conference on Implementation and Application of Automata (CIAA'12), volume 7381 of Lecture Notes in Computer Science, pages 28--51, Porto, Portugal, July 2012. Springer-Verlag.
doi: 10.1007/978-3-642-31606-7_4.
[ BibTex | DOI | Web page | PDF ]
[BDL12]: B. Bollig, N. Decker, and M. Leucker. Frequency Linear-time Temporal Logic. In Proceedings of the 6th International Symposium on Theoretical Aspects of Software Engineering (TASE'12), pages 85--92, Beijing, China, July 2012. IEEE Computer Society Press.
doi: 10.1109/TASE.2012.43.
[ BibTex | DOI | Web page | PDF ]
[HP12]: S. Haddad and L. Pomello, editors. Proceedings of the 33rd International Conference on Applications and Theory of Petri Nets (ICATPN'12), volume 7347 of Lecture Notes in Computer Science, Hamburg, Germany, June 2012. Springer.
doi: 10.1007/978-3-642-31131-4.
[ BibTex | DOI | Web page ]
[Dja12]: H. Djafri. Approches numériques et statistiques pour le model checking des processus stochastiques. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2012.
[ BibTex | Web page | PDF ]
[HSS12]: S. Haddad, S. Schmitz, and 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), pages 355--364, Dubrovnik, Croatia, June 2012. IEEE Computer Society Press.
doi: 10.1109/LICS.2012.46.
[ BibTex | DOI | Web page | PDF ]
[BCH12a]: S. Balaguer, Th. Chatain, and S. Haar. A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata. Formal Methods in System Design, 40(3):330--355, June 2012.
doi: 10.1007/s10703-012-0146-4.
[ BibTex | DOI | Web page | PDF ]
[BK12]: B. Bollig and D. Kuske. An optimal construction of Hanf sentences. Journal of Applied Logic, 10(2):179--186, June 2012.
doi: 10.1016/j.jal.2012.01.002.
[ BibTex | DOI | Web page | PDF ]
[PHL12]: H. Ponce de León, S. Haar, and D. Longuet. Conformance Relations for Labeled Event Structures. In Proceedings of the 6th International Conference on Tests and Proofs (TAP'12), volume 7305 of Lecture Notes in Computer Science, pages 83--98, Prague, Czech Republic, May-June 2012. Springer.
doi: 10.1007/978-3-642-30473-6_8.
[ BibTex | DOI | Web page | PDF ]
[GMM12]: P. Ganty, R. Majumdar, and B. Monmege. Bounded underapproximations. Formal Methods in System Design, 40(2):206--231, April 2012.
doi: 10.1007/s10703-011-0136-y.
[ BibTex | DOI | Web page | PDF ]
[BHP12a]: B. Barbot, S. Haddad, and 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), volume 7214 of Lecture Notes in Computer Science, pages 331--346, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28756-5_23.
[ BibTex | DOI | Web page | PDF ]
[BCGNK12]: B. Bollig, A. Cyriac, P. Gastin, and 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), volume 7213 of Lecture Notes in Computer Science, pages 391--405, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28729-9_26.
[ BibTex | DOI | Web page | PDF ]
[BCH12b]: S. Balaguer, Th. Chatain, and S. Haar. Concurrent semantics for timed distributed systems. Deliverable ImpRo D 4.1 (ANR-2010-BLAN-0317), March 2012.
[ BibTex | Web page | PDF ]
[BHS12]: B. Bérard, S. Haddad, and M. Sassolas. Interrupt Timed Automata: Verification and Expressiveness. Formal Methods in System Design, 40(1):41--87, February 2012.
doi: 10.1007/s10703-011-0140-2.
[ BibTex | DOI | Web page | PDF ]
[ABB⁺12]: S. Akshay, B. Bérard, P. Bouyer, S. Haar, S. Haddad, C. Jard, D. Lime, N. Markey, P.-A. Reynier, O. Sankur, and Y. Thierry-Mieg. Overview of Robustness in Timed Systems. Deliverable ImpRo D 2.1 (ANR-2010-BLAN-0317), January 2012.
[ BibTex | Web page | PDF ]
[EHH12]: D. El Hog-Benzina, S. Haddad, and R. Hennicker. Refinement and Asynchronous Composition of Modal Petri Nets. In Transactions on Petri Nets and Other Models of Concurrency V, volume 6900 of Lecture Notes in Computer Science, pages 96--120. Springer, 2012.
doi: 10.1007/978-3-642-29072-5_4.
[ BibTex | DOI | Web page | PDF ]
[BHP11]: B. Barbot, S. Haddad, and C. Picaronny. Échantillonnage préférentiel pour le model checking statistique. In Actes du 8ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'11), volume 45 of Journal Européen des Systèmes Automatisés, pages 237--252, Lille, France, November 2011. Hermès.
doi: 10.3166/jesa.45.237-252.
[ BibTex | DOI | Web page | PDF ]
[BDD⁺11a]: P. Ballarini, H. Djafri, M. Duflot, S. Haddad, and N. Pekergin. COSMOS: a Statistical Model Checker for the Hybrid Automata Stochastic Logic. In Proceedings of the 8th International Conference on Quantitative Evaluation of Systems (QEST'11), pages 143--144, Aachen, Germany, September 2011. IEEE Computer Society Press.
doi: 10.1109/QEST.2011.24.
[ BibTex | DOI | Web page | PDF ]
[BFH11]: M. Beccuti, G. Franceschinis, and S. Haddad. MDWNsolver: A Framework to Design and Solve Markov Decision Petri Nets. International Journal of Performability Engineering, 7(5):417--428, September 2011.
[ BibTex | Web page | PDF ]
[Bol11]: B. Bollig. An automaton over data words that captures EMSO logic. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), volume 6901 of Lecture Notes in Computer Science, pages 171--186, Aachen, Germany, September 2011. Springer.
doi: 10.1007/978-3-642-23217-6_12.
[ BibTex | DOI | Web page | PDF ]
[RSB11]: C. Rodríguez, S. Schwoon, and P. Baldan. Efficient contextual unfolding. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), volume 6901 of Lecture Notes in Computer Science, pages 342--357, Aachen, Germany, September 2011. Springer.
doi: 10.1007/978-3-642-23217-6_23.
[ BibTex | DOI | Web page | PDF ]
[BCGZ11]: B. Bollig, A. Cyriac, P. Gastin, and M. Zeitoun. Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), volume 6907 of Lecture Notes in Computer Science, pages 132--144, Warsaw, Poland, August 2011. Springer.
doi: 10.1007/978-3-642-22993-0_15.
[ BibTex | DOI | Web page | PDF ]
[BDD⁺11c]: P. Ballarini, H. Djafri, M. Duflot, S. Haddad, and N. Pekergin. Petri Nets Compositional Modeling and Verification of Flexible Manufacturing Systems. In Proceedings of the 7th IEEE Conference on Automation Science and Engineering (CASE'11), pages 588--593, Trieste, Italy, August 2011. IEEE Robotics & Automation Society.
doi: 10.1109/CASE.2011.6042488.
[ BibTex | DOI | Web page | PDF ]
[SR11]: S. Schwoon and C. Rodríguez. Construction and SAT-based verification of Contextual Unfoldings. In Proceedings of the 13th International Workshop on Descriptional Complexity of Formal Systems (DCFS'11), volume 6808 of Lecture Notes in Computer Science, pages 34--42, Limburg, Germany, July 2011. Springer.
doi: 10.1007/978-3-642-22600-7_3.
[ BibTex | DOI | Web page | PDF ]
[HKS11]: S. Haar, C. Kern, and S. Schwoon. Computing the Reveals Relation in Occurrence Nets. In Proceedings of the 2nd International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'11), volume 54 of Electronic Proceedings in Theoretical Computer Science, pages 31--44, Minori, Italy, June 2011.
doi: 10.4204/EPTCS.54.3.
[ BibTex | DOI | Web page | PDF ]
[BCH11]: S. Balaguer, Th. Chatain, and S. Haar. Building Tight Occurrence Nets from Reveals Relations. In Proceedings of the 11th International Conference on Application of Concurrency to System Design (ACSD'11), pages 44--53, Newcastle upon Tyne, UK, June 2011. IEEE Computer Society Press.
doi: 10.1109/ACSD.2011.16.
[ BibTex | DOI | Web page | PDF ]
[HMN11]: S. Haddad, J. Mairesse, and H.-T. Nguyen. Synthesis and Analysis of Product-form Petri Nets. In Proceedings of the 32nd International Conference on Applications and Theory of Petri Nets (PETRI NETS'11), volume 6709 of Lecture Notes in Computer Science, pages 288--307, Newcastle upon Tyne, UK, June 2011. Springer.
doi: 10.1007/978-3-642-21834-7_16.
[ BibTex | DOI | Web page | PDF ]
[BDD⁺11b]: P. Ballarini, H. Djafri, M. Duflot, S. Haddad, and N. Pekergin. HASL: An Expressive Language for Statistical Verification of Stochastic Models. In Proceedings of the 5th International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS'11), pages 306--315, Cachan, France, May 2011.
[ BibTex | Web page | PDF ]
[BGMZ11]: B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun. Weighted Expressions and DFS Tree Automata. Research Report LSV-11-08, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2011. 32 pages.
[ BibTex | Web page | PDF ]
[BFHR11]: R. Bonnet, A. Finkel, S. Haddad, and F. Rosa-Velardo. Ordinal Theory for Expressiveness of Well Structured Transition Systems. In Proceedings of the 14th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'11), volume 6604 of Lecture Notes in Computer Science, pages 153--167, Saarbrücken, Germany, March-April 2011. Springer.
doi: 10.1007/978-3-642-19805-2_11.
[ BibTex | DOI | Web page | PDF ]
[BBD⁺11]: S. Baarir, M. Beccuti, C. Dutheillet, G. Franceschinis, and S. Haddad. Lumping partially symmetrical stochastic models. Performance Evaluation, 76:21--44, January 2011.
doi: 10.1016/j.peva.2010.09.002.
[ BibTex | DOI | Web page | PDF ]
[Had11]: S. Haddad. Introduction to Verification. In Models and Analysis in Distributed Systems, chapter 6, pages 137--154. John Wiley & Sons, Ltd., 2011.
[ BibTex ]
[HKPP11a]: S. Haddad, F. Kordon, L. Pautet, and L. Petrucci, editors. Distributed Systems Design and Algorithms. John Wiley & Sons, Ltd., 2011.
[ BibTex | Web page ]
[HKPP11b]: S. Haddad, F. Kordon, L. Pautet, and L. Petrucci, editors. Models and Analysis in Distributed Systems. John Wiley & Sons, Ltd., 2011.
[ BibTex | Web page ]
[LAL10]: D. Longuet, M. Aiguier, and P. Le Gall. Proof-guided test selection from first-order specifications with equality. Journal of Automated Reasoning, 45(4):437--473, December 2010.
doi: 10.1007/s10817-009-9128-7.
[ BibTex | DOI | Web page | PS | PDF ]
[BFHR10]: R. Bonnet, A. Finkel, S. Haddad, and F. Rosa-Velardo. Comparing Petri Data Nets and Timed Petri Nets. Research Report LSV-10-23, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2010. 16 pages.
[ BibTex | Web page | PDF ]
[AGMNK10]: S. Akshay, P. Gastin, M. Mukund, and 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), volume 8 of Leibniz International Proceedings in Informatics, pages 204--215, Chennai, India, December 2010. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2010.204.
[ BibTex | DOI | Web page | PDF ]
[LBD⁺10]: S. Li, S. Balaguer, A. David, K. G. Larsen, B. Nielsen, and S. Pusinskas. Scenario-based verification of real-time systems using Uppaal. Formal Methods in System Design, 37(2-3):200--264, November 2010.
doi: 10.1007/s10703-010-0103-z.
[ BibTex | DOI | Web page | PDF ]
[BHSZ10]: B. Bérard, S. Haddad, M. Sassolas, and M. Zeitoun. Distributed Synthesis with Incomparable Information. Research Report LSV-10-17, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2010. 20 pages.
[ BibTex | Web page | PDF ]
[Haa10a]: S. Haar. Types of Asynchronous Diagnosability and the phReveals-Relation in Occurrence Nets. IEEE Transactions on Automatic Control, 55(10):2310--2320, October 2010.
doi: 10.1109/TAC.2010.2063490.
[ BibTex | DOI | Web page | PDF ]
[BCHK10]: P. Baldan, Th. Chatain, S. Haar, and B. König. Unfolding-based Diagnosis of Systems with an Evolving Topology. Information and Computation, 208(10):1169--1192, October 2010.
doi: 10.1016/j.ic.2009.11.009.
[ BibTex | DOI | Web page | PDF ]
[Rod10]: C. Rodríguez. Implementation of a complete prefix unfolder for contextual nets. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2010.
[ BibTex | Web page | PDF ]
[HMY10b]: S. Haddad, L. Mokdad, and 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 (ISSSashBPSC'10), volume 177 of Lecture Notes in Informatics, pages 255--266, Leipzig, Germany, September-October 2010. Gesellschaft für Informatik.
[ BibTex | Web page | PDF ]
[BDF10]: A. Bušić, H. Djafri, and J.-M. Fourneau. Stochastic Bounds for Censored Markov Chains. In Proceedings of the 6th International Meeting on the Numerical Solution of Markov Chain (NSMC'10), Williamsburg, Virginia, USA, September 2010.
[ BibTex | Web page | PDF ]
[BCH10]: S. Balaguer, Th. Chatain, and 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), pages 77--84, Paris, France, September 2010. IEEE Computer Society Press.
doi: 10.1109/TIME.2010.12.
[ BibTex | DOI | Web page | PDF ]
[BHS10]: B. Bérard, S. Haddad, and M. Sassolas. Real Time Properties for Interrupt Timed Automata. In Proceedings of the 17th International Symposium on Temporal Representation and Reasoning (TIME'10), pages 69--76, Paris, France, September 2010. IEEE Computer Society Press.
doi: 10.1109/TIME.2010.11.
[ BibTex | DOI | Web page | PDF ]
[BKM10]: B. Bollig, D. Kuske, and I. Meinecke. Propositional Dynamic Logic for Message-Passing Systems. Logical Methods in Computer Science, 6(3:16), September 2010.
doi: 10.2168/LMCS-6(3:16)2010.
[ BibTex | DOI | Web page | PDF ]
[Mon10]: B. Monmege. Propriétés quantitatives des mots et des arbres -- Applications aux langages XML. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2010.
[ BibTex | Web page | PDF ]
[BBC⁺10]: P. Baldan, A. Bruni, A. Corradini, B. König, and S. Schwoon. On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars. In Proceedings of the 5th International Conference on Graph Transformations (ICGT'10), volume 6372 of Lecture Notes in Computer Science, pages 91--106, Enschede, The Netherlands, September-October 2010. Springer.
doi: 10.1007/978-3-642-15928-2_7.
[ BibTex | DOI | Web page | PDF ]
[Cyr10b]: A. Cyriac. Temporal Logics for Concurrent Recursive Programs. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2010.
[ BibTex | Web page | PDF ]
[Haa10b]: S. Haar. What Topology Tells us about Diagnosability in Partial Order Semantics. In Proceedings of the 10th Workshop on Discrete Event Systems (WODES'10), pages 221--226, Berlin, Germany, August-September 2010. IFAC.
[ BibTex | Web page | PDF ]
[GL10]: P. Gastin and F. Laroussinie, editors. Proceedings of the 21st International Conference on Concurrency Theory (CONCUR'10), volume 6269 of Lecture Notes in Computer Science. Springer, August-September 2010.
doi: 10.1007/978-3-642-15375-4.
[ BibTex | DOI | Web page ]
[Aks10]: S. Akshay. Spécification et vérification pour des systèmes distribués et temporisés. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2010.
[ BibTex | Web page | PDF ]
[BGMZ10]: B. Bollig, P. Gastin, B. Monmege, and 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, volume 6199 of Lecture Notes in Computer Science, pages 587--598, Bordeaux, France, July 2010. Springer.
doi: 10.1007/978-3-642-14162-1_49.
[ BibTex | DOI | Web page | PDF ]
[BKK⁺10]: B. Bollig, J.-P. Katoen, C. Kern, M. Leucker, D. Neider, and D. R. Piegdon. libalf: the Automata Learning Framework. In Proceedings of the 22nd International Conference on Computer Aided Verification (CAV'10), volume 6174 of Lecture Notes in Computer Science, pages 360--364, Edinburgh, Scotland, UK, July 2010. Springer.
doi: 10.1007/978-3-642-14295-6_32.
[ BibTex | DOI | Web page | PDF ]
[GK10]: P. Gastin and D. Kuske. Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. Information and Computation, 208(7):797--816, July 2010.
doi: 10.1016/j.ic.2009.12.003.
[ BibTex | DOI | Web page | PDF ]
[Cyr10a]: A. Cyriac. A New Version of Focus Games for LTL Satisfiability. In Proceedings of the Workshop on Comparing Logical Decision Methods (CLoDeM'10), Edinburgh, Scotland, UK, July 2010.
[ BibTex | Web page | PDF ]
[EHH10]: D. El Hog-Benzina, S. Haddad, and 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, June 2010.
[ BibTex | Web page | PDF ]
[HMY10a]: S. Haddad, L. Mokdad, and S. Youcef. Response time of BPEL4WS constructors. In Proceedings of the 15th IEEE Symposium on Computers and Communications (ISCC'10), pages 695--700, Riccione, Italy, June 2010. IEEE Computer Society Press.
doi: 10.1109/ISCC.2010.5546538.
[ BibTex | DOI | Web page | PDF ]
[CF10]: Th. Chatain and É. Fabre. Factorization Properties of Symbolic Unfoldings of Colored Petri Nets. In Proceedings of the 31st International Conference on Applications and Theory of Petri Nets (PETRI NETS'10), volume 6128 of Lecture Notes in Computer Science, pages 165--184, Braga, Portugal, June 2010. Springer.
doi: 10.1007/978-3-642-13675-7_11.
[ BibTex | DOI | Web page | PDF ]
[BH10b]: B. Bollig and L. Hélouët. Realizability of Dynamic MSC Languages. In Proceedings of the 5th International Computer Science Symposium in Russia (CSR'10), volume 6072 of Lecture Notes in Computer Science, pages 48--59, Kazan, Russia, June 2010. Springer.
doi: 10.1007/978-3-642-13182-0_5.
[ BibTex | DOI | Web page | PDF ]
[BKKL10a]: B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. Learning Communicating Automata from MSCs. IEEE Transactions on Software Engineering, 36(3):390--408, May-June 2010.
doi: 10.1109/TSE.2009.89.
[ BibTex | DOI | Web page | PDF ]
[CJ10]: Th. Chatain and 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, May-June 2010. IEEE Computer Society Press.
[ BibTex | Web page | PDF ]
[BH10a]: M. Ben Hmida and 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), volume 6028 of Lecture Notes in Computer Science, pages 24--42, Budapest, Hungary, April 2010. Springer.
doi: 10.1007/978-3-642-12566-9_2.
[ BibTex | DOI | Web page | PDF ]
[RHS10]: L. Recalde, S. Haddad, and M. Silva. Continuous Petri Nets: Expressive Power and Decidability Issues. International Journal of Foundations of Computer Science, 21(2):235--256, April 2010.
doi: 10.1142/S0129054110007222.
[ BibTex | DOI ]
[BKKL10b]: B. Bollig, J.-P. Katoen, C. Kern, and M. Leucker. SMA---The Smyle Modeling Approach. Computing and Informatics, 29(1):45--72, 2010.
[ BibTex | Web page | PDF ]
[ZBH10]: M. Zargayouna, F. Balbo, and S. Haddad. Agents Secure Interaction in Data Driven Languages. In Revised Selected Papers of the 2nd Workshop on LAnguages, methodologies and Development tools for multi-agent systemS (LADS'09), volume 6039 of Lecture Notes in Computer Science, pages 72--91, Turin, Italy, 2010. Springer.
doi: 10.1007/978-3-642-13338-1_5.
[ BibTex | DOI | Web page | PDF ]
[Haa09]: S. Haar. Qualitative Diagnosability of Labeled Petri Nets Revisited. In Proceedings of the Joint 48th IEEE Conference on Decision and Control (CDC'09) and 28th Chinese Control Conference (CCC'09), pages 1248--1253, Shanghai, China, December 2009. IEEE Control System Society.
doi: 10.1109/CDC.2009.5400917.
[ BibTex | DOI | Web page | PDF ]
[Szn09]: N. Sznajder. Synthèse de systèmes distribués ouverts. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France, November 2009.
[ BibTex | Web page | PDF ]
[HMY09]: S. Haddad, L. Mokdad, and S. Youcef. Bornes du temps de réponse des services Web composites. In Actes du 7ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'09), volume 43 of Journal Européen des Systèmes Automatisés, pages 969--983, Nantes, France, November 2009. Hermès.
[ BibTex | Web page | PDF ]
[ACD⁺09]: É. André, Th. Chatain, O. De Smet, L. Fribourg, and S. Ruel. Synthèse de contraintes temporisées pour une architecture d'automatisation en réseau. In Actes du 7ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'09), volume 43 of Journal Européen des Systèmes Automatisés, pages 1049--1064, Nantes, France, November 2009. Hermès.
[ BibTex | Web page | PDF ]
[DBB⁺09]: A. David, G. Behrmann, P. Bulychev, J. Byg, Th. Chatain, K. G. Larsen, P. Pettersson, J. I. Rasmussen, J. Srba, W. Yi, K. Y. Joergensen, D. Lime, M. Magnin, O. H. Roux, and L.-M. Traonouez. Tools for Model-Checking Timed Systems. In Communicating Embedded Systems -- Software and Design, chapter 6, pages 165--225. Wiley-ISTE, October 2009.
[ BibTex | Web page ]
[BCH⁺09]: C. Boutrous-Saab, D. Coulibaly, S. Haddad, T. Melliti, P. Moreaux, and S. Rampacek. An Integrated Framework for Web Services Orchestration. International Journal of Web Services Research, 6(4):1--29, September 2009.
[ BibTex | Web page | PDF ]
[CDL09]: Th. Chatain, A. David, and K. G. Larsen. Playing Games with Timed Games. In Proceedings of the 3rd IFAC Conference on Analysis and Design of Hybrid Systems (ADHS'09), Zaragoza, Spain, September 2009.
[ BibTex | Web page | PDF ]
[BCDL09]: P. Bulychev, Th. Chatain, A. David, and K. G. Larsen. Checking simulation relation between timed game automata. In Proceedings of the 7th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'09), volume 5813 of Lecture Notes in Computer Science, pages 73--87, Budapest, Hungary, September 2009. Springer.
doi: 10.1007/978-3-642-04368-0_8.
[ BibTex | DOI | Web page | PDF ]
[HP09]: S. Haddad and N. Pekergin. Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains. In Proceedings of the 6th International Conference on Quantitative Evaluation of Systems (QEST'09), pages 177--186, Budapest, Hungary, September 2009. IEEE Computer Society Press.
doi: 10.1109/QEST.2009.42.
[ BibTex | DOI | Web page | PDF ]
[BHR09]: A. Bouillard, S. Haar, and 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), volume 5813 of Lecture Notes in Computer Science, pages 43--57, Budapest, Hungary, September 2009. Springer.
doi: 10.1007/978-3-642-04368-0_6.
[ BibTex | DOI | Web page | PDF ]
[LA09]: D. Longuet and M. Aiguier. Integration Testing from Structured First-Order Specifications via Deduction Modulo. In Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (ICTAC'09), volume 5684 of Lecture Notes in Computer Science, pages 261--276, Kuala Lumpur, Malaysia, August 2009. Springer.
doi: 10.1007/978-3-642-03466-4_17.
[ BibTex | DOI | Web page | PDF ]
[BHS09]: B. Bérard, S. Haddad, and M. Sassolas. Verification on Interrupt Timed Automata. Research Report LSV-09-16, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2009. 16 pages.
[ BibTex | Web page | PDF ]
[BHKL09]: B. Bollig, P. Habermehl, C. Kern, and M. Leucker. Angluin-Style Learning of NFA. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI'09), pages 1004--1009, Pasadena, California, USA, July 2009. AAAI Press.
[ BibTex | Web page | PDF ]
[BRBH09]: A. Bouillard, S. Rosario, A. Benveniste, and S. Haar. Monotonicity in Service Orchestrations. In Proceedings of the 30th International Conference on Applications and Theory of Petri Nets (PETRI NETS'09), volume 5606 of Lecture Notes in Computer Science, pages 263--282, Paris, France, June 2009. Springer.
doi: 10.1007/978-3-642-02424-5_16.
[ BibTex | DOI | Web page | PDF ]
[HKP⁺09]: S. Haddad, F. Kordon, L. Petrucci, J.-F. Pradat-Peyre, and N. Trèves. Efficient State-Based Analysis by Introducing Bags in Petri Nets Color Domains. In Proceedings of the 28th American Control Conference (ACC'09), pages 5018--5025, Saint Louis, Missouri, USA, June 2009.
doi: 10.1109/ACC.2009.5160020.
[ BibTex | DOI | Web page | PDF ]
[BG09]: B. Bollig and P. Gastin. Weighted versus Probabilistic Logics. In Proceedings of the 13th International Conference on Developments in Language Theory (DLT'09), volume 5583 of Lecture Notes in Computer Science, pages 18--38, Stuttgart, Germany, June-July 2009. Springer.
doi: 10.1007/978-3-642-02737-6_2.
[ BibTex | DOI | Web page | PDF ]
[GSZ09]: P. Gastin, N. Sznajder, and M. Zeitoun. Distributed synthesis for well-connected architectures. Formal Methods in System Design, 34(3):215--237, June 2009.
doi: 10.1007/s10703-008-0064-7.
[ BibTex | DOI | Web page | PDF ]
[BFCH09]: M. Beccuti, G. Franceschinis, D. Codetta-Raiteri, and S. Haddad. Parametric NdRFT for the derivation of optimal repair strategies. In Proceedings of the 39th Annual IEEEashIFIP International Conference on Dependable Systems and Networks (DSN'09), pages 399--408, Estoril, Portugal, June-July 2009. IEEE Computer Society Press.
doi: 10.1109/DSN.2009.5270312.
[ BibTex | DOI | Web page | PDF ]
[EFSH09]: A. El Fallah Seghrouchni and S. Haddad. Interopérabilité des systèmes multi-agents à l'aide des services web. In Technologies des systèmes multi-agents et applications industrielles, chapter 3, pages 77--99. Hermès, April 2009.
[ BibTex | Web page ]
[CGM⁺09]: Th. Chatain, P. Gastin, A. Muscholl, N. Sznajder, I. Walukiewicz, and M. Zeitoun. Distributed control for restricted specifications. Deliverable DOTS 2.2 (ANR-06-SETI-003), March 2009.
[ BibTex ]
[DHS09]: S. Donatelli, S. Haddad, and J. Sproston. Model Checking Timed and Stochastic Properties with CSL^TA. IEEE Transactions on Software Engineering, 35(2):224--240, March-April 2009.
doi: 10.1109/TSE.2008.108.
[ BibTex | DOI | Web page | PDF ]
[HI09]: S. Haddad and J.-M. Ilié. Symmetry and Temporal Logic. In Petri Nets: Fundamental Models, Verification and Applications, pages 435--460. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[HV09b]: S. Haddad and F. Vernadat. Verification of Specific Properties. In Petri Nets: Fundamental Models, Verification and Applications, pages 349--414. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[HM09c]: S. Haddad and P. Moreaux. Tensor Methods and Stochastic Petri Nets. In Petri Nets: Fundamental Models, Verification and Applications, pages 321--346. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[HM09b]: S. Haddad and P. Moreaux. Stochastic Well-formed Petri Nets. In Petri Nets: Fundamental Models, Verification and Applications, pages 303--320. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[HM09a]: S. Haddad and P. Moreaux. Stochastic Petri Nets. In Petri Nets: Fundamental Models, Verification and Applications, pages 269--302. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[Had09]: S. Haddad. Decidability and Complexity of Petri Net Problems. In Petri Nets: Fundamental Models, Verification and Applications, pages 87--122. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[HV09a]: S. Haddad and F. Vernadat. Analysis Methods for Petri Nets. In Petri Nets: Fundamental Models, Verification and Applications, pages 41--86. Wiley-ISTE, 2009.
[ BibTex | Web page ]
[RBHJ08]: S. Rosario, A. Benveniste, S. Haar, and C. Jard. Probabilistic QoS and Soft Contracts for Transaction-Based Web Services Orchestrations. IEEE Transactions on Services Computing, 1(4):187--200, October-December 2008.
doi: 10.1109/TSC.2008.17.
[ BibTex | DOI | Web page | PDF ]

This file was generated by bibtex2html 1.98.

Publications : MEXICO

About LSV