In: Proc. of the IEEE Conf. TENCON 87: `Computers and Communications Technology Toward 2000', Vol. 2, pages 472-476. New York: IEEE, 1987.
Abstract: An algorithm is presented for finding the maximal set of concurrently firable actions in the Petri net representation of a task. It is found that all the states of a Petri net model are characterized by five classes based on the two quantitative parameters, degree of concurrency and degree of decision, which are extracted from the maximal set.