List of publications Alternatively, see DBLP
Tieteelliset/Scientific :

Hansen, H., Penczek, W. & Valmari, A: Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties. Accepted to FMICS 02, Seventh International Workshop on Formal Methods for Industrial Critical Systems, Malaga, Spain, July 12-13, 2002 (ENTCS)

Hansen, H., Virtanen, H. & Valmari, A: Merging State-based and Action-based Verification. Accepted to ACSD 03, Third International Conference on Application of Concurrency to System Design, Guimaraes, Portugal, June 18-20, 2003 (IEEE)

Hansen, H. and Ruuska, M.: Assessing Time-Efficiency in a Course on Data Structures and Algorithms. Accepted to Kolin Kolistelut - Koli Calling 2003, 3rd Annual Finnish / Baltic Sea Conference on Computer Science Education

Hansen et. al.: Tampere Verification Tool. In proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2004. (LNCS)

Geldenhuys, J. and Hansen, H. Larger Automata and Less work for LTL Model Checking In proceedings of the 13th international SPIN workshop, 2006. (LNCS)

Hansen, H. and Kervinen, A. Minimal Counterexamples in O(n log n) memory and O(n^2) Time In proceedings of ACSD 2006, the 6th International Conference on Application of Concurrency to System Design, 2006. (IEEE)

Hansen, H. and Valmari, A. Operational Determinism and Fast Algorithms In proceedings of the 17th International Conference on Concurrency Theory, 2006 (LNCS)

Hansen, H. Alternatives to Buchi automata Doctor of Technology Thesis, 2007.

Geldenhuys, J. and Hansen, H. An Asynchronous Distributed Nested Search Algorithm for LTL Model Checking Technical report. To appear.

Geldenhuys, J. and Hansen, H. Cheap and Short Counterexamples SEFM2008.

Geldenhuys, J., Hansen, H., Valmari A. Exploring the scope for Partial order Reduction ATVA 2009.

Valmari, A. and Hansen, H. Could Stubborn sets be optimal? Petri Nets 2010, also Fundamenta informaticae

Hansen, H. and Wang, X. Compositional Analysis for Weak Stubborn Sets ACSD 2011

Hansen, H. and Wang, X. On the Origin of Events: Branching Cells as Stubborn Sets Petri Nets 2011

Hansen, H. and Kwiatkowska, M.Z. and Qu, H. Partial Order Reduction for Model Checking Markov Decision Processes under Unconditional Fairness QEST 2011

Valmari, A. and Hansen, H Old and New Algorithms for Minimal Coverability Sets Petri Nets 2012, also accepted to Fundamenta Informaticae

Hansen, H. and Timmer, M. A Comparison of Confluence and Ample Sets in Probabilistic and Non-Probabilistic Branching Time Manuscript accepted to Theoretical Computer Science, 2013


Machine, Karri O., H. Hansen: Bound by Water EP. MR-001, July 1999