Non-Pure Nets and Their Transition Systems

نویسندگان

  • Marta Pietkiewicz-Koutny
  • Alex Yakovlev
چکیده

This paper extends the theory of regions developed by Nielsen, Rozenberg and Thiagarajan within a set-theoretic framework, to accommodate the class of non-pure nets and their transition systems. Those are called semi-elementary nets and semi-elementary transition systems, respectively. The main motivation of such an extension is practical, the need to model asyn-chronous hardware structures, where certain events happen only when some conditions (these are called co-conditions) are true but without changing the state of these conditions. One of the applications of this theory is synthesis of Petri net models from state-based speciications. As an example we present a Petri net model of control of a counterrow pipeline for Sproull's asynchronous processor. This control was originally speciied as a transition system which did not satisfy elementarity axioms of Nielsen et al.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Synthesis of General Petri Nets Eric Badouel and Philippe Darondeau

A polynomial algorithm was given by the authors and Bernar-dinello for synthesizing pure weighted Petri nets from nite labeled transition systems. The limitation to pure nets, serious in practice e.g. for modelling waiting loops in communication protocols, may be removed by a minor adaptation of the algorithm, working for general Petri nets red sequentially. The rule of sequential ring reduces ...

متن کامل

On the synthesis of general Petri nets

A polynomial algorithm was given by the authors and Bernar-dinello for synthesizing pure weighted Petri nets from nite labeled transition systems. The limitation to pure nets, serious in practice e.g. for modelling waiting loops in communication protocols, may be removed by a minor adaptation of the algorithm, working for general Petri nets red sequentially. The rule of sequential ring reduces ...

متن کامل

Splitting of Actions , Higher - Dimensional Automata , and Net Synthesis Eric Badouel

The behaviour of pure Petri nets (i.e. without side condition) is given by ordinary automata because all information about concurrency is encoded in the structure of the marking graphs. By contrast, the behaviour of (possibly) impure nets requires higher-dimensional automata: independence should in that case be made explicit. These higher-dimensional automata are step transition systems in the ...

متن کامل

Splitting of Actions, Higher-Dimensional Automata, and Net Synthesis

The behaviour of pure Petri nets (i.e. without side condition) is given by ordinary automata because all information about concurrency is encoded in the structure of the marking graphs. By contrast, the behaviour of (possibly) impure nets requires higher-dimensional automata: independence should in that case be made explicit. These higher-dimensional automata are step transition systems in the ...

متن کامل

Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)

A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995