101 search results - page 12 / 21 » When Are Timed Automata Determinizable |
CASES
2006
ACM
13 years 11 months ago
2006
ACM
Many embedded systems exhibit temporally and behaviorally disjoint behavior slices. When such behaviors are captured by state machines, the current design flow will capture it as ...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the PRPG before filling the scan chain. In this paper, we present...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We propose a diagnosability notion that depends on two parameters denoted as (δd, δm) for the general class of transition systems where the observable output is given by disc...
JAC
2008
13 years 9 months ago
2008
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the result could actually...