27 search results - page 5 / 6 » Reachability Problems and Abstract State Spaces for Time Pet... |
CPE
1997
Springer
13 years 11 months ago
1997
Springer
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
ACSD
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factory automation systems. It presents new algorithms to harness this modular analys...
TII
2010
13 years 2 months ago
2010
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. The existence of functional dependency among the state variables of a state transition system was identified as a common cause of inefficient BDD representation in formal...
APN
2008
Springer
13 years 9 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...