Skip to main content
SpringerLink
Log in

Closure Operators for Order Structures

  • Conference paper
Fundamentals of Computation Theory (FCT 2009)

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

Included in the following conference series:

  • 441 Accesses

Abstract

We argue that closure operators are fundamental tools for the study of relationships between order structures and their sequence representations. We also propose and analyse a closure operator for interval order structures.

Partially supported by NSERC Grant of Canada.

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. Abraham, U., Ben-David, S., Magodor, M.: On global-time and inter-process communication. In: Semantics for Concurrency, Workshops in Computing, pp. 311–323. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  2. Begstra, J.A., et al. (eds.): The Handbook of Process Algebras. Elsevier Science, Amsterdam (2000)

    Google Scholar 

  3. Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Springer, New York (1981)

    Book  MATH  Google Scholar 

  4. Best, E., Koutny, M.: Petri net semantics of priority systems. Theoretical Computer Science 94, 141–158 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)

    Google Scholar 

  6. Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. Journal of Mathematical Psychology 7, 144–149 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fishburn, P.C.: Interval Orders and Interval Graphs. John Wiley, New York (1985)

    MATH  Google Scholar 

  8. Gaifman, H., Pratt, V.: Partial Order Models of Concurrency and the Computation of Function. In: Proc. LICS 1987, pp. 72–85 (1987)

    Google Scholar 

  9. Janicki, R.: Relational Structures Model of Concurrency. Acta Informatica 45(4), 279–320 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Janicki, R., Koutny, M.: Invariants and Paradigms of Concurrency Theory. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds.) PARLE 1991. LNCS, vol. 506, pp. 59–74. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  11. Janicki, R., Koutny, M.: Structure of Concurrency. Theoretical Computer Science 112(1), 5–52 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  12. Janicki, R., Koutny, M.: Semantics of Inhibitor Nets. Information and Computation 123(1), 1–16 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Janicki, R., Koutny, M.: Fundamentals of Modelling Concurrency Using Discrete Relational Structures. Acta Informatica 34, 367–388 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Janicki, R., Lê, D.T.M.: Modelling Concurrency with Quotient Monoids. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 251–269. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Jensen, K.: Coloured Petri Nets, vol. 1,2,3. Springer, Heidelberg (1997)

    Book  MATH  Google Scholar 

  16. Juhás, G., Lorenz, R., Mauser, S.: Synchronous + Concurrent + Sequential = Earlier than + Not later than. In: Proc. ACSD 2006, pp. 261–272. IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  17. Kleijn, H.C.M., Koutny, M.: Process Semantics of General Inhibitor Nets. Information and Computation 190, 18–69 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kleijn, J., Koutny, M.: Formal Languages and Concurrent Behaviour. Studies in Computational Intelligence 113, 125–182 (2008)

    MATH  Google Scholar 

  19. Lamport, L.: The mutual exclusion problem: Part I - a theory of interprocess communication; Part II - statements and solutions. Journal of ACM 33(2), 313–326 (1986)

    Article  MATH  Google Scholar 

  20. Lê, D.T.M.: Studies in Comtrace Monoids. Master Thesis, Department of Computing and Software, McMaster University (2008)

    Google Scholar 

  21. Mazurkiewicz, A.: Concurrent Program Schemes and Their Interpretation. TR DAIMI PB-78, Comp. Science Depart. Aarhus University (1977)

    Google Scholar 

  22. Milner, R.: Operational and Algebraic Semantics of Concurrent Processes. In: van Leuween, J. (ed.) Handbook of Theoretical Computer Science, vol. 2, pp. 1201–1242. Elsevier, Amsterdam (1993)

    Google Scholar 

  23. Reisig, W.: Elements of Distributed Algorithms. Springer, Heidelberg (1998)

    Book  MATH  Google Scholar 

  24. Rosen, K.H.: Discrete Mathematics and Its Applications. McGraw-Hill, New York (1999)

    Google Scholar 

  25. Szpilrajn, E.: Sur l’extension de l’ordre partiel. Fundam. Mathematicae 16, 386–389 (1930)

    MATH  Google Scholar 

  26. Wiener, N.: A contribution to the Theory of Relative Position. Proc. Camb. Philos. Soc. 17, 441–449 (1914)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Software, McMaster University, Hamilton, Canada, L8S 4K1

    Ryszard Janicki & Nadezhda Zubkova

  2. Department of Computer Science, University of Toronto, Toronto, Canada, M5S 3G4

    Dai Tri Man Lê

Authors
  1. Ryszard Janicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dai Tri Man Lê
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nadezhda Zubkova
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Wrocław University of Technology, ul. Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Mirosław Kutyłowski  & Maciej Gębala  & 

  2. Institute of Computer Science, University of Wrocław, ul. Joliot-Curie 15, 50-383, Wrocław, Poland

    Witold Charatonik

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janicki, R., Lê, D.T.M., Zubkova, N. (2009). Closure Operators for Order Structures. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds) Fundamentals of Computation Theory. FCT 2009. Lecture Notes in Computer Science, vol 5699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03409-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03409-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03408-4

  • Online ISBN: 978-3-642-03409-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation