149 search results - page 20 / 30 » SAT-based Unbounded Model Checking of Timed Automata |
154
Voted
NFM
2011
14 years 8 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
121
Voted
MAM
2008
15 years 1 months ago
2008
This paper presents a design methodology for a hybrid Hardwarein-the-Loop (HIL) tester tool, based on both discrete event system theory, given by timed automata, and continuous sy...
132
Voted
HASE
1999
IEEE
15 years 6 months ago
1999
IEEE
Statechart Diagrams provide a graphical notation for describing dynamic aspects of system behaviour within the Unified Modeling Language (UML). In this paper we present a branchin...
146
click to vote
FM
2003
Springer
15 years 7 months ago
2003
Springer
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
122
Voted
WWW
2004
ACM
16 years 2 months ago
2004
ACM
This paper presents a set of tools and techniques for analyzing interactions of composite web services which are specified in BPEL and communicate through asynchronous XML message...