Petri net controlled grammars with a bounded number of additional places

A context-free grammar and its derivations can be described by a Petri net, called a context-free Petri net, whose places and transitions correspond to the nonterminals and the production rules of the grammar, respectively, and tokens are separate instances of the nonterminals in a sentential form. Therefore , the control of the derivations in a context-free grammar can be implemented by adding some features to the associated cf Petri net. The addition of new places and new arcs from/to these new places to/from transitions of the net leads grammars controlled by k-Petri nets, i.e., Petri nets with additional k places. In the paper we investigate the generative power and give closure properties of the families of languages generated by such Petri net controlled grammars, in particular, we show that these families form an infinite hierarchy with respect to the numbers of additional places

Capacity Bounded Grammars and Petri Nets

A capacity bounded grammar is a grammar whose derivations are restricted by assigning a bound to the number of every nonterminal symbol in the sentential forms. In the paper the generative power and closure properties of capacity bounded grammars and their Petri net controlled counterparts are investigated

Automating the transformation-based analysis of visual languages

The final publication is available at Springer via http://dx.doi.org/10.1007/s00165-009-0114-yWe present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language in the form of graph transformation rules. The approach is geared to the generation of transformations from Domain-Specific Visual Languages (DSVLs) into semantic domains with an explicit notion of transition, like for example Petri nets. The generated transformation is expressed in the form of operational triple graph grammar rules that transform the static information (initial model) and the dynamics (source rules and their execution control structure). We illustrate these techniques with a DSVL in the domain of production systems, for which we generate a transformation into Petri nets. We also tackle the description of timing aspects in graph transformation rules, and its analysis through their automatic translation into Time Petri netsWork sponsored by the Spanish Ministry of Science and Innovation, project METEORIC (TIN2008-02081/TIN) and by the Canadian Natural Sciences and Engineering Research Council (NSERC)

Petri net controlled grammars

Different types of regulated grammars have been introduced in order to supplement shortcomings of context-free grammars in applications preserving their elegant mathematical properties. However, the rapid developments in present day industry, biology, and other areas challenge to deal with various tasks which need suitable tools for their modelling and investigation. We propose Petri net controlled grammars as models for representing and analyzing of metabolic pathways in living cells where Petri nets are responsible for the structure and communication of the pathways, and grammars represent biochemical processes. On the other hand, the control by Petri nets has also theoretical interest: it extends possibilities to introduce and investigate concurrent control mechanisms in formal language theory. The thesis introduces various variants of Petri net controlled grammars using different types of Petri nets and investigates their mathematical properties such as computational power and closure properties.Los diferentes tipos de gramáticas con reescritura regulada han sido introducidas para complementar las deficiencias de las gramáticas libres del contexto en las aplicaciones, preservando sus propiedades matemáticas. Por otro lado, la rápida evolución la biología, y otras áreas actuales supone un reto para tratar de las tareas varias que necesitan las herramientas adecuadas para la elaboración de modelos e investigación. Proponemos gramáticas controladas por redes de Petri como modelos para representar y analizar los procesos bioquímicos en las células vivas donde redes de Petri son responsables de la estructura, y gramáticas representan los procesos generativos. Además, el control de redes de Petri también tiene interés teórico: amplía las posibilidades de investigar los mecanismos de control concurrente en la teoría de lenguajes formales. La tesis presenta distintas variantes de gramáticas controladas por redes de Petri e investiga sus propiedades matemáticas

Place-Labeled Petri Net Controlled Grammars

A place-labeled Petri net (pPN) controlled grammar is a context-free grammar equipped with a Petri net and a function which maps places of the net to the productions of the grammar. The language consists of all terminal strings that can be obtained by simultaneously applying of the rules of multisets which are the images of the sets of the input places of transitions in a successful occurrence sequence of the Petri net. In this paper, we study the generative power and structural properties of pPN controlled grammars. We show that pPN controlled grammars have the same generative power as matrix grammars. Moreover, we prove that for each pPN controlled grammar, we can construct an equivalent place-labeled ordinary net controlled grammar

Translating model simulators to analysis models

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-78743-3_6Proceedings of 11th International Conference, FASE 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008.We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language by means of graph transformation rules. The approach is geared to the generation of transformations from Domain-Specific Visual Languages (DSVLs) into semantic domains with an explicit notion of transition, like for example Petri nets. The generated transformation is expressed in the form of operational triple graph grammar rules that transform the static information (initial model) and the dynamics (source rules and their execution control structure). We illustrate these techniques with a DSVL in the domain of production systems, for which we generate a transformation into Petri nets.Work sponsored by the Spanish Ministry of Science and Education, project MOSAIC (TSI2005-08225-C07-06

Forward Analysis and Model Checking for Trace Bounded WSTS

We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth. Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, boundedness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all $\omega$-regular properties on the set of infinite traces of the system

State machine of place-labelled Petri net controlled grammars

A place-labelled Petri net controlled grammar is, in general, a context-free grammar equipped with a Petri net and a function which maps places of the net to productions of the grammar. The languages of place-labelled Petri net controlled grammar consist of all terminal strings that can be obtained by parallel application of the rules of multisets which are the images of the sets of input places in a successful occurrence sequence of the Petri net. In this paper, we investigate the structural subclass of place-labelled Petri net controlled grammar which focus on the state machine. We also establish the generative capacity of state machine of place-labelled Petri net controlled grammars