TACAS   2010 Int. Workshop/Conference on Tools and Algorithms for the Construction and Analysis of Systems
Wall of Fame | Most Viewed TACAS-2010 Paper
342views Algorithms» more  TACAS 2010»
13 years 24 days ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
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...
Janusz Malinowski, Peter Niebert
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source342
2Download preprint from source316
3Download preprint from source255
4Download preprint from source251
5Download preprint from source245
6Download preprint from source241
7Download preprint from source225
8Download preprint from source221
9Download preprint from source220
10Download preprint from source212
11Download preprint from source210
12Download preprint from source191
13Download preprint from source181
14Download preprint from source178
15Download preprint from source170
16Download preprint from source169
17Download preprint from source167
18Download preprint from source162
19Download preprint from source160
20Download preprint from source160
21Download preprint from source156
22Download preprint from source153
23Download preprint from source151
24Download preprint from source151
25Download preprint from source146
26Download preprint from source145
27Download preprint from source142
28Download preprint from source137