A Partial Order Semantics for FIFO-Nets

Cinzia BERNARDESCHI; Nicoletta De FRANCESCO; Gigliola VAGLINI

A Partial Order Semantics for FIFO-Nets

Cinzia BERNARDESCHI, Nicoletta De FRANCESCO, Gigliola VAGLINI

Full Text Views

0

Cite this

Summary :

In this work, we give a true concurrency semantics for FIFO-nets, that are Petri nets in which places behave as queues, tokens take values in a finite alphabet and the firing of a transition depends on sequences on the alphabet. We introduce fn-processes to represent the concurrent behavior of a FIFO-net N during a sequence of transition firings. Fn-processes are modeled by a mapping from a simple FIFO-net without queue sharing and cycles, named FIFO-occurrence net, to N. Moreover, the relation among the firings expressed by the FIFO-occurrence net has been enriched by an ordering relation among the elements of the FIFO-occurrence net representing values entered into a same queue of N. We give a way to build fn-processes step by step in correspondance with a sequence of transition firings and the fn-processes operationally built are all those abstractly defined. The FIFO-occurrence nets of fn-processes have some interesting properties; for example, such nets are always discrete and, consequently, there is at least a transition sequence corresponding to each fn-process.

Publication: IEICE TRANSACTIONS on Information Vol.E81-D No.8 pp.773-782

Publication Date: 1998/08/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Automata,Languages and Theory of Computing

Cite this

Copy

Cinzia BERNARDESCHI, Nicoletta De FRANCESCO, Gigliola VAGLINI, "A Partial Order Semantics for FIFO-Nets" in IEICE TRANSACTIONS on Information, vol. E81-D, no. 8, pp. 773-782, August 1998, doi: .
Abstract: In this work, we give a true concurrency semantics for FIFO-nets, that are Petri nets in which places behave as queues, tokens take values in a finite alphabet and the firing of a transition depends on sequences on the alphabet. We introduce fn-processes to represent the concurrent behavior of a FIFO-net N during a sequence of transition firings. Fn-processes are modeled by a mapping from a simple FIFO-net without queue sharing and cycles, named FIFO-occurrence net, to N. Moreover, the relation among the firings expressed by the FIFO-occurrence net has been enriched by an ordering relation among the elements of the FIFO-occurrence net representing values entered into a same queue of N. We give a way to build fn-processes step by step in correspondance with a sequence of transition firings and the fn-processes operationally built are all those abstractly defined. The FIFO-occurrence nets of fn-processes have some interesting properties; for example, such nets are always discrete and, consequently, there is at least a transition sequence corresponding to each fn-process.
URL: https://global.ieice.org/en_transactions/information/10.1587/e81-d_8_773/_p

Copy

@ARTICLE{e81-d_8_773,
author={Cinzia BERNARDESCHI, Nicoletta De FRANCESCO, Gigliola VAGLINI, },
journal={IEICE TRANSACTIONS on Information},
title={A Partial Order Semantics for FIFO-Nets},
year={1998},
volume={E81-D},
number={8},
pages={773-782},
abstract={In this work, we give a true concurrency semantics for FIFO-nets, that are Petri nets in which places behave as queues, tokens take values in a finite alphabet and the firing of a transition depends on sequences on the alphabet. We introduce fn-processes to represent the concurrent behavior of a FIFO-net N during a sequence of transition firings. Fn-processes are modeled by a mapping from a simple FIFO-net without queue sharing and cycles, named FIFO-occurrence net, to N. Moreover, the relation among the firings expressed by the FIFO-occurrence net has been enriched by an ordering relation among the elements of the FIFO-occurrence net representing values entered into a same queue of N. We give a way to build fn-processes step by step in correspondance with a sequence of transition firings and the fn-processes operationally built are all those abstractly defined. The FIFO-occurrence nets of fn-processes have some interesting properties; for example, such nets are always discrete and, consequently, there is at least a transition sequence corresponding to each fn-process.},
keywords={},
doi={},
ISSN={},
month={August},}

Copy

TY - JOUR
TI - A Partial Order Semantics for FIFO-Nets
T2 - IEICE TRANSACTIONS on Information
SP - 773
EP - 782
AU - Cinzia BERNARDESCHI
AU - Nicoletta De FRANCESCO
AU - Gigliola VAGLINI
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E81-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 1998
AB - In this work, we give a true concurrency semantics for FIFO-nets, that are Petri nets in which places behave as queues, tokens take values in a finite alphabet and the firing of a transition depends on sequences on the alphabet. We introduce fn-processes to represent the concurrent behavior of a FIFO-net N during a sequence of transition firings. Fn-processes are modeled by a mapping from a simple FIFO-net without queue sharing and cycles, named FIFO-occurrence net, to N. Moreover, the relation among the firings expressed by the FIFO-occurrence net has been enriched by an ordering relation among the elements of the FIFO-occurrence net representing values entered into a same queue of N. We give a way to build fn-processes step by step in correspondance with a sequence of transition firings and the fn-processes operationally built are all those abstractly defined. The FIFO-occurrence nets of fn-processes have some interesting properties; for example, such nets are always discrete and, consequently, there is at least a transition sequence corresponding to each fn-process.
ER -