14 search results - page 3 / 3 » The Power of Reachability Testing for Timed Automata |
101
Voted
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
101
Voted
COLT
1995
Springer
15 years 3 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
84
Voted
ISSRE
2007
IEEE
15 years 1 months ago
2007
IEEE
Model-checkers are powerful tools that can find individual traces through models to satisfy desired properties. These traces provide solutions to a number of problems. Instead of...
SIAMCOMP
2010
14 years 10 months ago
2010
Some systems interact with their environment at physically distributed interfaces, called ports, and in testing such a system it is normal to place a tester at each port. Each test...