111 search results - page 5 / 23 » DNA Algorithms for Petri Net Modeling |
APN
2004
Springer
14 years 1 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
CP
1998
Springer
13 years 11 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
IEEEARES
2006
IEEE
14 years 1 months ago
2006
IEEE
Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A classic...
IEAAIE
1998
Springer
13 years 11 months ago
1998
Springer
In this paper a novel method of reference places' detection to build topological models is described, as well as an algorithm for route planning based on Fuzzy Petri Nets. The...
EMISA
2002
Springer
13 years 7 months ago
2002
Springer
DAWN is technique for modelling and verifying network algorithms, which is based on Petri nets and temporal logic. In this paper, we present a different perspective of DAWN that al...