Fundamenta Informaticae - Volume 14, issue 1

Article Type: Other

DOI: 10.3233/FI-1991-14101

Citation: Fundamenta Informaticae, vol. 14, no. 1, pp. i-viii, 1991

Authors: Keesmaat, N.W. | Kleijn, H.C.M. | Rozenberg, G.

Article Type: Research Article

Abstract: In this paper the behaviour of models of concurrent systems introduced in [KeeKleRoz] is investigated. In particular (i) static and dynamic models are compared and (ii) the effect of restricting the sequential components to be regular is considered.

DOI: 10.3233/FI-1991-14102

Citation: Fundamenta Informaticae, vol. 14, no. 1, pp. 1-38, 1991

Authors: Loogen, Rita | Goltz, Ursula

Article Type: Research Article

Abstract: We present a non-interleaving model for non deterministic concurrent processes that is based on labelled event structures. We define operators on labelled event structures like parallel composition, nondeterministic combination, choice, prefixing and hiding. These operators correspond to the operations of the “Theory of Communicating Sequential Processes” (TCSP). Infinite processes are defined using the metric approach. The dynamic behaviour of event structures is defined by a transition relation which describes the execution of partially ordered sets of actions, abstracting from internal events.

DOI: 10.3233/FI-1991-14103

Citation: Fundamenta Informaticae, vol. 14, no. 1, pp. 39-73, 1991

Authors: Wlaź, Paweł

Article Type: Research Article

Abstract: In this paper, ordered transition rules are investigated. Such rules describe an increment of mono-crystals and for every rule one can calculate so called Wulff Shape. It is shown that for some large class of these rules, there exists at most one growth function which generates a given Wulff Shape.

DOI: 10.3233/FI-1991-14104

Citation: Fundamenta Informaticae, vol. 14, no. 1, pp. 75-89, 1991

Authors: Stepaniuk, Jarosław

Article Type: Research Article

Abstract: The purpose of this paper is to investigate some aspects concerning elementary theories of finite models and to give the applications in approximation logics and algorithmic theory of dictionaries.

DOI: 10.3233/FI-1991-14105

Citation: Fundamenta Informaticae, vol. 14, no. 1, pp. 91-108, 1991

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

Article Type: Research Article

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. Show more

DOI: 10.3233/FI-1991-14106

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

Authors: Stachniak, Zbigniew

Article Type: Research Article

Abstract: In this paper we show that minimal resolution counterparts of strongly finite logics can be effectively constructed. Moreover, we show that the class of resolution counterparts of structural propositional logics coincides with the class of resolution counterparts of strongly finite logics.

DOI: 10.3233/FI-1991-14107

Citation: Fundamenta Informaticae, vol. 14, no. 1, pp. 129-146, 1991