Abstract
Event structures have come to play an important role in the formal study of the behaviour of distributed systems. The advantage of event structures is that they explicitly exhibit the interplay between concurrency and nondeterminism. In [14], it has been shown that event structures are closely related to Scott domains. The intention of the paper is to extend Winskel’s approach to a real-time version of event structures, obtaining a coreflection between categories of the models.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alur, R., Dill, D.: The theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)
Abramsky, S., Jung, A.: Domain theory. Handbook of Logic in Computer Science, vol. 3. Clarendon Press (1994)
Aceto, L., Murphi, D.: Timing and causality in process algebra. Acta Informatica 33(4), 317–350 (1996)
Casley, R.T., Crew, R.F., Meseguer, J., Pratt, V.R.: Temporal structures. Mathematical Structures in Computer Science 1(2), 179–213 (1991)
Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: An event structure semantics for general Petri nets. Theoretical Computer Science 153, 129–170 (1996)
Henzinger, T.A., Manna, Z., Pnueli, A.: Timed transition systems. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600, pp. 226–251. Springer, Heidelberg (1992)
Katoen, J.-P.: Quantative and qualitative extensions of event structures. PhD thesis, University of Twente (1996)
Lilius, J.: Efficient state space search for time Petri nets. In: MFCS 1998 Workshop on Concurrency 1998. FIMU Report Series, FIMU RS-98-06, pp. 123–130 (1998)
Murphy, D.: Time and duration in noninterleaving concurrency. Fundamenta Informaticae 19, 403–416 (1993)
MacLane, S.: Categories for the working mathematician. GTM. Springer, Heidelberg (1971)
Mesguer, J., Montanari, U., Sasonne, V.: Process versus unfolding semantics for Place/Transition Petri nets. Theoretical computer science 153, 171–210 (1996)
Maggiolo-Schettini, A., Winkowski, J.: Towards an algebra for timed behaviours. Theoretical Computer Science 103, 335–363 (1992)
Varacca, D., Völzer, H., Winskel, G.: Probabilistic event structures and domains. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 481–496. Springer, Heidelberg (2004)
Winskel, G.: Event Structures. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)
Winskel, G., Nielsen, N.: Models for concurrency. Handbook of Logic in Computer Science, vol. 4 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dubtsov, R.S. (2005). Real-Time Event Structures and Scott Domains. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_4
Download citation
DOI: https://doi.org/10.1007/11535294_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28126-9
Online ISBN: 978-3-540-31826-2
eBook Packages: Computer ScienceComputer Science (R0)