Application and Theory of Petri Nets 1992

1. Front Matter

   PDF

2. Performance issues in parallel programming

   • Gianfranco Balbo

   Pages 1-23

3. Combining Petri Nets and other formal methods

   • W. Reisig

   Pages 24-44

4. Place bisimulations in Petri nets

   • C. Autant, Ph. Schnoebelen

   Pages 45-61

5. A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets

   • Kamel Barkaoui, Michel Minoux

   Pages 62-75

6. Refinement and simulation of nets — a categorical characterisation

   • Carolyn Brown, Doug Gurr

   Pages 76-92

7. Scheduling hard real time systems using high-level Petri nets

   • Giorgio Bruno, Andrea Castella, Gianpaolo Macario, Marco P. Pescarmona

   Pages 93-112

8. Towards a modular analysis of coloured Petri nets

   • Søren Christensen, Laure Petrucci

   Pages 113-133

9. A proof of the Rank Theorem for extended free choice nets

   • Jörg Desel

   Pages 134-153

10. On the product form solution for Stochastic Petri Nets

    • Susanna Donatelli, Matteo Sereno

    Pages 154-172

11. Obtaining deadlock-preserving skeletons for coloured nets

    • Greg Findlow

    Pages 173-192

12. P-superfairness in nets

    • Hans Fleischhack

    Pages 193-204

13. Formal verification of an arbiter cascade

    • Hartmann J. Genrich, Robert M. Shapiro

    Pages 205-223

14. Constructs for modeling information systems with Petri nets

    • Carlos A. Heuser, Gernot Richter

    Pages 224-243

15. Construction of a class of safe Petri nets by presenting firing sequences

    • Kunihiko Hiraishi

    Pages 244-262

16. An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets

    • Peter Kemper, Falko Bause

    Pages 263-278

17. Hierarchical solution of generalized Stochastic Petri Nets by means of traffic processes

    • Guenter Klas

    Pages 279-298

18. Concurrency relations and the safety problem for Petri nets

    • A. V. Kovalyov

    Pages 299-309

19. High-level nets and linear logic

    • Johan Lilius

    Pages 310-327

20. Liveness and boundedness analysis for Petri nets with event graph modules

    • Vanio M. Savi, Xiaolan Xie

    Pages 328-347

This volume contains the proceedings of the 13th International Conference onApplication and Theory of Petri Nets, held in Sheffield, England, in June 1992. The aim of the Petri net conferences is to create a forum for discussing progress in the application and theory of Petri nets. Typically, the conferences have 150-200 participants, one third of these coming from industry and the rest from universities and research institutions. The 1992 conference was organized by the School of Computing and Management Sciences at Sheffield City Polytechnic, England. The volume contains twoinvited papers, by G. Balbo and W. Reisig, 18 submitted papers, and seven project papers. The submitted papers and project presentations were selectedby the programme committee and a panel of referees from a large number of submissions.

• Coloured Petri Nets
• Gefärbte Petrinetze
• Management
• Net Design
• Netzentwurf
• Parallelität (EDV)
• Performance
• Petri Net Models
• Petrinetz-Modelle
• algorithms
• calculus
• formal verification
• logic
• programming
• verification
• algorithm analysis and problem complexity

Policies and ethics