A Local Presentation of Synchronizing Systems

  • R. Ramanujam
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


We study systems of sequential agents which communicate by synchronization, whose behaviours are given by a subclass of event structures. Transition system models for such structures typically require global state information which cannot be obtained by taking products of local transition systems. We offer a presentation whereby the notion of local state is modified, and an appropriate product operation precisely captures this class of behaviours. This is shown using a back-and-forth construction.


Transition System Global State Event Occurrence Label Transition System Linear Time Temporal Logic 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BC]
    Boudol, G. and Castellani, I., “Flow models of distributed computations: event structures and nets”, Rapports de Recherche 1482, IN- RIA, July 1991.Google Scholar
  2. [Dro]
    Droste, M., “Event structures and domains”, Theoretical Computer Science, vol. 68, 1989, 37–47.CrossRefMATHMathSciNetGoogle Scholar
  3. [HM]
    Halpern, J., and Moses, Y., “Knowledge and Common Knowledge in a Distributed Environment”, J ACM, vol. 37, 1991, 549–578.MathSciNetGoogle Scholar
  4. [KR]
    Krasucki, P., and Ramanujam, R., “Knowledge and the ordering of events in distributed systems”, TARK V, Theoretical Aspects of Reasoning about Knowledge, 1994, 267–283.Google Scholar
  5. LPRT] Lodaya, K., Parikh, R., Ramanujam, R. and Thiagarajan, P.S., “A logical study of distributed transition systems”, Report IMSc/92/07 1992, to appear in Information and Computation.Google Scholar
  6. [LRT]
    Lodaya, K., and Ramanujam, R., and Thiagarajan, P.S., “Temporal Logics for Communicating Sequential Agents: I”, Int. J. Found. Comp. Setvol. 3, 2, 1992, 117–159.CrossRefMATHMathSciNetGoogle Scholar
  7. [Maz]
    Mazurkiewicz, A., “Basic notions of trace theory”, LNCS 354, 1989, 285–363.MathSciNetGoogle Scholar
  8. [Muk]
    Mukund, M., “Petri nets and step transition systems”, Int. J. Found. Comp. Set., vol. 3, 4, 1992, 443–478.CrossRefMATHMathSciNetGoogle Scholar
  9. [MS]
    Mukund, M. and Sohoni, M., “Keeping track of the latest gossip: bounded time-stamps suffice”, LNCS 761, 1993, 388–399.MathSciNetGoogle Scholar
  10. [NRT]
    Nielsen, M., Rozenberg, G., and Thiagarajan, P.S., “Behavioural notions for elementary net systems”, Distr. Compute vol. 4, 1990, 45–57.MathSciNetGoogle Scholar
  11. [Thi]
    Thiagarajan, P.S., “A trace based extension of propositional linear time temporal logic”, Proc IEEE LICS, 1994, 438–447.Google Scholar
  12. WN] Winskel, G., and Nielsen, M., “Models for concurrency”, in Handbook of Logic in Computer Science, Eds: Abramsky, Gabbay and Maibaum, Oxford Science Publications.Google Scholar
  13. [Zie]
    Zielonka, W., “Notes on finite asynchronous automata”, RAIRO-Inf. Theor. et Appli., vol. 21, 1987, 99–135.MATHMathSciNetGoogle Scholar

Copyright information

© British Computer Society 1995

Authors and Affiliations

  • R. Ramanujam
    • 1
  1. 1.The Institute of Mathematical SciencesMadrasIndia

Personalised recommendations