Skip to main content
SpringerLink
Log in

Defining Behaviours by Quasi-finality

  • Conference paper
Formal Methods: Foundations and Applications (SBMF 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5902))

Included in the following conference series:

Abstract

This paper proposes a notion of quasi-final object for any concrete category, by relegating to the underlying category some of the requirements that final objects must satisfy in the main category. We present some very basic properties of quasi-final objects and show how known behaviours like traces and failures for transition systems, and behaviours extracted from the final sequence of an arbitrary endofunctor (here restricted to the first ω terms) can be described by quasi-final objects.

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

Access this chapter

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 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. Monteiro, L.: A coalgebraic characterization of behaviours in the linear time - branching time spectrum. In: Corradini, A., Montanari, U. (eds.) WADT 2008. LNCS. Springer, Heidelberg (2009)

    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. Worrell, J.: On the final sequence of a finitary set functor. Theoretical Computer Science 338(1-3), 184–199 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kurz, A., Pattinson, D.: Coalgebraic modal logic of finite rank. Mathematical Structures in Computer Science 15(03), 453–473 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Barr, M.: Terminal coalgebras in well-founded set theory. Theoretical Computer Science 114(2), 299–315 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

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

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

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Milner, R.: Communication and Concurrency. International Series in Computing Science. Prentice Hall International, Englewood Cliffs (1989)

    MATH  Google Scholar 

  11. Monteiro, L.: Semantic domains based on sets with families of equivalences. In: Jacobs, B., Moss, L., Reichel, H., Rutten, J. (eds.) Coalgebraic Methods in Computer Science (CMCS 1998). Electronic Notes in Theoretical Computer Science, vol. 11, pp. 73–106. Elsevier, Amsterdam (1998)

    Google Scholar 

  12. Adámek, J.: On final coalgebras of continuous functors. Theoretical Computer Science 294, 3–29 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Proc. 12th LICS Conf., pp. 280–291. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  14. Rutten, J.: Processes as terms: non-well-founded models for bisimulation. Mathematical Structures in Computer Science 15, 257–275 (1992)

    Article  MathSciNet  Google Scholar 

  15. Rutten, J., Turi, D.: Initial algebra and final coalgebra semantics for concurrency. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 530–582. Springer, Heidelberg (1994)

    Google Scholar 

  16. Wolter, U.: CSP, partial automata, and coalgebras. Theoretical Computer Science 280, 3–34 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CITI, Departamento de Matemática, Universidade dos Açores, 9501-801, Ponta Delgada, Portugal

    Elisabete Freire

  2. CITI, Departamento de Informática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, 2829-516, Caparica, Portugal

    Luís Monteiro

Authors
  1. Elisabete Freire
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís Monteiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática e Matemática Aplicada, Universidade Federal do Rio Grande do Norte, Campus Universitário, CEP: 59078-900, Lagoa Nova Natal, RN, Brasil

    Marcel Vinícius Medeiros Oliveira

  2. Department of Computer Science, University of York, Heslington, YO1 7BZ, York, UK

    Jim Woodcock

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Freire, E., Monteiro, L. (2009). Defining Behaviours by Quasi-finality. In: Oliveira, M.V.M., Woodcock, J. (eds) Formal Methods: Foundations and Applications. SBMF 2009. Lecture Notes in Computer Science, vol 5902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10452-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10452-7_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10451-0

  • Online ISBN: 978-3-642-10452-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation