Using relation algebra for the analysis of Petri nets in a CASE tool based approach

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.

[1]  Ewa Orlowska,et al.  A relational formalisation of a generic many—valued modal logic , 2001 .

[2]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[3]  Klaus Alfert,et al.  Software engineering education needs adequate modeling tools , 2004, 17th Conference on Software Engineering Education and Training, 2004. Proceedings..

[4]  Rudolf Berghammer,et al.  Implementation of Relational Algebra Using Binary Decision Diagrams , 2001, RelMiCS.

[5]  Rudolf Berghammer,et al.  Realtion-Algebraic Analysis of Petri Nets with RELVIEW , 1996, TACAS.

[6]  Gunther Schmidt,et al.  Relations and Graphs , 1993, EATCS Monographs on Theoretical Computer Science.

[8]  Javier Esparza,et al.  A New Unfolding Approach to LTL Model Checking , 2000, ICALP.

[9]  Thorsten Hoffmann.  Fallstudien relationaler Programmentwicklung am Beispiel ausgewählter Graphdurchlaufstrategien , 2002 .

[10]  Rudolf Berghammer,et al.  Applying Relational Algebra in 3D Graphical Software Design , 2003, RelMiCS.

[11]  Wolfram Kahl,et al.  Relational Methods in Computer Science , 1997, Advances in Computing Sciences.

[12]  Peter H. Starke,et al.  Analyse von Petri-Netz-Modellen , 1990, Leitfäden und Monographien der Informatik.

[13]  Javier Esparza,et al.  Unfolding Based Algorithms for the Reachability Problem , 2001, Fundam. Informaticae.

[14]  Ralf Behnke,et al.  RELVIEW - A System for Calculating With Relations and Relational Programming , 1998, FASE.

[15]  Richard C. Holt,et al.  Wins and losses of algebraic transformations of software architectures , 2001, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001).