1099 search results - page 55 / 220 » Petri net ontology |
CDC
2009
IEEE
14 years 8 days ago
2009
IEEE
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
APN
1997
Springer
14 years 2 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...
JCSS
2010
13 years 9 months ago
2010
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...
APN
2005
Springer
14 years 4 months ago
2005
Springer
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models allowing more...
RECOMB
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. The Pathalyzer is a program for analyzing large-scale signal transduction networks. Reactions and their substrates and products are represented as transitions and places ...