Antti Valmari

ORCID

Publication Activity (10 Years)

Years Active: 1987-2022
Publications (10 Years): 32

Top Venues

CoRR

Fundam. Informaticae

CSEDU (2)

Publications

Thomas Neele, Tim A. C. Willemse, Wieger Wesselink, Antti Valmari
Partial-order reduction for parity games and parameterised Boolean equation systems. Int. J. Softw. Tools Technol. Transf. 24 (5) (2022)
Antti Valmari
Adapting Formal Logic for Everyday Mathematics. CSEDU (2) (2022)
Antti Valmari
Automated Checking of Flexible Mathematical Reasoning in the Case of Systems of (In)Equations and the Absolute Value Operator. CSEDU (2) (2021)
Antti Valmari, Walter Vogler
Stubborn Sets, Frozen Actions, and Fair Testing. Fundam. Informaticae 178 (1-2) (2021)
Thomas Neele, Antti Valmari, Tim A. C. Willemse
A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. Log. Methods Comput. Sci. 17 (3) (2021)
Antti Valmari, Lauri Hella
A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value. CoRR (2021)
Thomas Neele, Antti Valmari, Tim A. C. Willemse
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. FoSSaCS (2020)
Thomas Neele, Antti Valmari, Tim A. C. Willemse
A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. CoRR (2020)
Antti Valmari
All congruences below stability-preserving fair testing or CFFD. Acta Informatica 57 (3-5) (2020)
Antti Valmari, Johanna Rantala
Arithmetic, Logic, Syntax and MathCheck. CSEDU (2) (2019)
Thomas Neele, Antti Valmari, Tim A. C. Willemse
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. CoRR (2019)
Antti Valmari, Vesa Lappalainen
Modelling Without a Modelling Language. SPIN (2018)
Antti Valmari, Walter Vogler
Fair testing and stubborn sets. Int. J. Softw. Tools Technol. Transf. 20 (5) (2018)
Pia Niemelä, Antti Valmari
Elementary Math to Close the Digital Skills Gap. CSEDU (2) (2018)
Antti Valmari, Henri Hansen
Progress Checking for Dummies. FMICS (2018)
Pia Niemelä, Antti Valmari, Simo Ali-Löytty
Algorithms and Logic as Programming Primers. CSEDU (Selected Papers) (2018)
Antti Valmari
Stubborn Sets with Frozen Actions. RP (2017)
Antti Valmari, Henri Hansen
Stubborn Set Intuition Explained. Trans. Petri Nets Other Model. Concurr. 12 (2017)
Antti Valmari
Stop It, and Be Stubborn! ACM Trans. Embed. Comput. Syst. 16 (2) (2017)
Antti Valmari
More Stubborn Set Methods for Process Algebras. Concurrency, Security, and Puzzles (2017)
Antti Valmari, Henri Hansen
Stubborn Set Intuition Explained. PNSE @ Petri Nets (2016)
Raymond R. Devillers, Antti Valmari, Wojciech Penczek
Preface. Fundam. Informaticae 146 (1) (2016)
Antti Valmari
The Congruences below Fair Testing with Initial Stability. ACSD (2016)
Artturi Piipponen, Antti Valmari
Constructing Minimal Coverability Sets. Fundam. Informaticae 143 (3-4) (2016)
Henri Hansen, Antti Valmari
Safety Property-Driven Stubborn Sets. RP (2016)
Antti Valmari, Walter Vogler
Fair Testing and Stubborn Sets. SPIN (2016)
Antti Valmari
A state space tool for concurrent system models expressed in C++. SPLST (2015)
Matti Rintala, Antti Valmari
Priority queue classes with priority update. SPLST (2015)
Antti Valmari
Stop It, and Be Stubborn! CoRR (2015)
Antti Valmari
A State Space Tool for Models Expressed In C++ (tool paper). CoRR (2015)
Antti Valmari
Stop It, and Be Stubborn! ACSD (2015)
Antti Valmari
On constructibility and unconstructibility of LTS operators from other LTS operators. Acta Informatica 52 (2-3) (2015)
Antti Valmari
Character Strings and Gödel's Incompleteness Proof. AFL (2014)
Antti Valmari, Henri Hansen
Old and New Algorithms for Minimal Coverability Sets. Fundam. Informaticae 131 (1) (2014)
Antti Valmari
Asymptotic Proportion of Hard Instances of the Halting Problem. Acta Cybern. 21 (3) (2014)
Mikko Tiusanen, Antti Valmari
Good to Know about the Efficiency of State Space Methods. Nord. J. Comput. 15 (1) (2013)
Antti Valmari
The Asymptotic Behaviour of the Proportion of Hard Instances of the Halting Problem (Extended Version). CoRR (2013)
Artturi Piipponen, Antti Valmari
Constructing Minimal Coverability Sets. RP (2013)
Antti Valmari
All Linear-Time Congruences for Familiar Operators. Log. Methods Comput. Sci. 9 (4) (2013)
Antti Valmari
External Behaviour of Systems of State Machines with Variables. Trans. Petri Nets Other Model. Concurr. 7 (2013)
Antti Valmari, Henri Hansen
Old and New Algorithms for Minimal Coverability Sets. Petri Nets (2012)
Antti Valmari
All Linear-Time Congruences for Finite LTSs and Familiar Operators. ACSD (2012)
Antti Valmari
Fast brief practical DFA minimization. Inf. Process. Lett. 112 (6) (2012)
Antti Valmari
All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs. CONCUR (2012)
Antti Valmari, Henri Hansen
Can Stubborn Sets Be Optimal? Fundam. Informaticae 113 (3-4) (2011)
Antti Valmari
Simple Bisimilarity Minimization in O(m log n) Time. Fundam. Informaticae 105 (3) (2010)
Antti Valmari, Henri Hansen
Can Stubborn Sets Be Optimal? Petri Nets (2010)
Antti Valmari, Giuliana Franceschinis
) Time Markov Chain Lumping. TACAS (2010)
Jaco Geldenhuys, Henri Hansen, Antti Valmari
Exploring the Scope for Partial Order Reduction. ATVA (2009)
Antti Valmari
Software model checking is a rich research field. Int. J. Softw. Tools Technol. Transf. 11 (1) (2009)
Antti Valmari
Bisimilarity Minimization in O(m logn) Time. Petri Nets (2009)
Antti Jääskeläinen, Antti Kervinen, Mika Katara, Antti Valmari, Heikki Virtanen
Synthesizing Test Models from Test Cases. Haifa Verification Conference (2008)
Antti Valmari, Petri Lehtinen
Efficient Minimization of DFAs with Partial Transition Functions CoRR (2008)
Antti Valmari, Petri Lehtinen
Efficient Minimization of DFAs with Partial Transition. STACS (2008)
Henri Hansen, Antti Valmari
Operational Determinism and Fast Algorithms. CONCUR (2006)
Antti Valmari
What the small Rubik's cube taught me about data structures, information theory, and randomisation. Int. J. Softw. Tools Technol. Transf. 8 (3) (2006)
Lars Michael Kristensen, Karsten Schmidt, Antti Valmari
Question-guided stubborn set methods for state properties. Formal Methods Syst. Des. 29 (3) (2006)
Timo Kellomäki, Antti Valmari
A Method for Analysing the Performance of Certain Testing Techniques for Concurrent Systems. ACSD (2005)
Jaco Geldenhuys, Antti Valmari
More efficient on-the-fly LTL verification with Tarjan's algorithm. Theor. Comput. Sci. 345 (1) (2005)
Heikki Virtanen, Henri Hansen, Antti Valmari, Juha Nieminen, Timo Erkkilä
Tampere Verification Tool. TACAS (2004)
Jaco Geldenhuys, Antti Valmari
Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient. TACAS (2004)
Jaco Geldenhuys, Antti Valmari
A Nearly Memory-Optimal Data Structure for Sets and Mappings. SPIN (2003)
Henri Hansen, Heikki Virtanen, Antti Valmari
Merging State-Based and Action-Based Verification. ACSD (2003)
Antero Kangas, Antti Valmari
Verification with the Undefined: A New Look. Electron. Notes Theor. Comput. Sci. 80 (2003)
Antti Valmari, Antti Kervinen
Alphabet-Based Synchronisation is Exponentially Cheaper. CONCUR (2002)
Henri Hansen, Wojciech Penczek, Antti Valmari
Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties. Electron. Notes Theor. Comput. Sci. 66 (2) (2002)
Antti Valmari, Heikki Virtanen, Antti Puhakka
Context-Sensitive Visibility. Electron. Notes Theor. Comput. Sci. 66 (2) (2002)
Doron A. Peled, Antti Valmari, Ilkka Kokkarinen
Relaxed Visibility Enhances Partial Order Reduction. Formal Methods Syst. Des. 19 (3) (2001)
Antti Puhakka, Antti Valmari
Liveness and Fairness in Process-Algebraic Verification. CONCUR (2001)
Jaco Geldenhuys, Antti Valmari
Techniques for Smaller Intermediary BDDs. CONCUR (2001)
Lars Michael Kristensen, Antti Valmari
Improved Question-Guided Stubborn Set Methods for State Properties. ICATPN (2000)
Antti Niemistö, Olli Yli-Harja, Antti Valmari, Pertti Koivisto, Ilya Shmulevich
Reduction factors in finite automata with application to nonlinear filters. EUSIPCO (2000)
Antti Valmari
Composition and Abstraction. MOVEP (2000)
Juhana Helovuo, Antti Valmari
Checking for CFFD-Preorder with Tester Processes. TACAS (2000)
Antti Puhakka, Antti Valmari
Weakest-Congruence Results for Livelock-Preserving Equivalences. CONCUR (1999)
Lars Michael Kristensen, Antti Valmari
Finding Stubborn Sets of Coloured Petri Nets Without Unfolding. ICATPN (1998)
Antti Valmari, Ilkka Kokkarinen
States and Beyond. ACSD (1998)
Jaana Eloranta, Martti Tienari, Antti Valmari
Essential Transitions to Bisimulation Equivalences. Theor. Comput. Sci. 179 (1-2) (1997)
Ilkka Kokkarinen, Doron A. Peled, Antti Valmari
Relaxed Visibility Enhances Partial Order Reduction. CAV (1997)
Antti Valmari, Konsta Karsisto, Manu Setälä
Visualisation of Reduced Abstracted Behaviour as a Design Tool. PDP (1996)
Antti Valmari
Compositionality in State Space Verification Methods. Application and Theory of Petri Nets (1996)
Konsta Karsisto, Antti Valmari
Verification-Driven Development of a Collision-Avoidance Protocol for the Ethernet. FTRTFT (1996)
Antti Valmari
The State Explosion Problem. Petri Nets (1996)
Antti Valmari
Stubborn set methods for process algebras. Partial Order Methods in Verification (1996)
Antti Valmari, Manu Setälä
Visual Verification of Safety and Liveness. FME (1996)
Antti Valmari
The Weakest Deadlock-Preserving Congruence. Inf. Process. Lett. 53 (6) (1995)
Antti Valmari, Martti Tienari
Compositional Failure-based Semantics Models for Basic LOTOS. Formal Aspects Comput. 7 (4) (1995)
Antti Valmari
Failure-based Equivalences Are Faster Than Many Believe. STRICT (1995)
Antti Valmari
Compositional Analysis with Place-Bordered Subnets. Application and Theory of Petri Nets (1994)
Antti Valmari, Jukka Kemppainen, Matthew Clegg, Mikko Levanto
Putting Advanced Reachability Analysis Techniques Together: the "ARA" Tool. FME (1993)
Antti Valmari
On-the-Fly Verification with Stubborn Sets. CAV (1993)
Roope Kaivola, Antti Valmari
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic. CONCUR (1992)
Antti Valmari
A Stubborn Attack on State Explosion. Formal Methods Syst. Des. 1 (4) (1992)
Antti Valmari, Martti Tienari
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm. PSTV (1991)
Antti Valmari
Compositional State Space Generation. Applications and Theory of Petri Nets (1991)
Roope Kaivola, Antti Valmari
Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models. CONCUR (1991)
Antti Valmari, Matthew Clegg
Reduced Labelled Transition Systems Save Verification Effort. CONCUR (1991)
Antti Valmari
A Stubborn Attack on State Explosion. CAV (DIMACS/AMS volume) (1990)
Antti Valmari
A Stubborn Attack On State Explosion. CAV (1990)
Antti Valmari
Stubborn sets for reduced state space generation. Applications and Theory of Petri Nets (1989)

Antti Valmari.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Antti Valmari