scispace - formally typeset
Search or ask a question
Author

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.


Papers
More filters
Journal ArticleDOI
TL;DR: The generative capacity of the different mechanisms of EOL form interpretations is considered and new mechanisms which deal with uniformity are introduced and investigated.
01 Jan 2006
TL;DR: In this article, Houweling et al. present the results of a study conducted at the University of Leiden in the Netherlands, where the authors proposed a method to solve the problem of communication in the context of computer science.
Abstract: 1 Leiden University, Mathematical Institute Niels Bohrweg 1, 2333 CA Leiden, The Netherlands muskulus@math.leidenuniv.nl 2 Vrije Universiteit Amsterdam, Faculteit der Bewegingswetenschappen Van der Boechorststraat 9, 1081 BT Amsterdam, The Netherlands s.houweling@fbw.vu.nl 3 Leiden University, Leiden Institute of Advanced Computer Science Niels Bohrweg 1, 2333 CA Leiden, The Netherlands {rbrijder,rozenber}@liacs.nl 4 Universita degli Studi di Milano Dipartimento di Informatica e Comunicazione Via Comelico 39, 20135 Milano, Italy besozzi@dico.unimi.it 5 Universita degli Studi di Milano Dipartimento di Informatica, Sistemistica e Comunicazione Via Bicocca degli Arcimboldi 8, 20126 Milano, Italy {pescini,cazzaniga}@disco.unimib.it
Patent
12 Feb 2001
TL;DR: In this paper, a computational method that makes use of DNA molecules is disclosed, which can be summarized as follows: a set of DNA molecule representing all possible assignments to all variables of a given computational problem is generated (this is the so-called combinatorial library of the problem).
Abstract: A computational method that makes use of DNA molecules is disclosed. The method can be summarized as follows. First, a set of DNA molecules representing (by their sequences) all possible assignments to all variables of a given computational problem is generated (this is the so-called combinatorial library of the problem). Second, all the DNA molecules representing assignments which do not correspond to solutions of the problem are inactivated (blocked) for reproduction or detection. Finally, one has to check only whether any active (non-blocked) molecules remain: a solution of the problem exists if and only if any such molecules remain. In principle this allows to solve computationally difficult problems. We illustrate our method by outlining a solution for the famous satisfiability problem using both a polymerase chain reaction (PCR) method and a fluorescent quenching assay.
Book ChapterDOI
01 Jan 2004
TL;DR: In this chapter the authors shall introduce two formalizations of the MDS structure of genes, viz., MDS arrangements and MDS descriptors.
Abstract: In this chapter we shall introduce two formalizations of the MDS structure of genes, viz., MDS arrangements and MDS descriptors. MDS arrangements result from representing each elementary or composite MDS by its own symbol, and then by representing the MDS structure of a micronuclear or an intermediate gene by the string of symbols corresponding to the sequence of MDSs. On the other hand. MDS descriptors follow the key observation concerning gene assembly (stated in Chap. 2) that it is not the whole structure of MDSs but only their repeat sequences (pointers) that guide gene assembly. Therefore, in the framework of MDS descriptors each MDS is represented by the pair of its pointers, with each pointer represented by its own symbol. Correspondingly, the IUS descriptor of a micronuclear or an intermediate gene is the string of pairs of pointers corresponding to the sequence of MDSs.

Cited by
More filters
Journal ArticleDOI
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 ArticleDOI
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