Using Relation Algebra for the Analysis of Petri Nets in a CASE Tool Based Approach

Authors:
Alexander Fronk
Affiliations:
University of Dortmund, Germany
Venue:
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Year:
2004

Citing 0
Cited 6

Exact computation of minimum feedback vertex sets with relational algebra

Fundamenta Informaticae
State space analysis of Petri nets with relation-algebraic methods

Journal of Symbolic Computation
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
On relational cycles

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
RelView: an OBDD-based computer algebra system for relations

CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Exact Computation of Minimum Feedback Vertex Sets with Relational Algebra

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide the calculus of relations as a data type implemented in an object-oriented Java-library, KURE. We demonstrate how to employ KURE in a CASE tool for the relation-algebraic analysis of Petri nets. Relation algebra has already been applied to condition/event nets. We extend this approach to place/transition systems in general and thereby provide a novel relation-algebraic interface to Petri net analysis. KURE is usable in any tool modelling with relations. In this paper we address in general how CASE tools are equipped with the calculus of relations and demonstrate in particular how reachability analysis of Petri nets benefits from this formal method.