Sciweavers

58 search results - page 6 / 12
» A Class of Petri Nets with a Convex Reachability Set
Sort
View
FUIN
2007
123views more  FUIN 2007»
14 years 9 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
APN
2005
Springer
14 years 11 months ago
Timed-Arc Petri Nets vs. Networks of Timed Automata
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...
Jirí Srba
CONCUR
2005
Springer
15 years 3 months ago
The Individual and Collective Token Interpretations of Petri Nets
Starting from the opinion that the standard firing rule of Petri nets embodies the collective token interpretation of nets rather than their individual token interpretation, I pro...
Rob J. van Glabbeek
RP
2010
Springer
150views Control Systems» more  RP 2010»
14 years 7 months ago
Rewriting Systems for Reachability in Vector Addition Systems with Pairs
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
Paulin Jacobé de Naurois, Virgile Mogbil
LPNMR
2001
Springer
15 years 2 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä