Skip to main content

A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum

  • Conference paper

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

Abstract

The paper outlines an approach for characterizing several kinds of behaviours for transition systems in coalgebraic terms and illustrates the approach with some behaviours in the linear time – branching time spectrum, namely, traces, ready-traces and failures. The approach is based on an abstract notion of “behaviour object” that can be defined in any (concrete) category and enjoys a uniqueness property similar to the uniqueness of morphisms to final objects. That property makes behaviour objects final in a suitable extension of the given category with additional morphisms, which allows to define the behaviours of arbitrary objects by the unique morphisms to the behaviour objects. The main purpose of the paper is to show how trace, ready-trace and failure semantics can be characterized in terms of behaviour objects.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rutten, J.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. van Glabbeek, R.: The linear time–branching time spectrum I: the semantics of concrete, sequential processes. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of process algebra, pp. 3–99. Elsevier, Amsterdam (2001)

    Chapter  Google Scholar 

  3. Power, J., Turi, D.: A coalgebraic foundation for linear time semantics. In: Hofmann, M., Rosolini, G., Pavlovic, D. (eds.) CTCS 1999, Conference on Category Theory and Computer Science. Electronic Notes in Theoretical Computer Science, vol. 29, pp. 259–274. Elsevier, Amsterdam (1999)

    Google Scholar 

  4. Jacobs, B.: Trace semantics for coalgebras. In: Adamek, J., Milius, S. (eds.) Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science, vol. 106, pp. 167–184. Elsevier, Amsterdam (2004)

    Google Scholar 

  5. Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods in Computer Science 3(4:11), 1–36 (2007)

    MathSciNet  MATH  Google Scholar 

  6. Monteiro, L.: A coalgebraic characterization of behaviours in the linear time – branching time spectrum. Technical Report UNL-DI 4-2008, Universidade Nova de Lisboa (2008), http://ctp.di.fct.unl.pt/~lm/publications/tr4-2008.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monteiro, L. (2009). A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum. In: Corradini, A., Montanari, U. (eds) Recent Trends in Algebraic Development Techniques. WADT 2008. Lecture Notes in Computer Science, vol 5486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03429-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03429-9_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03428-2

  • Online ISBN: 978-3-642-03429-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics