Efficient Algorithms
|
Efficient Algorithms |
[Abdulla and Kindahl, 1995] 
|
Parosh Aziz Abdulla and Mats Kindahl (1995). Decidability of simulation and bisimulation between Lossy Channel Systems and Finite State Systems. In: Lee and Smolka (eds.), Proc. CONCUR '95-6th Int. Conf. on Concurrency Theory. Volume 962 of Lecture Notes in Computer Science. pp. 333--347. Published by Springer Verlag. |
| [Abdulla et al., 1997]
|
Parosh Aziz Abdulla and Mats Kindahl and Doron Peled (1997). An Improved Search Strategy for Lossy Channel Systems. In: Tadanori Mizuno and Nori Shiratori and Teruo Hegashino and Atsushi Togashi (eds.), FORTE X/PSTV XVII '97. pp. 251--264. Published by Chapman and Hall. |
| [Abdulla et al., 1997]
|
Parosh Aziz Abdulla and Bengt Jonsson and Aletta Nylén (1997). Modelling and Automated Verification of Authentication Protocols. In: Proceedings of Dimacs workshop on design and formal verification of security protocols. |
| [Abdulla et al., 1998]
|
Parosh Aziz Abdulla and Bengt Jonsson and Mats Kindahl and Doron Peled (1998). A General Approach to Partial Order Reductions in Symbolic Verification. In: Proc. 10th Int. Conf. on Computer Aided Verification. Volume 1427 of Lecture Notes in Computer Science. pp. 379--390. |
| [Abdulla and Nylén, 2000]
|
Parosh Aziz Abdulla and Aletta Nylén (2000). Better is Better than Well: On Efficient Verification of Infinite-State Systems. In: Proc. LICS '00-15th IEEE Int. Symp. on Logic in Computer Science. pp. 132--140. |
| [Abdulla and Nylén, 2001]
|
Parosh Aziz Abdulla and Aletta Nylén (2001). Timed Petri Nets and BQOs. In: Proc. ICATPN'2001: 22nd Int. Conf. on application and theory of Petri nets. Volume 2075 of Lecture Notes in Computer Science. pp. 53--70. |