Report 89--18, pages 1-21 pp.. Rijksuniversiteit te Leiden (The Netherlands), Vakgroep Informatica, December 1989.
Also in: Fundamenta Informaticae, Vol. XIV, pages 287-300. 1991.
Abstract: The state space of an elementary net system is formalized through the notion of the case graph, which is an edge-labeled graph with a distinguished initial node. The paper investigates syntactic, ie graph-theoretic properties of case graphs of elementary net systems. In particular it studies the structure of isomorphisms between case graphs.
Keywords: diamond property (of) state space (of) elementary net system; isomorphism (between) case graph(s).