Skip to main content

Timed Transition Systems with Independence and Marked Scott Domains: An Adjunction

  • Conference paper
Book cover Perspectives of Systems Informatics (PSI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7162))

  • 497 Accesses

Abstract

The intention of this paper is to introduce a timed extension of transition systems with independence, and to study its categorical interrelations with other timed ”true-concurrent” models. In particular, we show the existence of a chain of coreflections leading from a category of the model of timed transition systems with independence to a category of a specially defined model of marked Scott domains. As an intermediate semantics we use a model of timed event structures, able to properly capture the dependencies and conflict among events which arise in the presence of time delays of the events.

This work is supported in part by DFG-RFBR (grant No 436 RUS 113/1002/01, grant No 09-01-91334).

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

Access this chapter

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.L.: A theory of timed automat. Theoretical Computer Science 126(2), 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bednarczyk, M.A.: Categories of asynchronous systems. PhD thesis, University of Sussex, UK (1987)

    Google Scholar 

  3. Henzinger, T., 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)

    Chapter  Google Scholar 

  4. Hildebrandt, T.T., Sassone, V.: Comparing Transition Systems with Independence and Asynchronous Transition Systems. In: International Conference on Concurrency Theory, pp. 84–97 (1996)

    Google Scholar 

  5. McLane, S.: Categories for the working mathematician. Graduate Texts in Mathematics. Springer, Berlin (1971)

    Google Scholar 

  6. Sassone, V., Nielsen, M., Winskel, G.: Models for concurrency: towards a classification. Theoretical Computer Science 170(1-2), 297–348 (1996)

    MathSciNet  MATH  Google Scholar 

  7. Shields, M.W.: Concurrent Machines. The Computer Journal 28(5), 449–465 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  8. Virbitskaite, I.B., Dubtsov, R.S.: Semantic domains of timed event structures. Programming and Computer Software 34(3), 125–137 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

  10. Winskel, G., Nielsen, M.: Models for concurrency. Handbook of Logic in Computer Science 4, 1–148 (1995)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubtsov, R. (2012). Timed Transition Systems with Independence and Marked Scott Domains: An Adjunction. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2011. Lecture Notes in Computer Science, vol 7162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29709-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29709-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29708-3

  • Online ISBN: 978-3-642-29709-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics