Result 1 to 20 of 485 total
Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation. (English)
Form. Methods Syst. Des. 40, No. 3, 356-376 (2012).
1
A concurrency-preserving translation from time Petri nets to networks of timed automata. (English)
Form. Methods Syst. Des. 40, No. 3, 330-355 (2012).
2
Constructive Boolean circuits and the exactness of timed ternary simulation. (English)
Form. Methods Syst. Des. 40, No. 3, 283-329 (2012).
3
Symbolic bounded synthesis. (English)
Form. Methods Syst. Des. 40, No. 2, 232-262 (2012).
4
Bounded underapproximations. (English)
Form. Methods Syst. Des. 40, No. 2, 206-231 (2012).
5
Achieving distributed control through model checking. (English)
Form. Methods Syst. Des. 40, No. 2, 263-281 (2012).
6
Automatic generation of inductive invariants from high-level microarchitectural models of communication fabrics. (English)
Form. Methods Syst. Des. 40, No. 2, 147-169 (2012).
7
Fences in weak memory models. (English)
Form. Methods Syst. Des. 40, No. 2, 170-205 (2012).
8
Efficient emptiness check for timed Büchi automata. (English)
Form. Methods Syst. Des. 40, No. 2, 122-146 (2012).
9
Transparent partial order reduction. (English)
Form. Methods Syst. Des. 40, No. 1, 1-19 (2012).
10
Explaining counterexamples using causality. (English)
Form. Methods Syst. Des. 40, No. 1, 20-40 (2012).
11
Interrupt timed automata: verification and expressiveness. (English)
Form. Methods Syst. Des. 40, No. 1, 41-87 (2012).
12
Synthesis of opaque systems with static and dynamic masks. (English)
Form. Methods Syst. Des. 40, No. 1, 88-115 (2012).
13
Special issue: Computer aided verification (CAV’10). Selected papers based on the presentations at the 22nd international conference, Edinburgh, UK, July 15‒19, 2010. (English)
Form. Methods Syst. Des. 40, No. 2, 117-281 (2012).
14
Verification of STM on relaxed memory models. (English)
Form. Methods Syst. Des. 39, No. 3, 297-331 (2011).
15
Priority scheduling of distributed systems based on model checking. (English)
Form. Methods Syst. Des. 39, No. 3, 229-245 (2011).
16
Antichains and compositional algorithms for LTL synthesis. (English)
Form. Methods Syst. Des. 39, No. 3, 261-296 (2011).
17
Exploring structural symmetry automatically in symbolic trajectory evaluation. (English)
Form. Methods Syst. Des. 39, No. 2, 117-143 (2011).
18
Specification and encoding of transaction interaction properties. (English)
Form. Methods Syst. Des. 39, No. 2, 144-164 (2011).
19
Incremental preprocessing methods for use in BMC. (English)
Form. Methods Syst. Des. 39, No. 2, 185-204 (2011).
20
Result 1 to 20 of 485 total
Start
Contact
Print
General Help
