Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
Industrial verification teams are actively developing suitable event sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardwar...