scispace - formally typeset
Search or ask a question

Showing papers by "Grzegorz Rozenberg published in 1995"


Proceedings ArticleDOI
13 Aug 1995
TL;DR: A Petri net formalism is used to analyze structural change within office procedures and proves that a class of change called “synthetic cut-over change” maintains correctness when downsizing occurs.
Abstract: Dynamic change is a large and pervasive unsolved problem which surfaces within office systems as well as within software engineering, manufacturing, and numerous other domains. Procedural changes, performed in an ad hoc manner, can cause inefficiencies, inconsistencies, and catastrophic breakdowns within offices. This paper is concerned with dynamic change to procedures in the context of workflow systems. How can we make workflow systems more flexible and open? We believe that part of the answer lies in the study and solution of the dynamic change problem. In this paper, we use a Petri net formalism to analyze structural change within office procedures. As an example, we define a class of change called “synthetic cut-over change”, and apply our formalism to prove that this class maintains correctness when downsizing occurs.

563 citations


Book
07 Mar 1995
TL;DR: This monograph covers all important research lines of the theory of traces and is organized in such a way that each chapter can be read independently - and hence is suitable for advanced courses/seminars on formal language theory and the Theory of concurrent systems.
Abstract: The theory of traces belongs to both formal language theory and the theory of concurrent systems. In both these disciplines it is a well-recognized and dynamic research area. Within formal language theory it yields the theory of partially commutative monoids, and provides an important connection between languages and graphs. Within the theory of concurrent systems it provides an important formal framework for the analysis and synthesis of concurrent systems. This monograph covers all important research lines of the theory of traces - each chapter of the book is devoted to one research line and is written by leading experts. It is organized in such a way that each chapter can be read independently - and hence is suitable for advanced courses/seminars on formal language theory and the theory of concurrent systems.

508 citations


Book ChapterDOI
10 Jul 1995
TL;DR: From the combination of knowledge and actions, someone can improve their skill and ability as mentioned in this paper. This is why, the students, workers, or even employers should have reading habit for books.
Abstract: From the combination of knowledge and actions, someone can improve their skill and ability. It will lead them to live and work much better. This is why, the students, workers, or even employers should have reading habit for books. Any book will give certain knowledge to take all benefits. This is what this theory of 2 structures tells you. It will add more knowledge of you to life and work better. Try it and prove it.

42 citations


Journal ArticleDOI
TL;DR: It is shown that by smoothly strengthening the regional axioms for elementary transition systems, one obtains a subclass called occurrence transition system, and proved that it is "correct" in a strong categorical sense.
Abstract: A subclass of transition systems called elementary transition systems can be identified with the help of axioms based on a structural notion called regions. Elementary transition systems have been shown to be the transition system model of a basic system model of net theory called elementary net systems. Here we show that by smoothly strengthening the regional axioms for elementary transition systems, one obtains a subclass called occurrence transition system. We then prove that occurrence transition systems are the transition system model of yet another basic model of concurrency, namely, prime event structures. We then propose an operation of unfolding elementary transition systems into occurrence transition systems, We prove that it is "correct" in a strong categorical sense.

25 citations


Journal ArticleDOI
TL;DR: Terminally coded (TC) grammars are introduced, which generalize parenthesis Grammar in the sense that from each word ω generated by a TC grammar the authors can recover the unlabeled tree t underlying its derivation tree(s), and there is a length-preserving homomorphism that maps ω to an encoding of t.
Abstract: We introduce terminally coded (TC) grammars, which generalize parenthesis grammars in the sense that from each word ω generated by a TC grammar we can recover the unlabeled tree t underlying its derivation tree(s). More precisely, there is a length-preserving homomorphism that maps ω to an encoding of t. Basic properties of TC grammars are established. For backwards deterministic TC grammars we give a shift-reduce precedence parsing method without look-ahead, which implies that TC languages can be recognized in linear time. The class of TC languages contains all parenthesis languages, and is contained in the classes of simple precedence languages and NTS languages.

1 citations