Stefan Haar
Publications
Book Kausalität, Nebenläufigkeit und Konflikt. Elementare Netzsysteme  aus topologisch-relationaler Sicht
(Causality, Concurrency and conflict in Elementary Net Systems    from a topological and relational point of view).
versal  9, Bertz Verlag Berlin, 1998. In German (sorry); final version of my Ph.D. thesis.
Articles in Journals
  1. Eric Fabre, Albert Benveniste, Claude Jard, and Stefan Haar. Distributed monitoring of concurrent and asynchronous systems. Discrete Event Dynamic Systems: theory and application 15(1):33--84, March 2005.
  2. Albert Benveniste, Eric Fabre, and Stefan Haar. Markov Nets: Probabilistic Models for distributed and concurrent systems. IEEE Transactions on Automatic Control 48(11):1936-1950, November 2003. 
  3. Bruno Gaujal, Stefan Haar, and Jean 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, 2003.
  4. Stefan Haar, Albert Benveniste, Eric Fabre, Claude Jard. Diagnosis of Asynchronous Discrete Event Systems, a Net Unfolding Approach.
  5. S.Haar. Probabilistic Cluster Unfoldings. Fundamenta Informaticae 53(3-4):281-314, Dec. 2002. 
  6. S.Haar. Clusters, Confusion and Unfoldings.  Fundamenta Informaticae 47(3-4):259-270, Sept/Oct. 2001. 
  7. S.Haar. Occurrence Net Logics. Fundamenta Informaticae 43:105-127, Aug. 2000.
Conferences , Workshops
  1. Armen Aghasaryan, Sophie Piekarec, Hélia Pouyllau, Stefan Haar, Laurent Ciarletta, Nader Mbarek, Eric Moreau, and Eric Fabre. Multi-Domain Self Aware Management : Negotiation and Monitoring. ICT 2006.
  2. Paolo Baldan, Stefan Haar, and Barbara König. Distributed Unfolding of Petri Nets. FOSSACS 2006, LNCS 3921, pp 126-141, Springer 2006.
  3. Hélia Pouyllau, Armen Aghasaryan, Laurent Ciarletta, Stefan Haar. X-domain QoS budget negotiation using Dynamic Programming.
    SAPIR workshop, Advanced International Conference on Telecommunications (AICT)'06.
  4. Stefan Haar, Albert Benveniste, Eric Fabre, Claude Jard. Fault Diagnosis for Distributed Asynchronous Dynamically Reconfigured Discrete Event Systems. IFAC World Congress 2005
  5. Stefan Haar, Albert Benveniste, Eric Fabre, Claude Jard.Partial Order Diagnosability Of Discrete Event Systems Using Petri Net Unfoldings.  42nd IEEE Conference on Decision and Control (CDC) 2003.
  6. Albert Benveniste, Stefan Haar, Eric Fabre, Claude Jard.Distributed unfoldings: a tool to address distributed discrete event systems diagnosis.  42nd IEEE Conference on Decision and Control (CDC) 2003.
  7. S.Haar. Distributed Semi-Markov Processes in Stochastic T-Timed  Petri Nets. Proc.  PNPM 03, Urbana-Champaign, Sept. 2003; pp. 114-123, IEEE CS press. 
  8. A. Benveniste, E. Fabre, S. Haar, and C. Jard:   Distributed monitoring of concurrent and asynchronous systems. Invited Talk; Proc. CONCUR 2003,  LNCS.
  9. S. Haar. Probabilizing Parallelism in Cluster Unfoldings. Workshop Concurrency, Specification and Programming, Berlin, Oct. 2002.
  10. S. Haar. Probabilistic Unfoldings and Partial Order Fairness in Petri Nets. In: H. Hermanns and R. Segala (eds.), Process Algebra and Probabilistic Methods:  Copenhagen 2002. LNCS 2399, pp 95-114, Springer Verlag 2002. 
  11. A. Benveniste, E. Fabre, C.Jard, and S. Haar. Diagnosis of Asynchronous discrete Event Systems, a  Net Unfolding Approach. Proc.  WODES 2002,  Zaragoza;pp. 182-190.
  12. S. Haar, F. Simonot-Lion, L. Kaiser, and J.Toussaint. Equivalence of Timed State Machines and safe Time Petri Nets.    Proc. WODES 2002, Zaragoza; pp. 119-126. 
  13. A. Benveniste, E. Fabre, and S. Haar. Probabilistic Petri Net Unfoldings in Network Fault Diagnosis. Invited talk at 39th Allerton Conf. on Communication, Control, and Computing, Monticello/USA, Oct. 2001.
  14.  A. Benveniste, E. Fabre, and S. Haar.  Probabilistic Branching Processes for Fault Diagnosis in  Concurrent Systems. PMCCS5, Erlangen/Germany, September 2001
  15. A. Benveniste, E. Fabre, and S. Haar. Markov Nets: a new Probabilistic Model for Fault Diagnosis in Concurrent Systems.  Workshop on Concurrency in Dependable Computing, at ICATPN 2001, Newcastle/UK.
  16. F. Baccelli and S. Haar.    Counter Equations for Timed Competition Nets.    Workshop on Max/Plus Algebras and Their Applications to Discrete Event Systems,   Theoretical  Computer Science, and Optimization,  at 1st IFAC Symposium on System Structure and Control, Prague/CR, August 2001.
  17.  S. Haar. Cyclic and Partial Order Models for Concurrency.  GETCO, Aalborg/DK, August 2001.
  18. B. Gaujal and S. Haar.   A Limit Semantics for Timed PN. In: WODES 2000. Discrete Event Systems: Analysis and Control. R. Boel and  G. Stremersch (eds.),  pp  219-228,   Kluwer 2000.
  19. S. Haar.  Branching Processes of general S/T-Systems.  Proceedings of the Workshop on  Concurrency at MFCS '98. Electronic Notes in Computer Science No. 18, 1998, Elsevier.
