135 search results - page 17 / 27 » Model Checking Timed Automata with One or Two Clocks |
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
IANDC
2011
13 years 2 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
ACRI
2006
Springer
14 years 1 months ago
2006
Springer
We develop two models for Myxobacteria swarming, a modified Lattice Gas Cellular Automata (LGCA) model and an off-lattice CA model. In the LGCA model each cell is represented by on...
APCCM
2009
13 years 8 months ago
2009
In life science, deeper understanding of biomolecular systems is acquired by computational modeling and analysis. For the modeling of several kinds of reaction networks, e.g. sign...
GLVLSI
2006
IEEE
14 years 1 months ago
2006
IEEE
Functional verification is one of the major bottlenecks in microprocessor design. Simulation-based techniques are the most widely used form of processor verification. Efficient ...