No abstract

No abstract

This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factory automation systems. It presents new algorithms to harness this modular analysis in the determination of reachable states with specified partial markings, to determine possible deadlocks, both global and local, and also liveness. These algorithms have been implemented in a prototype tool which has then been used to solve a problem in factory automation which, even for relatively simple configurations, can lead to state spaces beyond the capabilities of many analysis tools.

This paper proposes an approach to arc extensions in CP-nets which is claimed to be both general and systematic. It is general because the enabling rules cater for true concurrency as well as an interleaving semantics and because it encompasses the other proposals for arc extensions that have been made recently in the Petri Net literature, often in the context of the requirements of specific application domains. It is systematic because it proposes a set of fundamental arcs in the context of a general complementary place construction and then considers how these arcs can be combined in arbitrary ways. Because of the utility of some of these compound arcs and the minimal overhead in implementing them, it is argued that CP-net tools should provide explicit support for them.

No abstract