论文信息 - Realtion-Algebraic Analysis of Petri Nets with RELVIEW

Realtion-Algebraic Analysis of Petri Nets with RELVIEW

We present a method for specifying and implementing algorithms for the analysis of Petri nets. It is formally grounded in relational algebra. Specifications are written in ordinary predicate logic and then transformed systematically into relational programs which can be executed directly in RELVIEW, a graphical computer system for calculating with relations. Our method yields programs that are correct by construction. Its simplicity and efficiency is illustrated in many examples.

[1] Alfred Tarski,et al. Relational selves as self-affirmational resources , 2008 .

[2] Gunther Schmidt,et al. Relations and Graphs: Discrete Mathematics for Computer Scientists , 1993 .

[3] Gunther Schmidt,et al. RELVIEW - A Computer System for the Manipulation of Relations , 1993, AMAST.

[4] Gunther Schmidt,et al. Prototyping Relational Specifications Using Higher-Order Objects , 1993, HOA.

[5] César Fernández. Non-sequential Processes , 1986, Advances in Petri Nets.

[6] Rudolf Berghammer,et al. Algorithms from Relational Speciication 4.2 Preliminaries , 2007 .

[7] Michel Hack,et al. ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

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

[9] Rudolf Berghammer,et al. Relational Algebraic Semantics of Deterministic and Nondeterministic Programs , 1986, Theor. Comput. Sci..

[10] Rudolf Berghammer,et al. Algorithms from Relational Specifications , 1997, Relational Methods in Computer Science.

[11] J. Huisman. The Netherlands , 1996, The Lancet.

[12] César Fernández,et al. Non-sequential Processes , 1986, Advances in Petri Nets.

[13] Ernst-Rüdiger Olderog,et al. Nets, terms and formulas , 1991 .

[14] Wolfgang Reisig. Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.