Skip to main content
SpringerLink
Log in

Real-Time Stable Event Structures and Marked Scott Domains: An Adjunction

  • Conference paper
Perspectives of Systems Informatics (PSI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4378))

  • 547 Accesses

Abstract

Event structures constitute a major branch of models for concurrency. Their advantage is that they explicitly exhibit the interplay between concurrency and nondeterminism. In a seminal work, Winskel has shown that categories of prime and stable event structures can be related to a category of Scott domains by adjunctions. The intention of this note is to show the applicability of the theory-categorical framework to a real-time extension of stable event structures, in order to identify suitable semantical domains for the models. To that end, we first introduce a category \({\mathbf{\underline{TSES}}}\) of real-time stable event structures, and a category \({\mathbf{\underline{MDom}}}\) of a particular class of Scott domains, called marked Scott domains, and then define an adjunction between \({\mathbf{\underline{TSES}}}\) and \({\mathbf{\underline{MDom}}}\).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Dill, D.: The theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Abramsky, S., Jung, A.: Domain theory. In: Handbook of Logic in Computer Science, vol. 3, Clarendon Press, Oxford (1994)

    Google Scholar 

  3. Aceto, L., Murphi, D.: Timing and causality in process algebra. Acta Informatica 33(4), 317–350 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Casley, R.T., et al.: Temporal structures. Mathematical Structures in Computer Science 1(2), 179–213 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Degano, P., Gorrieri, R., Vigna, S.: On Relating Some Models for Concurrency. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol. 668, pp. 15–30. Springer, Heidelberg (1993)

    Google Scholar 

  6. Dubtsov, R.: Real-Time Event Structures and Scott Domains. In: Malyshkin, V.E. (ed.) PaCT 2005. LNCS, vol. 3606, pp. 29–32. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. 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)

    Article  MATH  MathSciNet  Google Scholar 

  8. Henzinger, T.A., Manna, Z., Pnueli, A.: Timed transition systems. In: Huizing, C., et al. (eds.) REX 1991. LNCS, vol. 600, pp. 226–251. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  9. Katoen, J.-P.: Quantitative and qualitative extensions of event structures. Ph.D. thesis, University of Twente (1996)

    Google Scholar 

  10. Lilius, J.: Efficient state space search for time Petri nets. In: Proc. MFCS’98 Workshop on Concurrency, Brno, Czech Republic, August 1998, FIMU Report Series, FIMU RS-98-06, pp. 123–130 (1998)

    Google Scholar 

  11. Droste, M.: Event Structures and Domains. Theoretical Computer Science 68, 37–47 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  12. Murphy, D.: Time and duration in noninterleaving concurrency. Fundamenta Informaticae 19, 403–416 (1993)

    MATH  MathSciNet  Google Scholar 

  13. MacLane, S.: Categories for the working mathematician. GTM. Springer, Heidelberg (1971)

    Google Scholar 

  14. Mesguer, J., Montanari, U., Sasonne, V.: Process versus unfolding semantics for Place/Transition Petri nets. Theoretical Computer Science 153, 171–210 (1996)

    Article  MathSciNet  Google Scholar 

  15. Maggiolo-Schettini, A., Winkowski, J.: Towards an algebra for timed behaviours. Theoretical Computer Science 103, 335–363 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  16. Nielsen, M., Winskel, G.: Petri Nets and Bisimulation. Theoretical Computer Science 153, 211–244 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  17. Nygaard, M., Winskel, G.: Domain Theory For Concurrency. Theoretical Computer Science 103, 153–190 (2004)

    Article  MathSciNet  Google Scholar 

  18. Virbitskaite, I.B., Gribovskaya, N.S.: Open maps and observational equivalences for timed partial order models. Fundamenta Informaticae 60(1-4), 383–399 (2004)

    MATH  MathSciNet  Google Scholar 

  19. 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)

    Google Scholar 

  20. Winskel, G.: Event Structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)

    Google Scholar 

  21. Winskel, G.: An Introduction to Event Structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, pp. 364–397. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  22. Winskel, G., Nielsen, N.: Models for concurrency. In: Handbook of Logic in Computer Science, vol. 4, Clarendon Press, Oxford (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. A.P. Ershov Institute of Informatics Systems, Siberian Division of the Russian Academy of Sciences, 6, Acad. Lavrentiev avenue, 630090, Novosibirsk, Russia

    R. S. Dubtsov

Authors
  1. R. S. Dubtsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Irina Virbitskaite Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubtsov, R.S. (2007). Real-Time Stable Event Structures and Marked Scott Domains: An Adjunction. In: Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2006. Lecture Notes in Computer Science, vol 4378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70881-0_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70881-0_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70880-3

  • Online ISBN: 978-3-540-70881-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation