partial orders

Academic Journals

  1. Loig Jezequel, E. Fabre. On the construction of probabilistic diagnosers for modular systems. Journal of Discrete Events Dynamical Systems, to appear, 2012. details
  2. S. Abbes, A. Benveniste. Probabilistic true-concurrency models: Markov nets and a law of large numbers. TCS special issue: FOSSACS 2005, to appear, 2007. details
  3. E. Fabre. Trellis Processes: a Compact Representation for Runs of Concurrent Systems. Journal of Discrete Event Dynamical Systems, 17(3):267-306, 2007. details
  4. B. Genest, D. Kuske, A. Muscholl. On Communicating Automata with Bounded Channels. Fundamenta Informaticae, IOS Press, 80:1-21, 2007. details
  5. E. Fabre, A. Benveniste. Partial Order Techniques for Distributed Discrete Event Systems: why you can't avoid using them. Journal of Discrete Events Dynamical Systems, to appear, 2007. details
  6. S. Abbes, A. Benveniste. True-concurrency Probabilistic Models: Branching cells and Distributed Probabilities for Event Structures. Information and Computation, Partial orders, scenarios, unfoldings, 204(2):231-274, 2006. details
  7. B. Genest, D. Kuske, A. Muscholl. A Kleene Theorem and Model Checking for a Class of Communicating Automata. Information and Computation, 204(6):920-956, 2006. details
  8. B. Genest, A. Muscholl, H. Seidl, M. Zeitoun. Infinite-State High-Level MSCs: Model-Checking and Realizability. J. Computer and System Science JCSS, 72(4):617-647, 2006. details
  9. E. Fabre, A. Benveniste, S. Haar, C. Jard. Distributed Monitoring of Concurrent and Asynchronous Systems. Journal of Discrete Event Systems, special issue, pages 33-84, 2005. details
  10. A. Benveniste, E. Fabre, S. Haar. Markov Nets: Probabilistic Models for distributed and concurrent systems. IEEE Transactions on Automatic Control, 48(11):1936-1950, November 2003. details
  11. L. Hélouet. Distributed system requirements modeling with Message Sequence Charts. International Journal of Information and Software Technology, 2002. details
  12. L. Hélouet, C. Jard, B. Caillaud. An Event Structure Semantics for Message Sequence Charts. Mathematical Structures in Computer Science (MSCS) journal, 12(4):377-403, 2002. details
  13. A. Benveniste, B.C. Levy, E. Fabre, P. Le Guernic. A Calculus of Stochastic Systems for the Specification, Simulation, and Hidden State Estimation of Mixed Stochastic/NonStochastic Systems. Theoretical Computer Science, 152:171-217, 1995. details

International Conferences

  1. E. Elkind, B. Genest, D. Peled. Detecting Races in Ensembles of Message Sequence Charts. In TACAS, Volume LNCS 4424, Pages 420-434, 2007. details
  2. E. Elkind, B. Genest, D. Peled, P. Spoletini. Quantifying the Discord: Order Discrepancies in Message Sequence Charts. In ATVA, LNCS, Pages 378-393, 2007. details
  3. T. Gazagnaire, B. Genest, L. Hélouet, P.S. and Yang, S. Thiagarajan. Causal Message Sequence Charts. In Proceedings of CONCUR 2007, 2007. details
  4. T. Gazagnaire, L. Hélouet. Reconstructing Causal Ordering with boxed pomsets. In Proceedings of FORTE 2007, 2007. details
  5. A. Madalinski, E. Fabre. Modular Construction of Finite and Complete Prefixes. In UFO, Workshop on Unfoldings and Partial Order Techniques, Pages 69