941 search results - page 9 / 189 » Petri Nets Are Dioids |
TCS
1998
14 years 11 months ago
1998
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
101
click to vote
FUIN
2010
14 years 9 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
TSMC
2010
14 years 6 months ago
2010
This paper introduces a new general methodology for the modeling and reliability evaluation of small isolated power systems, which include wind turbines, photovoltaics, and diesel ...
71
Voted
APN
2010
Springer
15 years 4 months ago
2010
Springer
We prove that plain, bounded, reversible and persistent Petri nets are weakly and strongly separable.
APN
2001
Springer
15 years 4 months ago
2001
Springer
The increasing number of Petri net variants naturally leads to the question whether the term “Petri net” is more than a common name for very different concepts. This contribut...