289 search results - page 4 / 58 » Production Scheduling by Reachability Analysis - A Case Stud... |
DAC
2005
ACM
14 years 7 months ago
2005
ACM
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
CAV
2004
Springer
13 years 9 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...
FORMATS
2009
Springer
13 years 9 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
FM
2001
Springer
13 years 10 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
HYBRID
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper we model coupled genetic and metabolic networks as hybrid systems. The vector fields are multi - affine, i.e., have only product - type nonlinearities to a...