Author
Grzegorz Rozenberg
Other affiliations: Åbo Akademi University, University of Warsaw, University of Antwerp ...read more
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.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this article, it was shown that if a semigroup is separative, then every word in the semigroup has a unique minimum factorization with respect to the complement of the semigroup.
Abstract: Let $S$ be a semigroup of words over an alphabet $A$. Let $\Omega(S)$ consist of those elements $w$ of $S$ for which every prefix and suffix of $w$ belongs to $S$. We show that $\Omega(S)$ is a free semigroup. Moreover, $S$ is called separative if also the complement $S^c = A^+\setminus S$ is a semigroup. There are uncountably many separative semigroups over $A$, if $A$ has at least two letters. We prove that if $S$ is separative, then every word $w \in A^+$ has a unique minimum factorization $w = z_1z_2 \cdots z_n$ with respect to $\Omega(S)$ and $\Omega(S^c)$, where $z_i \in \Omega(S) \cup \Omega(S^c)$ and $n$ is as small as possible.
[...]
TL;DR: This tutorial presents some basic notions and results of the theory of (labeled) 2-structures and some examples show how the model derived here can be modified for flows on rugous topographies.
Abstract: This tutorial presents some basic notions and results of the theory of (labeled) 2-structures.
Posted Content•
TL;DR: This talk is concerned with the intrinsic similarities and differences between Petri nets on the one hand, and membrane systems and reaction systems on the other hand.
Abstract: In this talk we are concerned with the intrinsic similarities and differences between Petri nets on the one hand, and membrane systems and reaction systems on the other hand.
TL;DR: The family of languages generated by context-free programmed grammars equals that generated bycontext-free grammARS with graph-controlled tables under unconditional transfer.
Cited by
More filters
01 Apr 1989
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
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. >
10,755 citations
Journal Article•
9,185 citations
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
7,096 citations
Book•
18 Dec 1991
3,409 citations