Advertisement

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

  • Roman Dubtsov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7162)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Dill, D.L.: A theory of timed automat. Theoretical Computer Science 126(2), 183–235 (1994)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Bednarczyk, M.A.: Categories of asynchronous systems. PhD thesis, University of Sussex, UK (1987)Google Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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. 5.
    McLane, S.: Categories for the working mathematician. Graduate Texts in Mathematics. Springer, Berlin (1971)Google Scholar
  6. 6.
    Sassone, V., Nielsen, M., Winskel, G.: Models for concurrency: towards a classification. Theoretical Computer Science 170(1-2), 297–348 (1996)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Shields, M.W.: Concurrent Machines. The Computer Journal 28(5), 449–465 (1985)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Virbitskaite, I.B., Dubtsov, R.S.: Semantic domains of timed event structures. Programming and Computer Software 34(3), 125–137 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 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. 10.
    Winskel, G., Nielsen, M.: Models for concurrency. Handbook of Logic in Computer Science 4, 1–148 (1995)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Roman Dubtsov
    • 1
  1. 1.Institute of Informatics SystemSB RASNovosibirskRussia

Personalised recommendations