Skip to main content
SpringerLink
Log in

On Relational Cycles

  • Conference paper
Relational Methods in Computer Science (RelMiCS 2005)

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

Included in the following conference series:

Abstract

We provide relation-algebraic characterisations of elementary, ordinary, and maximal cycles in graphs. Relational specifications for the enumeration of cycles are provided. They are executable within the RelView and RelClipse tools and appear to be useful in various applications. Particularly, cycles offer a valuable instrument for analysing Petri Nets.

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. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Monographs in Mathematics. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  2. Baumgarten, B.: Petri-Netze: Grundlagen und Anwendungen. BI-Wissenschafts-Verlag (1990)

    Google Scholar 

  3. Behnke, R., Berghammer, R., Meyer, E., Schneider, P.: RELVIEW - A system for calculating with relations and relational programming. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol. 1382, pp. 318–321. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Berghammer, R., Fronk, A.: Exact computation of minimum feedback vertex sets with relational algebra. Fundamenta Informaticae 70, 1–16 (to appear, 2006)

    MathSciNet  MATH  Google Scholar 

  5. Berghammer, R., Karger, B., Ulke, C.: Relational-algebraic analysis of Petri Nets with RelView. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 49–69. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  6. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, vol. 40. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  7. Esparza, J., Silva, M.: Circuits, Handles, Bridges and Nets. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483. Springer, Heidelberg (1991)

    Google Scholar 

  8. Fronk, A.: Using relation algebra for the analysis of Petri Nets in a CASE tool based approach. In: 2nd IEEE International Conference on Software Engineering and Formal Methods (SEFM), Beijing, pp. 396–405. IEEE, Los Alamitos (2004)

    Google Scholar 

  9. Fronk, A., Pleumann, J.: Relationenalgebraische Analyse von Petri-Netzen: Konzepte und Implementierung. In: Kindler, E. (ed.) Proceedings of the 11th Workshop on Algorithms and Tools for Petri Nets (AWPN), Universität Paderborn, Germany, September 2004, pp. 61–68 (2004); English version appeared in Petri Net News Letters (April 2005)

    Google Scholar 

  10. Fronk, A., Pleumann, J., Schönlein, R., Szymanski, O.: KURE-Java (2005), http://ls10-www.cs.uni-dortmund.de/index.php?id=136

  11. Fronk, A., Schönlein, R.: RelClipse, http://ls10-www.cs.uni-dortmund.de/index.php?id=137

  12. Hoffmann, T.: Fallstudien relationaler Programmentwicklung am Beispiel ausgewählter Graphdurchlaufstrategien. PhD thesis, Universität Kiel (2002)

    Google Scholar 

  13. Institute of Computer Science and Applied Mathematics, Faculty of Engineering, Christian-Albrechts-University of Kiel, Germany. RelView Examples - Graph- theoretic Algorithms, http://www.informatik.uni-kiel.de/~progsys/relview/Graph

  14. Milanese, U.: KURE: Kiel University Relation Package (2003), http://cvs.informatik.uni-kiel.de/~kure/

  15. Schmidt, G., Ströhlein, T.: Relations and graphs. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)

    Book  MATH  Google Scholar 

  16. Szymanski, O.: Relationale Algebra im dreidimensionalen Software-Entwurf – ein werkzeugbasierter Ansatz. Master’s thesis, Universität Dortmund (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Technology, University of Dortmund, D-44221, Dortmund, Germany

    Alexander Fronk & Jörg Pleumann

Authors
  1. Alexander Fronk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jörg Pleumann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, Antigonish, NS, Canada

    Wendy MacCaull

  2. Department of Computer Science, Brock University, L2S 3A1, St. Catharines, Ontario, Canada

    Michael Winter

  3. Computer Science Department, Brock University, L2S 3A1, St. Catharines, Ontario, Canada

    Ivo Düntsch

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fronk, A., Pleumann, J. (2006). On Relational Cycles. In: MacCaull, W., Winter, M., Düntsch, I. (eds) Relational Methods in Computer Science. RelMiCS 2005. Lecture Notes in Computer Science, vol 3929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11734673_7

Download citation

  • DOI: https://doi.org/10.1007/11734673_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33339-5

  • Online ISBN: 978-3-540-33340-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation