Publications : Stefan HAAR

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[DH19]

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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[BCH13]

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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[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 ]

[PH08]

H. Pouyllau and S. Haar. Distributed Busacker-Gowen algorithm for end-to-end QoS pipe negotiation in X-domain networks. Annals of Telecomunications, 63(11-12):621--630, December 2008.
doi: 10.1007/s12243-008-0055-0.
[ BibTex | DOI | Web page | PDF ]

[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 ]

[Haa08]

S. Haar. Law and Partial Order -- Nonsequential Behaviour and Probability in Asynchronous Systems. Mémoire d'habilitation, Université Rennes 1, Rennes, France, October 2008.
[ BibTex | Web page | PDF ]

[BCHK08]

P. Baldan, Th. Chatain, S. Haar, and B. König. Unfolding-based Diagnosis of Systems with an Evolving Topology. In Proceedings of the 19th International Conference on Concurrency Theory (CONCUR'08), volume 5201 of Lecture Notes in Computer Science, pages 203--217, Toronto, Canada, August 2008. Springer.
doi: 10.1007/978-3-540-85361-9_19.
[ BibTex | DOI | Web page | PDF ]

[vBHJJ08]

G. von Bochmann, S. Haar, C. Jard, and G.-V. Jourdan. Testing Systems Specified as Partial Order InputashOutput Automata. In Proceedings of the 20th IFIP TC 6/WG 6.1 International Conference on Testing of Software and Communicating Systems (TestCom'08) and 8th International Workshop on Formal Approaches to Testing of Software (FATES'08), volume 5047 of Lecture Notes in Computer Science, pages 169--183, Tokyo, Japan, June 2008. Springer.
doi: 10.1007/978-3-540-68524-1_13.
[ BibTex | DOI | Web page | PDF ]

[RKB⁺08]

S. Rosario, D. Kitchin, A. Benveniste, W. R. Cook, S. Haar, and C. Jard. Event Structure Semantics of Orc. In Proceedings of the 4th International Workshop on Web Services and Formal Methods (WS-FM'07), volume 4937 of Lecture Notes in Computer Science, pages 154--168, Brisbane, Australia, 2008. Springer.
doi: 10.1007/978-3-540-79230-7_11.
[ BibTex | DOI ]

[Haa07]

S. Haar. Unfold and Cover: Qualitative Diagnosability for Petri Nets. In Proceedings of the 46th IEEE Conference on Decision and Control (CDC'07), pages 1886--1891, New Orleans, Louisiana, USA, December 2007. IEEE Control System Society.
doi: 10.1109/CDC.2007.4434691.
[ BibTex | DOI ]

[RBHJ07]

S. Rosario, A. Benveniste, S. Haar, and C. Jard. Probabilistic QoS and soft contracts for transaction based web services. In Proceedings of the 6th International Conference on Web Services (ICWS'07), pages 126--133, Salt Lake City, Utah, USA, July 2007. IEEE Computer Society Press.
doi: 10.1109/ICWS.2007.144.
[ BibTex | DOI ]

[PH07a]

H. Pouyllau and S. Haar. A protocol for QoS contract negotiation and its implementation using web Services. In Proceedings of the 6th International Conference on Web Services (ICWS'07), pages 168--175, Salt Lake City, Utah, USA, July 2007. IEEE Computer Society Press.
doi: 10.1109/ICWS.2007.14.
[ BibTex | DOI ]

[HJJ07]

S. Haar, C. Jard, and G.-V. Jourdan. Testing InputashOutput Partial Order Automata. In Proceedings of the 19th IFIP TC 6/WG 6.1 International Conference on Testing of Software and Communicating Systems (TestCom'07) and 7th International Workshop on Formal Approaches to Testing of Software (FATES'07), volume 4581 of Lecture Notes in Computer Science, pages 171--185, Tallinn, Estonia, June 2007. Springer.
doi: 10.1007/978-3-540-73066-8_12.
[ BibTex | DOI | Web page | PDF ]

[PH07b]

H. Pouyllau and S. Haar. Distributed End-to-End QoS Contract Negotiation. In Proceedings of the 1st International Conference on Autonomous Infrastructure, Management and Security (AIMS'07), volume 4543 of Lecture Notes in Computer Science, pages 180--183, Oslo, Norway, June 2007. Springer.
doi: 10.1007/978-3-540-72986-0_20.
[ BibTex | DOI ]

[BHK06]

P. Baldan, S. Haar, and B. König. Distributed Unfolding of Petri Nets. In Proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'06), volume 3921 of Lecture Notes in Computer Science, pages 126--141, Vienna, Austria, March 2006. Springer.
doi: 10.1007/11690634_9.
[ BibTex | DOI | Web page | PDF ]

[PACH06]

H. Pouyllau, A. Aghasaryan, L. Ciarletta, and S. Haar. X-domain QoS budget negotiation using Dynamic Programming. In Proceedings of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW'06), page 35, Guadeloupe, French Caribbean, February 2006. IEEE Computer Society Press.
[ BibTex ]

[HBFJ05]

S. Haar, A. Benveniste, É. Fabre, and C. Jard. Fault Diagnosis for Distributed Asynchronous Dynamically Reconfigured Discrete Event Systems. In Proceedings of the 16th IFAC World Congress (IFAC'05), Prague, Czech Republic, July 2005. IFAC.
[ BibTex | Web page | PDF ]

[AAHM05]

S. Abiteboul, Z. Abrams, S. Haar, and T. Milo. Diagnosis of asynchronous discrete event systems: datalog to the rescue! In Proceedings of the 24th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'05), pages 358--367, Baltimore, Maryland, USA, June 2005. ACM Press.
doi: 10.1145/1065167.1065214.
[ BibTex | DOI ]

[FBHJ05]

É. Fabre, A. Benveniste, S. Haar, and C. Jard. Distributed monitoring of concurrent and asynchronous systems. Discrete Event Dynamic Systems: Theory and Applications, 15(1):33--84, March 2005.
doi: 10.1007/s10626-005-5238-5.
[ BibTex | DOI | Web page | PDF ]

[FBH⁺04]

É. Fabre, A. Benveniste, S. Haar, S. Jard, and A. Aghasaryan. Algorithms for Distributed Fault Management in Telecommunications Networks. In Proceedings of the 11th International Conference on Telecommunications (ICT'04), volume 3124 of Lecture Notes in Computer Science, pages 820--825, Fortaleza, Brazil, August 2004. Springer.
[ BibTex ]

[HBFJ03]

S. Haar, A. Benveniste, É. Fabre, and C. Jard. Partial Order Diagnosability of Discrete Event Systems Using Petri Net Unfoldings. In Proceedings of the 42nd IEEE Conference on Decision and Control (CDC'03), volume 4, pages 3748--3753, Hawaii, USA, December 2003. IEEE Control System Society.
doi: 10.1109/CDC.2003.1271732.
[ BibTex | DOI ]

[BHFJ03b]

A. Benveniste, S. Haar, É. Fabre, and C. Jard. Distributed unfoldings: a tool to address distributed discrete event systems diagnosis. In Proceedings of the 42nd IEEE Conference on Decision and Control (CDC'03), volume 4, pages 3742--3747, Hawaii, USA, December 2003. IEEE Control System Society.
doi: 10.1109/CDC.2003.1271731.
[ BibTex | DOI ]

[BFH03]

A. Benveniste, É. Fabre, and S. Haar. Markov Nets: Probabilistic Models for Distributed and Concurrent Systems. IEEE Transactions on Automatic Control, 48(11):1936--1950, November 2003.
doi: 10.1109/TAC.2003.819076.
[ BibTex | DOI | Web page | PDF ]

[Haa03]

S. Haar. Distributed Semi-Markov Processes in Stochastic T-Timed Petri Nets. In Proceedings of the 10th International Workshop on Petri Nets and Performance Models (PNPM'03), pages 114--123, Urbana, Illinois, USA, September 2003. IEEE Computer Society Press.
[ BibTex ]

[BHFJ03a]

A. Benveniste, S. Haar, É. Fabre, and C. Jard. Distributed Monitoring of Concurrent and Asynchronous Systems. In Proceedings of the 14th International Conference on Concurrency Theory (CONCUR'03), volume 2761 of Lecture Notes in Computer Science, pages 1--26, Marseilles, France, August 2003. Springer.
[ BibTex ]

[GHM03]

B. Gaujal, S. Haar, and J. Mairesse. Blocking a Transition in a Free Choice Net, and What it Tells About its Throughput. Journal of Computer and System Sciences, 66(3):515--548, May 2003.
doi: 10.1016/S0022-0000(03)00039-4.
[ BibTex | DOI | Web page | PS | PDF ]

[BFHJ03]

A. Benveniste, É. Fabre, S. Haar, and C. Jard. Diagnosis of Asynchronous Discrete Event Systems: A Net Unfolding Approach. IEEE Transactions on Automatic Control, 48(5):714--727, May 2003.
doi: 10.1109/TAC.2003.811249.
[ BibTex | DOI | Web page | PDF ]

[Haa02a]

S. Haar. Probabilistic Cluster Unfoldings. Fundamenta Informaticae, 53(3-4):281--314, December 2002.
[ BibTex | Web page | PS | PDF ]

[Haa02c]

S. Haar. Probabilizing Parallelism in Cluster Unfoldings. In Proceedings of the 11th Concurrency, Specification & Programming Workshop (CS&P'02), volume 161 of Informatik Bericht, Berlin, Germany, October 2002. Humboldt Universität zu Berlin.
[ BibTex ]

[BFJH02]

A. Benveniste, É. Fabre, C. Jard, and S. Haar. Diagnosis of Asynchronous Discrete Event Systems, A Net Unfolding Approach. In Proceedings of the 6th Workshop on Discrete Event Systems (WODES'02), pages 182--190, Zaragoza, Spain, October 2002.
[ BibTex ]

[HSLKT02]

S. Haar, F. Simonot-Lion, L. Kaiser, and J. Toussaint. Equivalence of Timed State Machines and Safe Time Petri Nets. In Proceedings of the 6th Workshop on Discrete Event Systems (WODES'02), pages 119--126, Zaragoza, Spain, October 2002.
[ BibTex ]

[Haa02b]

S. Haar. Probabilistic Unfoldings and Partial Order Fairness in Petri Nets. In Proceedings of the 2nd Joint Interbational Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM-PROBMIV'02), volume 2399 of Lecture Notes in Computer Science, pages 95--114, Copenhagen, Denmark, July 2002. Springer.
doi: 10.1007/3-540-45605-8_7.
[ BibTex | DOI ]

[BFH01b]

A. Benveniste, É. Fabre, and S. Haar. Probabilistic Petri Net Unfoldings in Network Fault Diagnosis. In Proceedings of the 39th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, USA, October 2001.
[ BibTex ]

[Haa01a]

S. Haar. Clusters, Confusion and Unfoldings. Fundamenta Informaticae, 47(3-4):259--270, September-October 2001.
[ BibTex | Web page | PDF ]

[BFH01a]

A. Benveniste, É. Fabre, and S. Haar. Probabilistic Branching Processes for Fault Diagnosis in Concurrent Systems. In Proceedings of the 5th International Workshop on Performability Modeling of Computer and Communication Systems (PMCCS-5), Erlangen, Germany, September 2001.
[ BibTex ]

[BH01]

F. Baccelli and S. Haar. Counter Equations for Timed Competition Nets. In Proceedings of the Workshop on Max-Plus Algebras, Prague, Czech Republic, August 2001.
[ BibTex ]

[Haa01b]

S. Haar. Cyclic and Partial Order Models for Concurrency. In Preliminary Proceedings of the 3rd Workshop on Geometric and Topological Methods in Concurrency (GETCO'01), Aalborg, Denmark, August 2001.
[ BibTex ]

[HBF01]

S. Haar, A. Benveniste, and É. Fabre. Markov Nets: A New Probabilistic Model for Fault Diagnosis in Concurrent Systems. In Proceedings of the Workshop on Concurrency in Dependable Computing, Newcastle upon Tyne, UK, June 2001.
[ BibTex ]

[GH00]

B. Gaujal and S. Haar. A Limit Semantics for Timed Petri Nets. In Proceedings of the 5th Workshop on Discrete Event Systems (WODES'00), pages 219--228, Ghent, Belgium, August 2000. Kluwer Academic Publishers.
[ BibTex ]

[Haa00]

S. Haar. Occurrence Net Logics. Fundamenta Informaticae, 43(1-4):105--127, July-August 2000.
[ BibTex ]

[Haa98]

S. Haar. Branching Processes of General S/T-Systems and their Properties. In Proceedings of the MFCS'98 Workshop on Concurrency, volume 18 of Electronic Notes in Theoretical Computer Science, pages 65--74, Brno, Czech Republic, August 1998. Elsevier Science Publishers.
doi: 10.1016/S1571-0661(05)80250-6.
[ BibTex | DOI ]

[Haa97]

S. Haar. Kausalität, Nebenläufigkeit und Konflikt. Elementare Netzsysteme aus topologisch-relationaler Sicht. Thèse de doctorat, Hamburg University, Germany, 1997.
[ BibTex ]

This file was generated by bibtex2html 1.98.