Abstract
We present the architecture of Marrella, a tool designed for simulation and verification of distributed systems. The input of the tool is an event driven language whereas the underlying model is event structures. It gives the possibilities of generating one, some or all the executions of any distributed program. We have tested the tool for the verification of an embedded system. The corresponding results are reported here as well as those obtained with equivalent tools applied to the same case study. These experimental results show then the efficiency of Marrella.
Chapter PDF
Similar content being viewed by others
References
Ambroise, D., Rozoy, B. Marrella: a tool to analyse the graph of states. In: Parallel Processing Letters. Vol 6, no4, 583–594. (1996)
K. Bouchefra, Formal model for road traffic collision risk avoidance. In: IFAC-IFIP Conference on Control of Industrial Systems (Crujic, Borne, Ferney, Ed.). Elsevier Science Ltd. Belfort, France (1997).
J. Esparza, S. Römer, An unfolding algorithm for synchronous product of transition systems, In: Proceedings of the 12th International Conference on Concurrency Theory, Concur’99, Eindhoven, The Netherlands, August 1999, LNCS. n°1664, 2–20, 1999
ESTELLE: A Formal Description Based on an Extended State Transition Model. ISO-9074, Geneva (1988)
A. Mazurkiewicz, Trace Theory, Advanced Course on Petri Nets, In: Bad Honnef, Germany LNCS n°254, 269–324.
SDL: Recommendation Z. 100, Specification and Description Language. ITU-T, Geneva (1988)
G. Winskel, M. Nielsen, Models for concurrency, In: Handbook of Logic in Computer Science (S. Abramsky, DM. Gabbay, TSE. Maibaum eds.).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ambroise, D., Augé, P., Bouchefra, K., Rozoy, B. (2001). Marrella and the Verification of an Embedded System. In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive