Application and Theory of Petri Nets 1992

Performance issues in parallel programming.- Combining Petri Nets and other formal methods.- Place bisimulations in Petri nets.- A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets.- Refinement and simulation of nets - a categorical characterisation.- Scheduling hard real time systems using high-level Petri nets.- Towards a modular analysis of coloured Petri nets.- A proof of the Rank Theorem for extended free choice nets.- On the product form solution for Stochastic Petri Nets.- Obtaining deadlock-preserving skeletons for coloured nets.- P-superfairness in nets.- Formal verification of an arbiter cascade.- Constructs for modeling information systems with Petri nets.- Construction of a class of safe Petri nets by presenting firing sequences.- An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets.- Hierarchical solution of generalized Stochastic Petri Nets by means of traffic processes.- Concurrency relations and the safety problem for Petri nets.- High-level nets and linear logic.- Liveness and boundedness analysis for Petri nets with event graph modules.- On weighted T-systems.- Using Petri Nets to develop programs for PLC systems.- Modelling and control of complex logistic systems for manufacturing.- Modelling and evaluation of a satellite system using EVAL, a Petri Net based industrial tool.- Analysis of an Ada system using coloured Petri nets and occurrence graphs.- The stubborn set method in practice.- Modeling fine grain computation via the Fusion of two extended Petri nets.