Marrella: A tool for simulation and verification

  • Dominique Ambroise
  • Brigitte Rozoy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1102)


This paper presents the structure of our tool Marrella the construction of which has been motivated by practical problems in the context of simulation and parallel program debugging, where the correct evaluation of global properties requires a careful analysis of the causal structure of the execution. The underlying model is based on prime event structures that are considered as exhibiting all the behaviors of distributed programs: the tool gives the possibilities of generating one, some or all of their executions. On one hand, a careful implementation spares memory; on the other hand, precise and neat algorithms benefit from the trace properties of prime event structures and thus gain in avoiding the enumerations of equivalent interleavings.


  1. [Amb. 96]
    D. Ambroise, Marrella ou la simulation guidée d'algorithmes répartis sur réseaux, thèse de l'université de Paris 11, en préparation.Google Scholar
  2. [Amb. Roz. 96]
    D. Ambroise, B. Rozoy, Using Event Structures for the effficient analysis of states graphs, T.R. 96, Paris-Orsay University.Google Scholar
  3. [Esp. 93]
    J. Esparza, Model checking using net unfoldings, TapSoft'93, Orsay, LNCS n∘ 668, 613–628.Google Scholar
  4. [Fer. Mou. Jar. Jér. 92]
    J.C. Fernandez, L. Mounier, C. Jard, T. Jéron, On the fly verification of finite transition systems, Formal Methods in System Design, Kluwer, 251–273.Google Scholar
  5. [God. Wol. 91]
    P. Godefroid, P. Wolper, Using Partial Orders for the efficient verification of deadlock freedom and safety properties, CAV'91, LNCS n∘575, 332–342.Google Scholar
  6. [Kat. Pel. 92]
    S. Katz, D. Peied, Verification of distributed programs using representative interleaving sequences, Distributed Computing 6, 107–120.Google Scholar
  7. [Lam. 78]
    L. Lamport, Time, clocks and the ordering of events in a distributed system, Communications of the ACM, 21(7), 558–565, July 1978.CrossRefGoogle Scholar
  8. [MacM. 92]
    K. L. MacMillan, Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits, CAV'92, LNCS n∘663, p. 164–177.Google Scholar
  9. [Maz. 87]
    A. Mazurkiewicz, Trace Theory, Advanced Course on Petri Nets, Bad Honnef, Germany LNCS n∘ 254, 269–324.Google Scholar
  10. [Nie. Plo. Win. 81]
    M. Nielsen, G. Plotkin, G. Winskel, Petri Nets, Event Structures and Domains, Theor. Comp. Sci. 13 (1981) p. 85–108.CrossRefGoogle Scholar
  11. [Pel. 94]
    D. Peled, Combining partial order reduction with on-the-fly model checking, Proc. 6th Int. Conf. on computer aid verification, Greece, CAV'93, 409–423.Google Scholar
  12. [Val. 93]
    A. Valmari, On the fly verification with stubborn sets, Proc. 5th Int. Conf. on computer aid verification, Greece, CAV'93, 397–408.Google Scholar
  13. [Wins. Niel. 95]
    G. Winskel, M. Nielsen, Models for concurrency, in Handbook of Logic in Computer Science (S. Abramsky, DM. Gabbay, TSE. Maibaum eds.).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Dominique Ambroise
    • 1
  • Brigitte Rozoy
    • 2
  1. 1.G.R.E.Y.C.Université de Caen et URA 1526 CNRSCaen cedex
  2. 2.L.R.I.Université de Paris XI et URA 410 CNRSOrsay cedexFrance

Personalised recommendations