Some Reports
  1.  S. Haar. Diagnosability Of Asynchronous Discrete Event Systems in Partial Order Semantics. RR-5248, July 2004.
  2. A. Benveniste, E. Fabre, S. Haar, and C. Jard:   Distributed monitoring of concurrent and asynchronous systems---extended version. IRISA Report 1540, June  2003.
  3. S. Haar. Distributed Semi-Markov Processes in Stochastic T-Timed Petri Nets. RR-4754, March 2003.
  4. S. Haar. Probabilistic Cluster Unfoldings for Petri Nets. RR-4755, March 2003.
  5. A. Benveniste and E. Fabre, and S. Haar. Markov Nets: probabilistic Models for Distributed and Concurrent Systems. RR-4253, Sept. 2001.
  6. B. Gaujal, S.Haar, and J. Mairesse.  Blocking a Transition in a Free Choice Net, and what it tells about its throughput. RR-4225, July 2001.
  7. A. Benveniste, E. Fabre, S. Haar, C. Jard: Diagnosis of Asynchronous discrete Event Systems, a  Net Unfolding Approach. RR-4461, May 2002.
  8. S. Haar, L. Kaiser,   F.  Simonot-Lion,  and J. Toussaint: On Equivalence between Timed State Machines and Time Petri Nets. RR-4049, Nov. 2000.
  9. S. Haar. On Cyclic Orders and Synchronisation Graphs. RR-4007, October 2000. 
  10. S. Haar. On Occurrence Net Semantics of Petri Nets.  RR-3718, June 1999. 
  11. S. Haar. Properties of Untimed Routed Petri Nets. RR-3705, June 1999. 
  12. B. Gaujal and S. Haar. Non-ambiguous Petri Nets.  RR-3691,  May 1999.
Links      Back






 
 
 
 
 
 
  Last modified on June 29, 2005