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.

Subset Languages of Petri Nets

Abstract: Formal language theory is used to some extent in the investigation of properties of Petri nets (see, e.g. [H], [JV] and [P]). In most applications of language theory for Petri nets one considers completely sequentialized versions of Petri nets only. That is one assumes that a Petri net has one central run place which allows only a single transition to fire at a time; any sequence of such firings is called a firing sequence and the language of a Petri net consists of the set of all firing sequences (or only of those firing sequences that lead to one of the finite number of final markings).

Advances in Petri Nets, 1989

Abstract: Stochastic Petri nets: An elementary introduction.- Improving the efficiency of the analysis of DSPN models.- Synchronized elementary net systems.- Descriptive and analytical process algebras.- P/T-systems as abstractions of C/E-systems.- The semantics of capacities in P/T nets.- Petri net tool overview 1989.- Equivalence transformations of PrT-Nets.- A reduction theory for coloured nets.- Optimizing microprograms for recurrent loops on pipelined architectures using timed Petri nets.- S-CORT(R): A method for the development of electronic payment systems.- Timed Petri nets and application to multi-stage production systems.- Petri net systems and their closure properties.- Occam and the transputer.- About the concurrent behaviour of EN systems: Definability and closure results.- Petri nets and flexible manufacturing.- Some properties of timed nets under the earliest firing rule.- A comparative study of different techniques for semi-flows computation in place/transition nets.- Elementary net systems and dynamic logic.- Representation of a swapping class by one net.- Design methods based on nets.- CEDISYS compositional distributed systems state of the art, research goals, references.

Characterizing the Micronuclear Gene Patterns in Ciliates

Abstract: The process of gene assembly in ciliates is one of the most complex examples of DNA processing known in any organism, and it is fascinating from the computational point of view—it is a prime example of DNA computing in vivo. In this paper we continue to investigate the three molecular operations (ld, hi , and dlad ) that were postulated to carry out the gene assembly process in the intramolecular fashion. In particular, we focus on the understanding of the IES/ MDS patterns of micronuclear genes, which is one of the important goals of research on gene assembly in ciliates. We succeed in characterizing for each subset S of the three molecular operations those patterns that can be assembled using operations in S. These results enhance our understanding of the structure of micronuclear genes (and of the nature of molecular operations). They allow one to establish both similarity and complexity measures for micronuclear genes.

Simplifications of homomorphisms

Abstract: The notion of a simplification of a homomorphism is introduced and investigated. Its usefulness is demonstrated in providing rather short proofs of the following results: (i) Given an arbitrary homomorphism h and arbitrary words x, y it is decidable whether or not there exists an integer n such that h n ( x ) = h n ( y ). (ii) Given an arbitrary homomorphism h and arbitrary words x, y it is decidable whether or not there exists integers n and r such that h n ( x ) = h r ( y ). (iii) Given an arbitrary DOL system G and an arbitrary integer d it is decidable whether or not G is locally catenative of depth not larger thand d . (iv) The equivalence problem for elementary polynomially bounded DOL systems is decidable.

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