Results 161 to 170 of about 23,744 (217)
SYNCHRONIZATION IN PETRI NETS [PDF]
Fundamenta Informaticae, 1996 In “Petti nets are Monoids” by Meseguer and Montanari, categories for Petri nets with and without markings are introduced, where the categorical product and coproduct express the joint behavior of nets. However, this framework lacks structure in the sense that there is no categorical technique to define a composition of nets satisfying some given ...
Paulo Blauth Menezes, José Félix Costa
openaire +2 more sources
On the semantics of Petri Nets [PDF]
, 2006 Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the “token game” is too intensional, even in its more abstract interpretations in term of nonsequential processes and monoidal categories; on the other hand, Winskel's basic unfolding ...
Meseguer, J., Montanari, U., Sassone, V.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Discrete Event Dynamic Systems, 2001
The paper is a survey of results developed by the authors and by their team (Laboratoire d'Automatique de Grenoble) in elaborating a Hybrid Petri Nets Theory (i.e., PN consisting of interacting discrete and continuous subnets). The presentation is non-formal and is illustrated by a great number of interesting examples.
René David, Hassane Alla
openaire +1 more source
The paper is a survey of results developed by the authors and by their team (Laboratoire d'Automatique de Grenoble) in elaborating a Hybrid Petri Nets Theory (i.e., PN consisting of interacting discrete and continuous subnets). The presentation is non-formal and is illustrated by a great number of interesting examples.
René David, Hassane Alla
openaire +1 more source
Petri Net Transformations in the ≫Petri Net Baukasten≪
2003The purpose of this contribution is to give an overview of constructions and results for Petri net transformations in the ≫Petri Net Baukasten≪ developed by the “DFG-Forschergruppe Petrinetz-Technologie”. The two main concepts of Petri net transformations considered in this context are net class and net model transformations.
Benjamin Braatz +2 more
openaire +1 more source
IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 1999
This paper presents the possibilistic Petri net model which combines possibility logic with Petri nets with objects. The main feature of this model is to allow one to reason about the aspects of uncertainty and change in dynamic discrete event systems.
Cardoso, Janette +2 more
openaire +4 more sources
This paper presents the possibilistic Petri net model which combines possibility logic with Petri nets with objects. The main feature of this model is to allow one to reason about the aspects of uncertainty and change in dynamic discrete event systems.
Cardoso, Janette +2 more
openaire +4 more sources
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2013
Such concurrent systems as Web services and workflow systems can be viewed as a composition of a set of subsystems. Subsystems interact with each other through a set of message channels in order to perform a task. This work defines a class of Petri nets called interactive Petri nets (IPNs) to model these systems.
GuanJun Liu +3 more
openaire +1 more source
Such concurrent systems as Web services and workflow systems can be viewed as a composition of a set of subsystems. Subsystems interact with each other through a set of message channels in order to perform a task. This work defines a class of Petri nets called interactive Petri nets (IPNs) to model these systems.
GuanJun Liu +3 more
openaire +1 more source
2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), 2005
Diagnosability of discrete event systems (DES) was formally defined in finite state machine (FSM) models by Sampath, et al. They gave a method for testing diagnosability by first constructing a diagnoser for the system. The complexity of this method is exponential in the number of states and doubly exponential in the number of failure types. Later, Yoo,
YuanLin Wen, MuDer Jeng
openaire +1 more source
Diagnosability of discrete event systems (DES) was formally defined in finite state machine (FSM) models by Sampath, et al. They gave a method for testing diagnosability by first constructing a diagnoser for the system. The complexity of this method is exponential in the number of states and doubly exponential in the number of failure types. Later, Yoo,
YuanLin Wen, MuDer Jeng
openaire +1 more source
2008
In a seminal paper Montanari and Meseguer showed that an algebraic interpretation of Petri nets in terms of commutative monoids can be used to provide an elegant characterisation of the deterministic computations of a net, accounting for their sequential and parallel composition.
Baldan, Paolo, GADDUCCI, FABIO
openaire +3 more sources
In a seminal paper Montanari and Meseguer showed that an algebraic interpretation of Petri nets in terms of commutative monoids can be used to provide an elegant characterisation of the deterministic computations of a net, accounting for their sequential and parallel composition.
Baldan, Paolo, GADDUCCI, FABIO
openaire +3 more sources