A Compositional Semantics for Unmarked Predicate/Transition Nets¹

Article type: Research Article

Authors: Maggiolo Schettini, Andrea^a | Pinna, G. Michele^a | Winkowski, Józef^b

Affiliations: [a] Dipartimento di Injormatica dell’Università di Pisa, Corso Italia 40, 56100 Pisa, Italy | [b] Instytut Podstaw Informatyki PAN, Skr.p.22, 00-901 Warszawa P.K.i N., Poland

Note: [1] This work has partially been done in the framework of the Research Agreement between C.N.R. and Polish Academy of Science.

Abstract: Predicate/Transition nets are a high level description tool for complex systems. The paper aims at developing a semantics for Unmarked Predicate/Transition nets. This semantics, based on the concept of behavior as isomorphic class of unfoldings of the net, is compositional, i.e. the behavior of a complex net can be obtained by a suitable composition of the behaviors of its parts. The concept of behavior introduced here is similar to that of process for which an algebra has been developed in [16]. A case in which the behavior of Marked Predicate/Transition nets can be derived from the behaviors of its parts is also discussed.

DOI: 10.3233/FI-1991-14106

Journal: Fundamenta Informaticae, vol. 14, no. 1, pp. 109-128, 1991