Showing papers by "Grzegorz Rozenberg published in 1985"
Book•
10 Apr 1985
TL;DR: PSI as mentioned in this paper is a petri net based simulator for flexible manufacturing systems and is used for modelling and validation of complex systems by coloured petri nets application to a flexible manufacturing system.
Abstract: PSI: A petri net based simulator for flexible manufacturing systems.- Modelling and validation of complex systems by coloured petri nets application to a flexible manufacturing system.- Concurrency axioms and D-continuous posets.- Frozen tokens and D-continuity: A study in relating system properties to process properties.- Modelling scheduling problems with timed petri nets.- Infinite behaviour and fairness in petri nets.- Petri net based models for the specification and validation of protocols.- A note on observable occurrence nets.- A lattice theoretic view of K-density.- Fair serializability of iterated transactions using fifo-nets.- Csp-programs as nets with individual tokens.- Design and programming of interfaces for monetic applications using petri nets.- Towards reachability trees for high-level petri nets.- The residue of vector sets with applications to decidability problems in petri nets.- The design of a program package for an introductory petri net course.- On communication protocol modelling and design.- On structural properties of generalized processes.- Stepwise construction of non-sequential software systems using a net-based specification language.- Liveness and duality in marked-graph-like predicate/transition nets.- Semantics of concurrent systems: A modular fixed-point trace approach.- The reachability problem for VAS.- K-density, N-density, and finiteness properties.- A net model of a local area network protocol.- In praise of free choice nets.- Computation of flows for unary-predicates/transitions-nets.
30 citations
TL;DR: The use of graph grammars for specifying (generating) languages of dependency graphs that arise in theoretical studies of concurrent systems is pointed out.
16 citations
TL;DR: An extensive number of examples are given which illustrate how a quite considerable number of grammars and automata considered in the literature may be ‘naturally’ interpreted as special instances (subclasses of the class) of cts systems.
9 citations
TL;DR: Ce resultat generalise un resultat analogue prouve par Boasson pour les paires iterante forte est degeneree, alors K est un langage rationnel.
Abstract: On montre que si K est un langage algebrique dont toute paire iterante forte est degeneree, alors K est un langage rationnel Ce resultat generalise un resultat analogue prouve par Boasson pour les paires iterantes
8 citations
TL;DR: It is proved that a language is generated by a 1S grammar if and only if it is context-free: this solves an open problem from the theory of selective substitution grammars.
7 citations
TL;DR: The investigation of a- natural subclass of cts systems (which uses the 'context-free grammar selector' for its memory access) and it turns out that this subclass closely corresponds to the Petri net model of concurrent processes.
5 citations
09 Sep 1985
TL;DR: In this paper, some of the recently obtained results that form the basis of a new framework for considering grammars and machines are reviewed.
Abstract: In this paper we review some of the recently obtained results that form the basis of a new framework for considering grammars and machines.
4 citations
TL;DR: It is shown that if g is allowed to be a weak coding, then a larger family of languages is obtained, which however is strictly contained in the family of ETOL languages.
3 citations
Proceedings Article•
01 Jun 1985
1 citations
TL;DR: It is proved that an EOL language has aLB-property if and only if it has aCB-property.
Abstract: Let Δ be an alphabet and II its nontrivial binary partition. Each word over Δ can uniquely be decomposed in subwords (called blocks) consisting of letters of II i only,i ∈ {1,2}. LetK\( \subseteq\) Δ*.K has a long block property (with respect to II), abbreviated asLB-property, if there exists a functionf:N+ →N+ such that for everyw ∈K and every positive integerm the number of blocks of length at mostm inw is bounded byf(m). K has a clustered block property (with respect to II), abbreviated asCB-property, if there exists a positive integerno and a growing functiong:N+ →N+ such that for everyw ∈K and for every positive integerm the blocks of length at mostm can be covered by at mostno segments of length at mostg(m).
1 citations
TL;DR: N nondegenerate hierarchies are presented refining this result that there exist EOL forms for which no form equivalent propagating EOL form exist.