Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boudol, G. and Castellani, I., “Flow models of distributed computations: event structures and nets”, Rapports de Recherche 1482, IN- RIA, July 1991.
Droste, M., “Event structures and domains”, Theoretical Computer Science, vol. 68, 1989, 37–47.
Halpern, J., and Moses, Y., “Knowledge and Common Knowledge in a Distributed Environment”, J ACM, vol. 37, 1991, 549–578.
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.
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.
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.
Mazurkiewicz, A., “Basic notions of trace theory”, LNCS 354, 1989, 285–363.
Mukund, M., “Petri nets and step transition systems”, Int. J. Found. Comp. Set., vol. 3, 4, 1992, 443–478.
Mukund, M. and Sohoni, M., “Keeping track of the latest gossip: bounded time-stamps suffice”, LNCS 761, 1993, 388–399.
Nielsen, M., Rozenberg, G., and Thiagarajan, P.S., “Behavioural notions for elementary net systems”, Distr. Compute vol. 4, 1990, 45–57.
Thiagarajan, P.S., “A trace based extension of propositional linear time temporal logic”, Proc IEEE LICS, 1994, 438–447.
WN] Winskel, G., and Nielsen, M., “Models for concurrency”, in Handbook of Logic in Computer Science, Eds: Abramsky, Gabbay and Maibaum, Oxford Science Publications.
Zielonka, W., “Notes on finite asynchronous automata”, RAIRO-Inf. Theor. et Appli., vol. 21, 1987, 99–135.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 British Computer Society
About this paper
Cite this paper
Ramanujam, R. (1995). A Local Presentation of Synchronizing Systems. In: Desel, J. (eds) Structures in Concurrency Theory. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3078-9_18
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3078-9_18
Publisher Name: Springer, London
Print ISBN: 978-3-540-19982-3
Online ISBN: 978-1-4471-3078-9
eBook Packages: Springer Book Archive