Grzegorz Rozenberg

Bio: Grzegorz Rozenberg is an academic researcher from Leiden University. The author has contributed to research in topics: Petri net & Formal language. The author has an hindex of 81, co-authored 679 publications receiving 31378 citations. Previous affiliations of Grzegorz Rozenberg include Åbo Akademi University & University of Warsaw.

Representing reaction systems by trees

Abstract: Reaction systems formally model the functioning of the living cell. By representing sets of reactions by trees, we obtain a useful tool to investigate the state spaces of reaction systems. In particular, we give an upper bound on the fraction of inactive states within a subspace of the state space. This subspace represents partial knowledge of the (unknown) state under consideration.

Permutable transformation semigroups

Abstract: then they are simply transitive groups of permutations and centralizers of each other. The problem under consideration has its origin in the theory of networks, [2], where permutability of two transformation semigroups (with respect to a network) refers to an independence relation and hence to concurrency of events in the network. For the results and definitions needed here for the permutation groups we refer to [3]. We shall consider transformation semigroups on a finite set ∆. A subsemigroup S of T∆ is said to be transitive if for all a, b ∈ ∆ there exists an α ∈ S such that α(a) = b . A subsemigroup S of T∆ is a permutation group, if S is a subgroup of the symmetric group Sym(∆). Let C(S) = {β ∈ T∆ | αβ = βα for all α ∈ S}

Petri nets: Properties, analysis and applications

Abstract: Starts with a brief review of the history and the application areas considered in the literature. The author then proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis. In particular, one section is devoted to marked graphs, the concurrent system model most amenable to analysis. Introductory discussions on stochastic nets with their application to performance modeling, and on high-level nets with their application to logic programming, are provided. Also included are recent results on reachability criteria. Suggestions are provided for further reading on many subject areas of Petri nets. >