Bounded time-stamping in message-passing systems

Theoretical Computer Science

Volumn 290, Issue 1, 2003, Pages 221-239

  Mukund, Madhavan ^a   Narayan Kumar, K ^a   Sohoni, Milind ^b  

^a CHENNAI MATHEMATICAL INSTITUTE   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Bounded time stamping; Finite state systems; Labeled partial orders; Message passing systems

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTER SIMULATION; FINITE AUTOMATA; NETWORK PROTOCOLS;

MESSAGE PASSING SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0037209792     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00329-2     Document Type: Article

References (20)

1. Alur R., Yannakakis M. Model checking of message sequence charts. Baeten J.C.M., Mauw S. Proc. CONCUR'99. Springer Lecture Notes in Computer Science. Vol. 1664:1999;114-129 Springer, Berlin.
2. Chandy K.M., Lamport L. Distributed snapshots: determining global states of distributed systems. ACM Trans. Comput. Systems. 3(1):1985;63-75.
3. Cori R., Metivier Y. Approximations of a trace, asynchronous automata and the ordering of events in a distributed system. Lepistö T., Salomaa A. Proc. ICALP '88. Springer Lecture Notes in Computer Science. Vol. 317:1988;147-161 Springer, Berlin.
4. Cori R., Metivier Y., Zielonka W. Asynchronous mappings and asynchronous cellular automata. Inform. Comput. 106:1993;159-202.
5. D. Dolev, N. Shavit, Bounded concurrent time-stamps are constructible, Proc. ACM STOC, 1989, pp. 454-466.
6. C. Dwork, O. Waarts, Simple and efficient bounded concurrent time-stamping or bounded concurrent time-stamps are comprehensible, Proc. 24th ACM STOC, 1992, pp. 655-666.
7. J.G. Henriksen, M. Mukund, K. Narayan Kumar, P.S. Thiagarajan, Towards a theory of regular MSC languages, Report RS-99-52, BRICS, Computer Science Department, Aarhus University, Denmark, 1999.
8. A. Israeli, M. Li, Bounded time-stamps, Proc. 28th IEEE FOCS, 1987, pp. 371-382.
9. S. Krishnamurthy, M. Mukund, Implementing causal ordering with bounded time-stamps, Report TCS-95-7, Chennai Mathematical Institute, Chennai, India, 1995.
10. Lamport L. Time, clocks and the ordering of events in a distributed system. Comm. ACM. 17(8):1978;558-565.
11. Lamport L., Lynch N. Distributed computing: Models and methods. van Leeuwen J. Handbook of Theoretical Computer Science. Vol. B:1990;1157-1200 North-Holland, Amsterdam.
12. Mukund M., Narayan Kumar K., Radhakrishnan J., Sohoni M. Robust asynchronous protocols are finite-state. Larsen K.G., Skyum S., Winskel G. Proc. ICALP '98. Springer Lecture Notes in Computer Science. Vol. 1443:1998;188-199 Springer, Berlin.
13. Mukund M., Sohoni M. Keeping track of the latest gossip in a distributed system. Distributed Computing. 10(3):1997;137-148.
14. M. Mukund, P.S. Thiagarajan, Linear time temporal logics over Mazurkiewicz traces, in: W. Penczek, A. Szalas (Eds.), Proc. MFCS '96, Springer Lecture Notes in Computer Science, Vol. 1113, Springer, Berlin, 1996, pp. 32-62.
15. A. Muscholl, D. Peled, Message sequence graphs and decision problems on Mazurkiewicz traces, in: M. Kutylowski, L. Pacholski, T. Wierzbicki (Eds.), Proc. MFCS'99, Springer Lecture Notes in Computer Science, Vol. 1672, Springer, Berlin, 1999, pp. 81-91.
16. Rudolph E., Graubmann P., Grabowski J. Tutorial on message sequence charts. Computer Networks and ISDN Systems. 28(12):1996;1629-1641.
17. Raynal M., Schiper A., Toueg S. The causal ordering abstraction and a simple way to implement it. Inform. Proc. Lett. 39:1991;343-350.
18. A. Schiper, J. Eggli, A. Sandoz, A new algorithm to implement causal ordering, in: J.-C. Bermond, M. Raynal (Eds.), Proc. 3rd Int. Workshop on Distributed Algorithms, Nice, Springer Lecture Notes in Computer Science, Vol. 392, Springer, Berlin, 1989, pp. 219-232.
19. S. Yadulla, Global states of distributed systems, M. Tech Thesis, Department of Computer Science and Engineering, Indian Institute of Technology Bombay, 1999.
20. Zielonka W. Notes on finite asynchronous automata. R.A.I.R.O. - Inf. Théor. et Appl. 21:1987;99-135.