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: In this paper, the contexts are adjoined by shuffling them on certain trajectories in order to generate mildly context-sensitive languages, which is a new way of generating mildly context sensitive languages.
Abstract: We introduce and investigate a new way of generating mildly context-sensitive languages The main idea is that the contexts are adjoined by shuffling them on certain trajectories In this way we obtain also a very general class of contextual grammars such that most of the fundamental classes of contextual gram-mars, for instance, internal contextual grammars, external contextual grammarsn-contextual grammars, are particular cases of contextual grammars with contexts shuffled on trajectories The approach is very flexible, able to model various aspects from linguistics

4 citations

Journal ArticleDOI
TL;DR: The first of two parts deals with the mathematical theory of the proposed approach to deal with properties of derivations in E0L systems (forms) based on the theory of well-quasi-orders.

4 citations

Book ChapterDOI
01 Jan 2005
TL;DR: The aim of this paper is to introduce a modelling concept and structuring principle for rule-based systems the semantics of which is not restricted to a sequential behavior, but can be applied to various types of parallelism and concurrency.
Abstract: The aim of this paper is to introduce a modelling concept and structuring principle for rule-based systems the semantics of which is not restricted to a sequential behavior, but can be applied to various types of parallelism and concurrency. The central syntactic notion is that of a transformation unit that encapsulates a set of rules, imports other transformation units, and regulates the use and interaction of both by means of a control condition. The semantics is given by interlinking the applications of rules with the semantics of the imported units using a given collection of semantic operations. As the main result, the interlinking semantics turns out to be the least fixed point of the interlinking operator. The interlinking semantics generalizes the earlier introduced interleaving semantics of rule-based transformation units, which is obtained by the sequential composition of binary relations as only semantic operation.

4 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