Abstract
Lamport diagrams are partial orders which depict computations of message passing systems. It is natural to consider generalizations of linear time temporal logics over such diagrams. In [MR00], we presented a decidable temporal logic with local temporal modalities and a global ‘previous’ modality to talk of message receipts. It seems reasonable to extend the logic with a global ‘next’ modality as well, so that sending of messages may also be easily specified, but this (or other similar attempts) lead to undecidability. Hence we consider ways of restricting the models so as to obtain decidability, while retaining the expressiveness of global ‘next’ and global ‘previous’ modalities. For this, we consider Lamport diagrams presented as a sequence of layers. The layers themselves describe finite communication patterns and a diagram is obtained by sequential composition of such parallel processes. The logic is defined appropriately, with layer formulas describing processes within a layer, and temporal formulas describing the sequence of layers in the computation. When the number of events in layers is uniformly bounded and each layer is communication closed, we get decidability. Alternatively, a stronger uniform bound on what we term channel capacity also yields decidability. We present an example of system specification in the logic.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alur, R., Holzmann, G. J. and Peled, D., “An analyzer for message sequence charts”, Software Concepts and Tools, 17(2), 1996, 70–77.
Alur, R., Peled, D. and Penczek, W., “Model checking of causality properties”, Proc. LICS, 1995, 90–100.
Alur, R. and Yannakakis, M., “Model checking of message sequence charts”, Proc. CONCUR 1999, Springer-Verlag LNCS 1664, 1999, 114–129.
Bollig, B. and Leucker, M., “Modelling, specifying and verifying message passing systems”, Proc. TIME 2001, 2001, 240–247.
Elrad, T. and Francez, N., “Decomposition of distributed programs into communication closed layers”, Science of Computer Programming, 2, 1982, 155–173.
Gunter, E., Muscholl, A. and Peled, D., “Compositional message sequence charts”, Proc. TACAS 2001, Springer-Verlag LNCS 2031, 2001, 496–511.
Henriksen, J.G., Mukund, M., Narayan Kumar and Thiagarajan, P.S., “Regular collections of message sequence charts”, Proc. MFCS 2000, Springer-Verlag LNCS 1893, 2000, 405–414.
Lamport, L., “Time, clocks and ordering of events in a distributed system”, Communications of ACM 21(7), 1978, 558–565.
Madhusudan, P., “Reasoning about sequential and branching behaviours of message sequence graphs”, Proc. ICALP 2001, Springer-Verlag LNCS 2076, 2001, 396–407.
Madhusudan, P. and Meenakshi, B., “Beyond message sequence graphs”, Proc. FST & TCS 2001, Springer-Verlag LNCS 2245, 2001, 256–267.
Meenakshi, B. and Ramanujam, R., “Reasoning about message passing in finite state environments”, Proc. ICALP 2000, LNCS 1853, 2000, 487–498.
Meenakshi, B. and Ramanujam, R., “Reasoning about layered message passing systems”, full version, http://www.imsc.res.in/~bmeena.
Peled, D., “Specification and verification of message sequence charts”, In Proc. IFIP FORTE/PSTV, 2000, 139–154.
Poel, M. and Zwiers, J., “Layering techniques for development of parallel systems”, Proc. CAV, 1992, 16–29.
Ramanujam, R., “Locally linear time temporal logic”, Proc. LICS, 1996, 118–127.
Rudolph, E., Graubmann, P. and Grabowski, J., “Tutorial on message sequence charts”, Computer Networks and ISDN Systems-SDL and MSC, Vol. 28, 1996, 1629–1641.
Thiagarajan, P.S., “A trace based extension of propositional linear time temporal logic”, Proc. LICS, 1994, 438–447.
ITU-TS Recommendation Z.120-Message sequence chart, ITU-TS, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meenakshi, B., Ramanujam, R. (2003). Reasoning about Layered Message Passing Systems. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2003. Lecture Notes in Computer Science, vol 2575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36384-X_22
Download citation
DOI: https://doi.org/10.1007/3-540-36384-X_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00348-9
Online ISBN: 978-3-540-36384-2
eBook Packages: Springer Book Archive