✍ Scribed by J.M Joller
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We consider the following problems: (a) Given a labelled Petri net and a finite automaton, are they equivalent?; (b) Given a labelled Petri net, is it equivalent to some (unspecified) finite automaton? These questions are studied within the framework of trace and bisimulation equivalences, in both t
A Petri Net model for the evaluation of reliability for the execution of a computer program in a distributed processing system (DPS) is developed. The execution of a program in a DPS may require access to several files residing at different sites and communication paths between several node pairs. T
AbstractÐCyclic scheduling is an eective scheduling method in the repetitive discrete manufacturing environment. We investigate the scheduling problem for general cyclic job shops with blocking where each machine has an input buer of ®nite capacity. We develop Petri net models for the shops. We prop