On relational cycles

Authors:
Alexander Fronk;Jörg Pleumann
Affiliations:
Software Technology, University of Dortmund, Dortmund, Germany;Software Technology, University of Dortmund, Dortmund, Germany
Venue:
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Year:
2005

Citing 6
Cited 1

Circuits, handles, bridges and nets

APN 90 Proceedings on Advances in Petri nets 1990
Relations and graphs: discrete mathematics for computer scientists

Relations and graphs: discrete mathematics for computer scientists
Free choice Petri nets

Free choice Petri nets
Realtion-Algebraic Analysis of Petri Nets with RELVIEW

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Using Relation Algebra for the Analysis of Petri Nets in a CASE Tool Based Approach

SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Exact computation of minimum feedback vertex sets with relational algebra

Fundamenta Informaticae

A Relation-Algebraic Approach to Liveness of Place/Transition Nets

RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.