• Aucun résultat trouvé

Introduction

N/A
N/A
Protected

Academic year: 2022

Partager "Introduction"

Copied!
1
0
0

Texte intégral

(1)

Introduction

Regions have been defined about 20 years ago by Andrzej Ehrenfeucht and Grzegorz Rozenberg as sets of nodes of a finite transition system that correspond to potential conditions that enable or disable transition occurrences in a corresponding elementary net system. Thus, regions have been the essential concept for synthesis of elementary net systems from its “anonymous” state graph (states are unknown but transitions between states are known). Since that time, many generalizations and variants of the synthesis problem of Petri nets from behavioural descriptions have been stud- ied, including synthesis of more general Petri net classes, synthesis from languages, synthesis from partially ordered runs and synthesis from incomplete behavioural de- scriptions. All this work has in common that the transition names are given more or less directly by the behavioural description. The places of the net to be synthesized always correspond to regions which are defined in many different ways, depending on the form of the behavioural description. A major issue in this research is the study of regions, whence we call the entire research directionRegion Theory.

Region Theory was applied in many different areas such as:

• hardware synthesis from precise specifications (synthesis from transition sys- tems)

• visualization of concurrent hardware behaviour (synthesis from logic circuit models, transition systems and partial orders)

• GALS synthesis and desynchronisation based on synthesis (synthesis from step transition systems and re-synthesis from Petri nets)

• synthesis of control and policies for discrete event systems (synthesis from both languages and transition systems)

• modelling biological (membrane) systems with localities (synthesis from step transition systems)

• generation of specifications from incomplete specifications (mining from transi- tion systems)

• model generation from examples (specification from (partial) languages)

• mining of process descriptions (mining from languages)

The aim of the ART workshop series was to bring together people working in these or other application areas of region theory, to exchange ideas and concepts and to work on common workshop results.

This chapter contains reviewed contributions submitted to and presented at the 1st ART workshop in Braga, Portugal.

J¨org Desel (Hagen, Germany) Alex Yakovlev (Newcastle University, UK)

Références

Documents relatifs

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

Unité de recherche INRIA Futurs : Domaine de Voluceau - Rocquencourt - BP 105 - 78153 Le Chesnay Cedex (France) Unité de recherche INRIA Lorraine : LORIA, Technopôle de Nancy-Brabois

The synthesis of P/T-nets from modular automata is grounded on regions of regular languages. The state graph of N is a labelled graph, with markings as vertices, where there is an

We identify two classes of branching processes and two types of unfoldings: weakly safe and faithful, and we show that every net admits a weakly safe and a faithful unfolding, which

In [15] the synthesis of free-choice Petri nets is handled by label splitting, which means that in the resulting Petri net different transitions might produce the same event, which

Given an infinite LPES represented by some finite prefix equipped with a cutting context and cut-off events it is shown how to synthesize a bounded Petri net, such that the unfolding

For this reason, the non-structural properties can be used as limiting conditions on the class of transition systems eligible for Petri net (pre-)synthesis; this will be

Classical representations of such a spec- ification encompass labelled transitions systems (lts for short), which are rooted directed graphs with labels on the arcs, and a