Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 2002: Automata, Languages and Programming pp 525–536Cite as

Bialgebraic Modelling of Timed Processes

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2380))

Abstract

We give an abstract axiomatic account of timed processes using monoids and their (partial and total) actions. Subsequently, we present categorical formulations thereof, including a novel characterisation of partial monoid actions as coalgebras for an evolution comonad. Adapting the approach of Turi and Plotkin [24], we then exhibit an abstract theory of well-behaved operational rules suitable for timed processes and, for discrete time, also derive a concrete syntactic format encompassing all rules we found in the literature.

This work is supported by EPSRC grant GR/M56333.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Aczel and P. F. Mendler. A final coalgebra theorem. In D. H. Pitt, D. E. Rydeheard, P. Dybjer, A. M. Pitts, and A. Poigné, editors, Category Theory and Computer Science, LNCS 389, pp. 357–365, 1989. Springer.

    Chapter  Google Scholar 

  2. R. Alur and D. L. Dill A theory of timed automata. Theoretical Computer Science 25(2), pp. 183–235, 1994.

    Article  MathSciNet  Google Scholar 

  3. J.C.M. Baeten and J.W. Klop, editors. Concurrency Theory (CONCUR’ 90), LNCS 458, 1990. Springer.

    Google Scholar 

  4. J.C.M. Baeten and C.A. Middelburg. Process algebra with timing: real time and discrete time. In A. Ponse, and S. A. Smolka, editors. Handbook of Process Algebra. North-Holland, 2001 Bergstra et al. [5], chapter 10.

    Google Scholar 

  5. J. A. Bergstra, A. Ponse, and S. A. Smolka, editors. Handbook of Process Algebra. North-Holland, 2001.

    Google Scholar 

  6. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Computation 60, pp. 109–137, 1984.

    MATH  MathSciNet  Google Scholar 

  7. B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can’t be traced. Journal of the A CM 42(1), pp. 232–268, 1995.

    MATH  MathSciNet  Google Scholar 

  8. R.J. van Glabbeek. The linear time-branching time spectrum I; the semantics of concrete, sequential processes. In A. Ponse, and S. A. Smolka, editors. Handbook of Process Algebra. North-Holland, 2001 Bergstra et al. [5], chapter 1, pages 3–99.

    Google Scholar 

  9. M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation 117, pp. 221–239, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  10. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.

    Google Scholar 

  11. J.J.M. Hooman and W.P. de Roever. Design and verification in real-time distributed computing: an introduction to compositional methods. In E. Brinksma, G. Scollo, and Chris A. Vissers, editors. International Conference on Protocol Specification, Testing and Verification, 1989. North-Holland.

    Google Scholar 

  12. A. Jeffrey. A linear time process algebra. InA. Skou, editors. Computer Aided Verification (CAV’ 91), LNCS 575, 1991. Springer Larsen and Skou [14], pp. 432–442.

    Google Scholar 

  13. A. S. A. Jeffrey, S. A. Schneider, and F. W. Vaandrager. A comparison of additivity axioms in timed transition systems. Technical Report CS-R9366, CWI, 1993.

    Google Scholar 

  14. K.G. Larsen and A. Skou, editors. Computer Aided Verification (CAV’ 91), LNCS 575, 1991. Springer.

    Google Scholar 

  15. W. Lawvere. Metric spaces, generalized logic, and closed categories. In Rendiconti del Seminario Matematico e Fisico di Milano, XLIII. Tipografia Fusi, 1973.

    Google Scholar 

  16. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  17. F. Moller and C. Tofts. A temporal calculus of communicating systems. In J.W. Klop, editors. Concurrency Theory (CONCUR’ 90), LNCS 458, 1990. Springer Baeten and Klop [3], pp. 401–415.

    Chapter  Google Scholar 

  18. X. Nicollin and J. Sifakis. An overview and synthesis on timed process algebras. In A. Skou, editors. Computer Aided Verification (CAV’ 91), LNCS 575, 1991. Springer Larsen and Skou [14], pp. 376–398.

    Google Scholar 

  19. X. Nicollin and J. Sifakis. The algebra of timed processes, ATP: Theory and application. Information and Computation 114, pp. 131–178, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  20. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.

    Google Scholar 

  21. J. Power and H. Watanabe. Distributivity for a monad and a comonad. In B. Jacobs and J. Rutten, editors, Second Workshop on Coalgebraic Methods in Computer Science (CMCS’1999), volume 19 of ENTCS, 1999.

    Google Scholar 

  22. S. A. Schneider. An operational semantics for timed CSP. Technical Report PRG-TR-1-91, Oxford University, 1991.

    Google Scholar 

  23. D. Turi. Functorial Operational Semantics and its Denotational Dual. PhD thesis, Free University, Amsterdam, 1996.

    Google Scholar 

  24. D. Turi and G. Plotkin. Towards a mathematical operational semantics. In Twelfth Annual Symposium on Logic in Computer Science (LICS’ 97), pp. 280–291, 1997. IEEE Computer Society Press.

    Google Scholar 

  25. Y. Wang. Real-time behaviour of asynchronous agents. In J.W. Klop, editors. Concurrency Theory (CONCUR’ 90), LNCS 458, 1990. Springer Baeten and Klop [3], pp. 502–520.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LFCS, University of Edinburgh, Edinburgh, EH9 3JZ, Scotland

    Marco Kick

Authors
  1. Marco Kick
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Theoretical Computer Science, ETH Zentrum, ETH Zürich, 8092, Zürich, Switzerland

    Peter Widmayer  & Stephan Eidenbenz  & 

  2. Department of Languages and Sciences of the Computation E.T.S. de Ingeniería Informática, University of Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Francisco Triguero , Rafael Morales  & Ricardo Conejo ,  & 

  3. School of Cognitive and Computing Sciences, University of Sussex, Falmer, Brighton, BN1 9QN, UK

    Matthew Hennessy

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kick, M. (2002). Bialgebraic Modelling of Timed Processes. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-45465-9_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43864-9

  • Online ISBN: 978-3-540-45465-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation