[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Semantic domains of timed event structures

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In the paper, timed extensions of various classes of event structures and marked Scott domains are studied, categories of these models are constructed, and their properties are examined. In addition, based on category-theoretic methods, relationship between the timed structures and marked Scott domains is established.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Winskel, G., Events in Computation, PhD Dissertation, University of Edinburgh, 1980.

  2. Nielsen, M., Plotkin, G., and Winskel, G., Petri Nets, Event Structures and Domains, Theoretical Comput. Sci., 1981, vol. 13, no. 1, pp. 85–108.

    Article  MATH  MathSciNet  Google Scholar 

  3. Nielsen, M., Rosenberg, G., and Thiagarajan, P.S., Behavioural Notions for Elementary Net Systems, Distributed Computing, 1990, vol. 4, pp. 45–57.

    Article  MathSciNet  Google Scholar 

  4. Winskel, G., Event Structures, Lecture Notes Comput. Sci., 1986, vol. 255, pp. 325–392.

    MathSciNet  Google Scholar 

  5. Boudol, G. and Castellani, I., Concurrency and Atomicity, Theoretical Comput. Sci., 1989, vol. 59, pp. 25–84.

    Article  MathSciNet  Google Scholar 

  6. Darondeau, Ph. and Degano, P., Event Structures, Causal Trees, and Refinement, Lecture Notes Comput. Sci., 1990, vol. 452, pp. 239–245.

    MathSciNet  Google Scholar 

  7. Langerak, R., Bundle Event Structures: A Non-interleaving Semantics for LOTOS. Formal Description Techniques V, IFIP Trans., 1993, vol. C-10.

  8. Degano, P., Gorrieri, R., and Vigna, S., On Relating Some Models for Concurrency, Lecture Notes Comput. Sci., 1993, vol. 668, pp. 15–30.

    MathSciNet  Google Scholar 

  9. Pinna, G.M. and Poigné, A., On the Nature of Events: Another Perspectives in Concurrency, Theoretical Comput. Sci., 1995, vol. 138, no. 2, pp. 425–454.

    Article  MATH  Google Scholar 

  10. Hoogers, P.W., Kliejn, H.C.M., and Thiagarajan, P.S., An Event Structure Semantics for General Petri Nets, Theoretical Comput. Sci., 1996, vol. 153, pp. 129–170.

    Article  MATH  Google Scholar 

  11. Van Glabbeek, R.J. and Plotkin, G.D., Event Structures for Resolvable Conflict, Lecture Notes Comput. Sci., 2004, vol. 3153, pp. 550–561.

    Google Scholar 

  12. Van Glabbeek, R.J., On the Expressiveness of Higher Dimensional Automata, Theoretical Comput. Sci., 2006, vol. 356, no. 3, pp. 265–290.

    Article  MATH  Google Scholar 

  13. Van Glabbeek, R.J. and Goltz, U., Refinement of Actions and Equivalence Notions for Concurrent Systems, Acta Informatica, 2001, vol. 37, pp. 229–327.

    Article  MATH  MathSciNet  Google Scholar 

  14. Van Glabbeek, R.J. and Vaandrager, F.W., Bundle Event Structures and CCSP, Lecture Notes Comput. Sci., 2003, vol. 2761, pp. 57–71.

    Article  Google Scholar 

  15. MacLane, S., Categories for the Working Mathematician, GTM, Springer, 1971.

    Google Scholar 

  16. Nielsen, M. and Winskel, G., Petri Nets and Bisimulation, Theoretical Comput. Sci., 1996, vol. 153.

  17. Winskel, G. and Nielsen, M., Models for Concurrency, Handbook Logic Comput. Sci., 1995, vol. 4.

  18. Nygaard, M. and Winskel, G., Domain Theory for Concurrency, Theoretical Comput. Sci., 2004, vol. 103, pp. 153–190.

    Article  MathSciNet  Google Scholar 

  19. Mesguer, J., Montanari, U., and Sassone, V., Process Versus Unfolding Semantics for Place/Transition Petri Nets, Theoretical Comput. Sci., 1996, vol. 153, pp. 171–210.

    Article  Google Scholar 

  20. Varacca, D., Völzer, H., and Winskel, G., Probabilistic Event Structures and Domains, Lecture Notes Comput. Sci., 2004, vol. 3170, pp. 481–496.

    Article  Google Scholar 

  21. Alur, R. and Dill, D., The Theory of Timed Automata, Theoretical Comput. Sci., 1994, vol. 126, pp. 183–235.

    Article  MATH  MathSciNet  Google Scholar 

  22. Henzinger, T.A., Manna, Z., and Pnueli, A., Timed Transition Systems, Lecture Notes Comput. Sci., 1991, vol. 600, pp. 226–251.

    MathSciNet  Google Scholar 

  23. Schneider, S. and Davies, J., et al., Timed CSP: Theory and Practice, Lecture Notes Comput. Sci., 1991, vol. 600, pp. 640–675.

    Google Scholar 

  24. Katoen, J.-P., Quantitative and Qualitative Extensions of Event Structures, PhD Dissertation, Twente University, 1996.

  25. Andreeva, M.V. and Virbitskaite, I.B., Observational Timed Equivalences for Timed Stable Event Structures, Fundamenta Informaticae, 2006, vol. 72, no. 4, pp. 1–19.

    MATH  MathSciNet  Google Scholar 

  26. Murphy, D., Time and Duration in Noninterleaving Concurrency, Fundamenta Informaticae, 1993, vol. 19, pp. 403–416.

    MATH  MathSciNet  Google Scholar 

  27. Virbitskaite, I.B. and Gribovskaya, N.S., Open Maps and Observational Equivalences for Timed Partial Order Models, Fundamenta Informaticae, 2004, vol. 60, no. 1–4, pp. 383–399.

    MATH  MathSciNet  Google Scholar 

  28. Dubtsov, R., Real-Time Stable Event Structures and Marked Scott Domains, Lecture Notes Comput. Sci., 2007, vol. 4378, pp. 329–332.

    Google Scholar 

  29. Aura, T. and Lilius, J., Time Processes for Time Petri Nets, Lecture Notes Comput. Sci., 1997, vol. 1248, pp. 136–155.

    MathSciNet  Google Scholar 

  30. Valero, V., de Frutos, D., and Cuartero, F., Timed Processes of Timed Petri Nets, Lecture Notes Comput. Sci., 1995, vol. 935, pp. 490–509.

    Google Scholar 

  31. Ghezzi, C., Mandrioli, D., Moraska, S., and Pezze, M., A General Way to Put Time in Petri Nets, Proc. 5th Int. Workshop on Software Specification and Design, Pittsburg, 1989, pp. 60–67.

  32. Merlin, P. and Faber, D.J., Recoverability of Communication Protocols, IEEE Trans. Commun., 1976, vol. COM-24, no. 9.

  33. Ramchandani, C., Analysis of Asynchronous Concurrent Systems by Timed Petri Nets, PhD Dissertation, Cambridge, Mass.: MIT, Dept., Electronical Engineering, 1974.

    Google Scholar 

  34. Fidge, C., A Constraint-Oriented Real-Time Process Calculus. Formal Description Techniques V, IFIP Trans., 1993, vol. C-10, pp. 363–378.

    Google Scholar 

  35. Casley, R.T., Crew, R.F., Meseguer, J., and Pratt, V.R., Temporal Structures, Math. Structures Comput. Sci., 1991, vol. 1, no. 2, pp. 179–213.

    MATH  MathSciNet  Google Scholar 

  36. Janssen, W., Poel, M., Wu, Q., and Zwiers, J., Layering of Real-Time Distributed Processes, Lecture Notes Comput. Sci., 1994, vol. 863, pp. 393–417.

    Google Scholar 

  37. Maggiolo-Schettini, A. and Winkovski, J., Towards an Algebra for Timed Behaviours, Theoretical Comput. Sci., 1992, vol. 103, pp. 335–363.

    Article  MATH  Google Scholar 

  38. Aceto, L. and Murphi, D., Timing and Causality in Process Algebra, Acta Informatica, 1996, vol. 33, pp. 317–350.

    Article  MATH  MathSciNet  Google Scholar 

  39. Goltz, U. and Göts, N., Modelling a Simple Communication Protocol in a Language with Action Refinement, Draft Paper.

  40. Chatain, T. and Jaed, C., Time Supervision of Concurrent Systems Using Symbolic Unfoldings of Time Petri Nets, Lecture Notes Comput. Sci., 2005, vol. 3829, pp. 196–210.

    Google Scholar 

  41. Bouyer, P., Haddad, S., and Reynier, P.-A., Timed Unfoldings for Networks of Timed Automata, Lecture Notes Comput. Sci., 2006, vol. 4218, pp. 292–306.

    Article  Google Scholar 

  42. Bouyer, P., Haddad, S., and Reynier, P.-A., Extended Timed Automata and Time Petri Nets, Proc. of the 6th Int. Conf. on Application of Concurrency to System Design, 2006, pp. 91–100.

  43. Abramsky, S. and Jung, A., Domain Theory. Handbook of Logic in Computer Science, vol. 3, Clarendon, 1994.

Download references

Author information

Authors and Affiliations

  1. Ershov Institute of Informatics Systems, Siberian Branch, Russian Academy of Sciences, pr. Akademika Lavrent’eva 6, Novosibirsk, 630090, Russia

    I. B. Virbitskaite & R. S. Dubtsov

  2. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

    I. B. Virbitskaite

Authors
  1. I. B. Virbitskaite
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. S. Dubtsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. B. Virbitskaite.

Additional information

Original Russian Text © I.B. Virbitskaite, R.S. Dubtsov, 2008, published in Programmirovanie, 2008, Vol. 34, No. 3.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Virbitskaite, I.B., Dubtsov, R.S. Semantic domains of timed event structures. Program Comput Soft 34, 125–137 (2008). https://doi.org/10.1134/S0361768808030018

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768808030018

Keywords

Search

Navigation