74 search results - page 2 / 15 » Reachability analysis for a class of Petri nets |
SOFSEM
2009
Springer
14 years 2 months ago
2009
Springer
Petri nets are an effective formalism to model discrete event systems, and several variants have been defined to explicitly include real time in the model. We consider two fundam...
ICRA
1993
IEEE
13 years 9 months ago
1993
IEEE
DAC
1996
ACM
13 years 9 months ago
1996
ACM
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
ATVA
2007
Springer
13 years 11 months ago
2007
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. The expected...
AC
2003
Springer
13 years 10 months ago
2003
Springer
We address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable marking...