58 search results - page 9 / 12 » A Class of Petri Nets with a Convex Reachability Set |
DEDS
2008
14 years 9 months ago
2008
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
CAV
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
ATVA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
CSL
2007
Springer
15 years 1 months ago
2007
Springer
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
APN
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. Workflow management systems will change the architecture of future information systems dramatically. The explicit representation of business procedures is one of the main...