Petri net topologies for a specification language

dc.contributor.author	Watson, AG
dc.contributor.editor	Kritzinger, P.
dc.date.accessioned	2018-08-03T12:20:38Z
dc.date.available	2018-08-03T12:20:38Z
dc.date.issued	1987
dc.identifier.citation	Watson, A.G. (1987) Petri net topologies for a specification language. Proceedings of the 4th South African Computer Symposium, Holiday Inn, Pretoria, 1-3 July 1987, edited by P. Kritzinger (UCT).	en
dc.identifier.uri	http://hdl.handle.net/10500/24555
dc.description.abstract	This paper presents a formal technique for enforcing deterministic execution in Petri nets, and proceeds to demonstrate how the resultant topology may be used to enforce partial sequencing so that various sequentially-executing subnets may execute in parallel. Using this sequencing technique, isomorphisms between various programming language constructs and Petri nets are defined. Particular constructs investigated are iteration , concurrency, modularity and data type representation. The intention is to unify the individual subnets to form a single model, which may be studied using classical Petri net analysis techniques. An important application of such a unified model is the detection of deadlock in protocol specifications .	en
dc.language.iso	en	en
dc.title	Petri net topologies for a specification language	en