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
01 Jan 2012
TL;DR: In this article, the authors focus on the problem of synthesizing a membrane system from a behavioral specification given in the form of a transition system which specifies the desired state space of the system to be constructed.
Abstract: Automated synthesis from behavioural specifications is an attractive and powerful way of constructing concurrent systems. Here we focus on the problem of synthesising a membrane system from a behavioural specification given in the form of a transition system which specifies the desired state space of the system to be constructed. We demonstrate how a Petri net solution to this problem, based on the notion of region of a transition system, yields a method of automated synthesis of membrane systems from state spaces.

1 citations

Journal ArticleDOI
TL;DR: Two topics related to binary grammatical codes are presented and it is shown that the only binary codes that are minimal in this sense are the so-called “strict” binary codes (as considered in [3]).

1 citations

Patent
14 Nov 2001
TL;DR: In this paper, the use of a proteinaceous molecule as a representation of a combination of values for variables of a computational problem has been proposed, with a set of binding molecules designed for binding to proteinaceous molecules representing solutions.
Abstract: The present invention relates to the fields of biology and computer sciences. The present invention provides proteinaceous molecules to encode solutions to computational problems. In one aspect the invention provides the use of a proteinaceous molecule as a representation of a combination of values for variables of a computational problem. In a second aspect the invention provides a library of proteinaceous molecules representing essentially all relevant solutions to at least one computational problem. The invention further provides a nucleic acid library encoding a library of proteinaceous molecules according to the invention. In a third aspect, the invention provides a method for detecting a proteinaceous molecule representing a combination of values for variables of a computational problem comprising contacting a library of proteinaceous molecules of the invention, with a set of binding molecules designed for binding to proteinaceous molecules representing solutions. In a fourth aspect the invention provides an apparatus for providing a solution to a computational problem comprising a library of the invention, and means for detection of a solution.

1 citations


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