Henri Hansen

28 papers A* 2A 1B 6C 2Journal 8Unranked 9
YearRankTypeTitle / Venue / Authors
2026 J jnl
Topological clustering of agents in information contagions: Application to financial markets.
Expert Syst. Appl.
Anubha Goel, Henri Hansen, Juho Kanniainen
2025 J jnl
Learning hidden cascades via classification.
CoRR
Derrick Gilchrist Edward Manoharan, Anubha Goel, Alexandros Iosifidis, Henri Hansen, Juho Kanniainen
2024 J jnl
Detachment Problem - Application in Prevention of Information Leakage in Stock Markets.
CoRR
Henri Hansen, Juho Kanniainen
2018 C conf
Progress Checking for Dummies.
FMICS
Antti Valmari, Henri Hansen
2017 — conf
Abstractions for Transition Systems with Applications to Stubborn Sets.
Concurrency, Security, and Puzzles
Henri Hansen
2017 A* conf
FiB: squeezing loop invariants by interpolation between Forward/Backward predicate transformers.
ASE
Shang-Wei Lin, Jun Sun, Hao Xiao, Yang Liu, David Sanán, Henri Hansen
2017 J jnl
Stubborn Set Intuition Explained.
Trans. Petri Nets Other Model. Concurr.
Antti Valmari, Henri Hansen
2016 J jnl
Guard-based partial-order reduction.
Int. J. Softw. Tools Technol. Transf.
Alfons Laarman, Elwin Pater, Jaco van de Pol, Henri Hansen
2016 — conf
Safety Property-Driven Stubborn Sets.
RP
Henri Hansen, Antti Valmari
2016 — conf
Stubborn Set Intuition Explained.
PNSE @ Petri Nets
Antti Valmari, Henri Hansen
2015 — conf
Practical Partial Order Reduction for CSP.
NFM
Thomas Gibson-Robinson, Henri Hansen, A. W. Roscoe, Xu Wang
2014 J jnl
A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time.
Theor. Comput. Sci.
Henri Hansen, Mark Timmer
2014 A* conf
Diamonds Are a Girl's Best Friend: Partial Order Reduction for Timed Automata with Abstractions.
CAV
Henri Hansen, Shang-Wei Lin, Yang Liu, Truong Khanh Nguyen, Jun Sun
2014 J jnl
Old and New Algorithms for Minimal Coverability Sets.
Fundam. Informaticae
Antti Valmari, Henri Hansen
2012 B conf
Old and New Algorithms for Minimal Coverability Sets.
Petri Nets
Antti Valmari, Henri Hansen
2011 J jnl
Can Stubborn Sets Be Optimal?
Fundam. Informaticae
Antti Valmari, Henri Hansen
2011 — conf
Compositional Analysis for Weak Stubborn Sets.
ACSD
Henri Hansen, Xu Wang
2011 B conf
On the Origin of Events: Branching Cells as Stubborn Sets.
Petri Nets
Henri Hansen, Xu Wang
2011 — conf
Partial Order Reduction for Model Checking Markov Decision Processes under Unconditional Fairness.
QEST
Henri Hansen, Marta Z. Kwiatkowska, Hongyang Qu
2010 B conf
Can Stubborn Sets Be Optimal?
Petri Nets
Antti Valmari, Henri Hansen
2009 B conf
Exploring the Scope for Partial Order Reduction.
ATVA
Jaco Geldenhuys, Henri Hansen, Antti Valmari
2008 B conf
Cheap and Small Counterexamples.
SEFM
Henri Hansen, Jaco Geldenhuys
2006 — conf
Larger Automata and Less Work for LTL Model Checking.
SPIN
Jaco Geldenhuys, Henri Hansen
2006 — conf
Minimal Counterexamples in O(n log n) Memory and O(n^2) Time.
ACSD
Henri Hansen, Antti Kervinen
2006 B conf
Operational Determinism and Fast Algorithms.
CONCUR
Henri Hansen, Antti Valmari
2004 A conf
Tampere Verification Tool.
TACAS
Heikki Virtanen, Henri Hansen, Antti Valmari, Juha Nieminen, Timo Erkkilä
2003 — conf
Merging State-Based and Action-Based Verification.
ACSD
Henri Hansen, Heikki Virtanen, Antti Valmari
2002 C conf
Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties.
FMICS
Henri Hansen, Wojciech Penczek, Antti Valmari