Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Nominal Kleene Coalgebra

  • Conference paper
  • First Online:
Automata, Languages, and Programming (ICALP 2015)

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

Included in the following conference series:

Abstract

We develop the coalgebraic theory of nominal Kleene algebra, including an alternative language-theoretic semantics, a nominal extension of the Brzozowski derivative, and a bisimulation-based decision procedure for the equational theory.

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. Adámek, J.: On final coalgebras of continuous functors. TCS 294(12), 3–29 (2003)

    Article  MATH  Google Scholar 

  2. Allauzen, C., Mohri, M.: A unified construction of the glushkov, follow, and antimirov automata. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 110–121. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Bojanczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. LMCS 10(3) (2014)

    Google Scholar 

  4. Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: POPL 2013, pp. 457–468 (2013)

    Google Scholar 

  5. Braibant, T., Pous, D.: Deciding Kleene algebras in Coq. LMCS 8(1:16), 1–42 (2012)

    MathSciNet  Google Scholar 

  6. Ferrari, G.-L., Montanari, U., Tuosto, E., Victor, B., Yemane, K.: Modelling fusion calculus using HD-automata. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 142–156. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Foster, N., Kozen, D., Milano, M., Silva, A., Thompson, L.: A coalgebraic decision procedure for NetKAT. In: POPL 2015, pp. 343–355 (2015)

    Google Scholar 

  8. Francez, N., Kaminski, M.: Finite-memory automata. TCS 134(2), 329–363 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Francez, N., Kaminski, M.: An algebraic characterization of deterministic regular languages over infinite alphabets. TCS 306(1–3), 155–175 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gabbay, M., Pitts, A.M.: A new approach to abstract syntax involving binders. In: LICS 1999, pp. 214–224 (1999)

    Google Scholar 

  11. Gabbay, M.: Foundations of nominal techniques: logic and semantics of variables in abstract syntax. Bull. Symbolic Logic 17(2), 161–229 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gabbay, M.J., Ciancia, V.: Freshness and name-restriction in sets of traces with names. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 365–380. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. In: TACS 2008. Dagstuhl LIPIcs, vol. 1, pp. 325–336 (2008)

    Google Scholar 

  14. Kozen, D.: On the coalgebraic theory of Kleene algebra with tests. Tech. Rep., Cornell, March 2008. http://hdl.handle.net/1813/10173

  15. Kozen, D., Mamouras, K., Silva, A.: Completeness and incompleteness in nominal Kleene algebra. Tech. Rep., Cornell, November 2014. http://hdl.handle.net/1813/38143

  16. Kozen, D., Mamouras, K., Petrişan, D., Silva, A.: Nominal Kleene Coalgebra. Tech. Rep., Cornell, February 2015. http://hdl.handle.net/1813/39108

  17. Kurz, A., Suzuki, T., Tuosto, E.: A characterisation of languages on infinite alphabets with nominal regular expressions. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 193–208. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  18. Kurz, A., Suzuki, T., Tuosto, E.: On nominal regular languages with binders. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 255–269. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  19. Montanari, U., Pistore, M.: History dependent automata. Tech. Rep. TR-11-98, Computer Science, Università di Pisa (1998)

    Google Scholar 

  20. Montanari, U., Pistore, M.: History-dependent automata: an introduction. In: Bernardo, M., Bogliolo, A. (eds.) SFM-Moby 2005. LNCS, vol. 3465, pp. 1–28. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Pistore, M.: History Dependent Automata. PhD thesis, Università di Pisa (1999)

    Google Scholar 

  22. Pitts, A.M.: Nominal Sets: Names and Symmetry in Computer Science, Cambridge Tracts in Theoretical Computer Science 57. Cambridge University Press (2013)

    Google Scholar 

  23. Pous, D.: Symbolic algorithms for language equivalence and kleene algebra with tests. In: POPL 2015, pp. 357–368 (2015)

    Google Scholar 

  24. Silva, A.: Kleene Coalgebra. PhD thesis, Radboud University Nijmegen (2010)

    Google Scholar 

  25. Silva, A.: Position automata for Kleene algebra with tests. Scientific Annals of Computer Science 22(2), 367–394 (2012)

    Article  MathSciNet  Google Scholar 

  26. Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: STOC 1973, pp. 1–9 (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cornell University, Ithaca, USA

    Dexter Kozen & Konstantinos Mamouras

  2. Radboud University Nijmegen, Nijmegen, The Netherlands

    Daniela Petrişan & Alexandra Silva

Authors
  1. Dexter Kozen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konstantinos Mamouras
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniela Petrişan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexandra Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexandra Silva .

Editor information

Editors and Affiliations

  1. Reykjavik University, Reykjavik, Iceland

    Magnús M. Halldórsson

  2. Kyoto University, Kyoto, Japan

    Kazuo Iwama

  3. The University of Tokyo, Tokyo, Japan

    Naoki Kobayashi

  4. Technische Universiteit Eindhoven, Eindhoven, The Netherlands

    Bettina Speckmann

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kozen, D., Mamouras, K., Petrişan, D., Silva, A. (2015). Nominal Kleene Coalgebra. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47666-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47666-6_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47665-9

  • Online ISBN: 978-3-662-47666-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation