Sciweavers

111 search results - page 8 / 23
» DNA Algorithms for Petri Net Modeling
Sort
View
IFM
2009
Springer
119views Formal Methods» more  IFM 2009»
14 years 2 months ago
Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
Abstract. To model real-life critical systems, one needs“high-level”languages to express three important concepts: complex data structures, concurrency, and real-time. So far, ...
Jan Stöcker, Frédéric Lang, Hub...
CONCUR
2000
Springer
13 years 12 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
TOPNOC
2008
13 years 7 months ago
McMillan's Complete Prefix for Contextual Nets
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
Paolo Baldan, Andrea Corradini, Barbara König...
SOFSEM
2009
Springer
14 years 4 months ago
Symbolic Reachability Analysis of Integer Timed Petri Nets
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...
Min Wan, Gianfranco Ciardo
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
13 years 8 months ago
Reachability analysis for a class of Petri nets
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)...
Yu Ru, Christoforos N. Hadjicostis