Showing papers by "Grzegorz Rozenberg published in 1988"

Graph Grammars and Their Application to Computer Science: 3rd International Workshop Warrenton, Virginia, Usa, December 2-6, 1986

Abstract: Tutorial introduction to the algebraic approach of graph grammars- May we introduce to you: Hyperedge replacement- An introduction to parallel map generating systems- Set theoretic approaches to graph grammars- An introduction to the NLC way of rewriting graphs- Array grammars- Graph grammar based specification of interconnection structures for massively parallel computation- Towards distributed graph grammars- On partially ordered graph grammars- A representation of graphs by algebraic expressions and its use for graph rewriting systems- On context-free sets of graphs and their monadic second-order theory- Restricting the complexity of regular DNLC languages- Apex graph grammars- Graph grammar engineering: A software specification method- A linguistic formalism for engineering solid modeling- Graph grammars and diagram editing- Graphics and their grammars- On network algebras and recursive equations- Ada-concurrency specified by graph grammars- Basic notions of actor grammars- Embedding rule independent theory of graph grammars- Supporting the software development process with attributed NLC graph grammars- Practical applications of precedence graph grammars- Is parallelism already concurrency? Part 1: Derivations in graph grammars- Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars- Map OL-systems with edge label control: Comparison of marker and cyclic systems- From 0L and 1L map systems to indeterminate and determinate growth in plant morphogenesis- Fundamentals of edge-label controlled graph grammars- Parallelism analysis in rule-based systems using graph grammars- An efficient algorithm for the solution of hierarchical networks of constraints- A software development environment based on graph technology- Map 0L systems with markers- Graph rewriting with unification and composition- Complexity of pattern generation via planar parallel binary fission/fusion grammars- Applications of L-systems to computer imagery- Advances in array languages- Rosenfeld's cycle grammars and kolam- Application of graph grammars in music composing systems- Boundary NLC and partition controlled graph grammars

Advances in Petri Nets 1988

Abstract: An environment for object-oriented conceptual programming based on PROT nets.- OBJSA Nets: a class of high-level nets having objects as domains.- On internal and external characterisations of PT-net building block behaviour.- Timed Petri Net schedules.- An exercise in concurrency: A CSP process as a condition/event system.- A survey on the decidability questions for classes of fifo nets.- The construction of EN systems from a given trace behaviour.- Programming a closely coupled multiprocessor system with high level petri nets.- Music description and processing by Petri Nets.- On questions of fairness and temporal logic for conflict-free Petri nets.- Infinitary partial Petri net languages and their relationship to other Petri net semantics.- Net representation of sentences in natural languages.- Some consequences of the decidability of the reachability problem for Petri nets.- Experiences in the use of galileo to design telecommunication systems.- Compositional semantics of pure place/transition systems.- Occurrence traces.- Performance evaluation of interpreted bipolar synchronization schemes using G.E.R.T..- On the generation of organizational architectures using Petri Nets.- On the computation of structural synchronic invariants in P/T nets.- On the implementation of Petri nets.

Apex graph grammars and attribute grammars

Abstract: Apex graph grammars are a particular type of directed node-label controlled (DNLC) graph grammars: the embedding edges are established between terminal nodes only. Apex graph grammars, slightly generalized, can generate the sets of dependency graphs of attribute grammars. The other way around, every apex graph language can be obtained from such a dependency graph language by a graph replacement (which is an operation analogous to a string homomorphism).

Recording the use of memory in right-boundary grammars and push-down automata

Abstract: Within the framework of coordinated pair systems a push-down automaton A is formalized as an ordered pair (G1, G2) of grammars, where G1 is a right-linear grammar modelling the finite state control of A and the reading of the input of A, and G2 is a right-boundary grammar modelling the push-down store of A. In this paper we present a systematic investigation into the use of memory of right-boundary grammars. Various methods of recording the use of memory are introduced. The results presented concern regularity properties of each of the methods and the interrelationships of the records obtained by different methods. Finally the translation of these results to the level of push-down automata (coordinated pair systems) is discussed.