149 search results - page 24 / 30 » SAT-based Unbounded Model Checking of Timed Automata |
RTSS
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
ENTCS
2006
13 years 7 months ago
2006
We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed au...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
ISOLA
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...