Sciweavers

941 search results - page 8 / 189
» Haskell-Coloured Petri Nets
Sort
View
CORR
2011
Springer
191views Education» more  CORR 2011»
12 years 10 months ago
Computing Optimal Coverability Costs in Priced Timed Petri Nets
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
Parosh Aziz Abdulla, Richard Mayr
AUTOMATICA
2011
13 years 1 months ago
Timing and liveness in continuous Petri nets
Fluidification constitutes a relaxation technique for studying discrete event systems through fluidified approximated models, thus avoiding the state explosion problem. Moreove...
Carlos Renato Vázquez, Manuel Silva
APN
2003
Springer
13 years 12 months ago
Nets Enriched over Closed Monoidal Structures
Abstract. We show how the firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. On that basis we introduce closed monoidal str...
Eric Badouel, Jules Chenou
SOFSEM
2009
Springer
13 years 11 months ago
Partial Order Semantics of Types of Nets
In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the s...
Robert Lorenz, Gabriel Juhás, Sebastian Mau...
CONCUR
2001
Springer
13 years 11 months ago
On the Power of Labels in Transition Systems
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
Jirí Srba