Flexibility in algebraic nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1420, Issue , 1998, Pages 345-364

  Kindler, Ekkart ^a   Völzer, Hagen ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Algebraic petri nets; Place invariants; Verification techniques

Indexed keywords

ALGORITHMS; PETRI NETS;

ALGEBRAIC NETS; ALGEBRAIC PETRI NETS; ALGEBRAIC SYSTEM; DISTRIBUTED NETWORKS; PETRI NET THEORIES; PLACE INVARIANTS; VERIFICATION TECHNIQUES;

ALGEBRA;

EID: 84957714745     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69108-1_19     Document Type: Conference Paper

References (24)

1. E. Best and C. Fernández. Nonsequential Processes. Springer, 1988.
2. J. Billington. Extending coloured Petri nets. Technical Report 148, University of Cambridge, Computer Laboratory, Oct. 1988.
3. J. Billington. Extensions to Coloured Petri Nets and their Application to Protocols. Technical Report 222, University of Cambridge, May 1991.
4. M. Broy. On the design and verification of a simple distributed spanning tree algorithm. SFB-Bericht 342/24/90 A, Technische Universtität München, Dec. 1990.
5. J. Desel, K.-P. Neuendorf, and M.-D. Radola. Proving nonreachability by moduloinvariants. Theoretical Computer Science, 153:49-64, 1996.
6. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specifications 1, Equations and Initial Semantics, Springer, 1985.
7. U. Goltz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Control, 57:125-147, 1983.
8. K. Jensen. Coloured Petri Nets, Volume 1: Basic Concepts. Springer, 1992.
9. K. Jensen. Coloured Petri Nets. Volume 2: Analysis Methods. Springer, 1995.
10. E. Kindler and W. Reisig. Algebraic system nets for modelling distributed algorithms. Petri Net Newsletter, 51:16-31, Dec. 1996.
11. E. Kindler and W. Reisig. Verification of distributed algorithms with algebraic Petri nets. In C. Freksa, M. Jantzen, and R. Valk, editors, Foundations of Computer Science: Potential – Theory – Cognition, LNCS 1337, pp. 261-270. Springer 1997.
12. E. Kindler, W. Reisig, H. Völzer, and R. Walter. Petri net based verification of distributed algorithms: An example. Formal Aspects of Computing, 9:409-424, 1997.
13. E. Kindler and H. Völzer. Flexibility in algebraic nets. Informatik-Bericht 89, Humboldt-Universität zu Berlin, Institut f¨ur Informatik, 1997. Available at http://www.informatik.hu-berlin.de/~kindler/papers.html
14. G. Memmi and G. Roucairol. Linear algebra in net theory. In W. Brauer, editor, Net Theory and Applications, LNCS 84, pp. 213-223. Springer, Oct. 1979.
15. J. L. Peterson. Petri Net Theory And The Modeling of Systems. Prentice-Hall 1981.
16. W. Reisig. Petri Nets, Springer, 1985.
17. W. Reisig. Petri nets and algebraic specifications. Theoretical Computer Science, 80:1-34, May 1991.
18. W. Reisig. Petri net models of distributed algorithms. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, LNCS 1000, pp. 441-454. Springer, 1995.
19. K. Schmidt. Verification of siphons and traps for algebraic Petri nets. In P. Azéma and G. Balbo, editors, Application and Theory of Petri Nets 1997, International Conference, Proceedings, LNCS 1248, pp. 427-446. Springer, June 1997.
20. E. Smith and W. Reisig. The semantics of a net is a net, an exercise in general net theory. In K. Voss, H. Genrich, and G. Rozenberg, editors, Concurrency and Nets. Springer, 1987.
21. R. Valk. Bridging the gap between place-and Floyd-invariants with applications to preemptive scheduling. In M. A. Marsan (ed), Application and Theory of Petri Nets 1993, International Conference, Proceedings, LNCS 691, pp. 431-452. Springer, June 1993.
22. J. Vautherin. Parallel systems specifications with coloured Petri nets and algebraic specifications. In G. Rozenberg, editor, Advances in Petri Nets, LNCS 266, pp. 293-308. Springer, 1987.
23. H. Völzer. Verifying fault tolerance of distributed algorithms formally: An example. In CSD98, 'International Conference on Application of Concurrency to System Design', Aizu-Wakamatsu City, Japan, Mar.1998. IEEE Computer Society Press.
24. M. Weber, R. Walter, H. Völzer, T. Vesper, W. Reisig, S. Peuker, E. Kindler, J. Freiheit, and J. Desel. DAWN: Petrinetzmodelle zur Verifikation Verteilter Algorithmen. Informatik-Bericht 88, Humboldt-Universität zu Berlin, Dec. 1997.