498 search results - page 18 / 100 » On the Category of Petri Net Computations |
92
Voted
TCS
1998
15 years 11 days 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...
111
Voted
FUIN
2010
14 years 10 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...
ASIAN
1998
Springer
15 years 5 months ago
1998
Springer
In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities betwe...
QEST
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—ITPN-PerfBound is a graphical tool for the modeling and performance bound analysis of Interval Time Petri Nets (ITPN), that has been developed within the DrawNET modelin...
107
Voted
LPNMR
2001
Springer
15 years 5 months ago
2001
Springer
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...