Sciweavers

769 search results - page 2 / 154
» Simple Composition of Nets
Sort
View
APN
1995
Springer
13 years 11 months ago
An Algebraic Semantics for Hierarchical P/T Nets
The first part of this paper gives an algebraic semantics for Place/Transition nets in terms of an algebra which is based on the process algebra ACP. The algebraic semantics is s...
Twan Basten, Marc Voorhoeve
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
13 years 5 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen
FORTE
2007
13 years 9 months ago
A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets
Positive flows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of) positive flows i...
Sami Evangelista, Christophe Pajault, Jean-Fran&cc...
ASIAN
1999
Springer
118views Algorithms» more  ASIAN 1999»
13 years 11 months ago
Asynchronous Links in the PBC and M-Nets
This paper aims at introducing an extension of M-nets, a fully compositional class of high-level Petri nets, and of its low-level counter part, Petri Boxes Calculus (PBC). We intro...
Hanna Klaudel, Franck Pommereau
APN
1992
Springer
13 years 11 months ago
Towards a Modular Analysis of Coloured Petri Nets
The use of different High-level Petri net formalisms has made it possible to create Petri net models of large systems. Even though the use of such models allows the modeller to cr...
Søren Christensen, Laure Petrucci