![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Antti Valmari
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j29]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): 735-756 (2022) - [c68]Antti Valmari
:
Adapting Formal Logic for Everyday Mathematics. CSEDU (2) 2022: 515-524 - 2021
- [j28]Antti Valmari
, Walter Vogler:
Stubborn Sets, Frozen Actions, and Fair Testing. Fundam. Informaticae 178(1-2): 139-172 (2021) - [j27]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) - [c67]Antti Valmari
:
Automated Checking of Flexible Mathematical Reasoning in the Case of Systems of (In)Equations and the Absolute Value Operator. CSEDU (2) 2021: 324-331 - [i7]Antti Valmari, Lauri Hella:
A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value. CoRR abs/2112.04436 (2021) - 2020
- [j26]Antti Valmari
:
All congruences below stability-preserving fair testing or CFFD. Acta Informatica 57(3-5): 353-383 (2020) - [c66]Thomas Neele
, Antti Valmari
, Tim A. C. Willemse:
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. FoSSaCS 2020: 482-501 - [i6]Thomas Neele, Antti Valmari, Tim A. C. Willemse:
A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. CoRR abs/2012.15704 (2020)
2010 – 2019
- 2019
- [c65]Antti Valmari
, Johanna Rantala:
Arithmetic, Logic, Syntax and MathCheck. CSEDU (2) 2019: 292-299 - [i5]Thomas Neele, Antti Valmari, Tim A. C. Willemse:
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. CoRR abs/1910.09829 (2019) - 2018
- [j25]Antti Valmari, Walter Vogler:
Fair testing and stubborn sets. Int. J. Softw. Tools Technol. Transf. 20(5): 589-610 (2018) - [c64]Pia Niemelä
, Antti Valmari
:
Elementary Math to Close the Digital Skills Gap. CSEDU (2) 2018: 154-165 - [c63]Pia Niemelä
, Antti Valmari
, Simo Ali-Löytty
:
Algorithms and Logic as Programming Primers. CSEDU (Selected Papers) 2018: 357-383 - [c62]Antti Valmari
, Henri Hansen
:
Progress Checking for Dummies. FMICS 2018: 115-130 - [c61]Antti Valmari
, Vesa Lappalainen
:
Modelling Without a Modelling Language. SPIN 2018: 308-327 - 2017
- [j24]Antti Valmari:
Stop It, and Be Stubborn! ACM Trans. Embed. Comput. Syst. 16(2): 46:1-46:26 (2017) - [j23]Antti Valmari, Henri Hansen
:
Stubborn Set Intuition Explained. Trans. Petri Nets Other Model. Concurr. 12: 140-165 (2017) - [c60]Antti Valmari:
More Stubborn Set Methods for Process Algebras. Concurrency, Security, and Puzzles 2017: 246-271 - [c59]Antti Valmari:
Stubborn Sets with Frozen Actions. RP 2017: 160-175 - 2016
- [j22]Artturi Piipponen, Antti Valmari:
Constructing Minimal Coverability Sets. Fundam. Informaticae 143(3-4): 393-414 (2016) - [j21]Raymond R. Devillers, Antti Valmari, Wojciech Penczek
:
Preface. Fundam. Informaticae 146(1): v-vi (2016) - [c58]Antti Valmari:
The Congruences below Fair Testing with Initial Stability. ACSD 2016: 25-34 - [c57]Antti Valmari, Henri Hansen:
Stubborn Set Intuition Explained. PNSE @ Petri Nets 2016: 213-232 - [c56]Henri Hansen
, Antti Valmari:
Safety Property-Driven Stubborn Sets. RP 2016: 90-103 - [c55]Antti Valmari, Walter Vogler:
Fair Testing and Stubborn Sets. SPIN 2016: 225-243 - 2015
- [j20]Antti Valmari:
On constructibility and unconstructibility of LTS operators from other LTS operators. Acta Informatica 52(2-3): 207-234 (2015) - [c54]Antti Valmari:
Stop It, and Be Stubborn! ACSD 2015: 10-19 - [c53]Antti Valmari:
A state space tool for concurrent system models expressed in C++. SPLST 2015: 91-105 - [c52]Matti Rintala, Antti Valmari:
Priority queue classes with priority update. SPLST 2015: 179-193 - [e2]Raymond R. Devillers, Antti Valmari:
Application and Theory of Petri Nets and Concurrency - 36th International Conference, PETRI NETS 2015, Brussels, Belgium, June 21-26, 2015, Proceedings. Lecture Notes in Computer Science 9115, Springer 2015, ISBN 978-3-319-19487-5 [contents] - [i4]Antti Valmari:
Stop It, and Be Stubborn! CoRR abs/1504.02587 (2015) - [i3]Antti Valmari:
A State Space Tool for Models Expressed In C++ (tool paper). CoRR abs/1504.02597 (2015) - 2014
- [j19]Antti Valmari:
Asymptotic Proportion of Hard Instances of the Halting Problem. Acta Cybern. 21(3): 307-330 (2014) - [j18]Antti Valmari, Henri Hansen
:
Old and New Algorithms for Minimal Coverability Sets. Fundam. Informaticae 131(1): 1-25 (2014) - [c51]Antti Valmari:
Character Strings and Gödel's Incompleteness Proof. AFL 2014: 355-369 - 2013
- [j17]Antti Valmari:
All Linear-Time Congruences for Familiar Operators. Log. Methods Comput. Sci. 9(4) (2013) - [j16]Mikko Tiusanen, Antti Valmari:
Good to Know about the Efficiency of State Space Methods. Nord. J. Comput. 15(1): 53-74 (2013) - [j15]Antti Valmari:
External Behaviour of Systems of State Machines with Variables. Trans. Petri Nets Other Model. Concurr. 7: 255-299 (2013) - [c50]Artturi Piipponen, Antti Valmari:
Constructing Minimal Coverability Sets. RP 2013: 183-195 - [i2]Antti Valmari:
The Asymptotic Behaviour of the Proportion of Hard Instances of the Halting Problem (Extended Version). CoRR abs/1307.7066 (2013) - 2012
- [j14]Antti Valmari:
Fast brief practical DFA minimization. Inf. Process. Lett. 112(6): 213-217 (2012) - [c49]Antti Valmari:
All Linear-Time Congruences for Finite LTSs and Familiar Operators. ACSD 2012: 12-21 - [c48]Antti Valmari, Henri Hansen
:
Old and New Algorithms for Minimal Coverability Sets. Petri Nets 2012: 208-227 - [c47]Antti Valmari:
All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs. CONCUR 2012: 162-176 - 2011
- [j13]Antti Valmari, Henri Hansen
:
Can Stubborn Sets Be Optimal? Fundam. Informaticae 113(3-4): 377-397 (2011) - 2010
- [j12]Antti Valmari:
Simple Bisimilarity Minimization in O(m log n) Time. Fundam. Informaticae 105(3): 319-339 (2010) - [c46]Antti Valmari, Henri Hansen
:
Can Stubborn Sets Be Optimal? Petri Nets 2010: 43-62 - [c45]Antti Valmari, Giuliana Franceschinis:
Simple O(m logn) Time Markov Chain Lumping. TACAS 2010: 38-52
2000 – 2009
- 2009
- [j11]Antti Valmari:
Software model checking is a rich research field. Int. J. Softw. Tools Technol. Transf. 11(1): 1-11 (2009) - [c44]Antti Valmari:
Bisimilarity Minimization in O(m logn) Time. Petri Nets 2009: 123-142 - [c43]Jaco Geldenhuys, Henri Hansen
, Antti Valmari:
Exploring the Scope for Partial Order Reduction. ATVA 2009: 39-53 - 2008
- [c42]Antti Jääskeläinen, Antti Kervinen, Mika Katara, Antti Valmari, Heikki Virtanen:
Synthesizing Test Models from Test Cases. Haifa Verification Conference 2008: 179-193 - [c41]Antti Valmari, Petri Lehtinen:
Efficient Minimization of DFAs with Partial Transition. STACS 2008: 645-656 - [i1]Antti Valmari, Petri Lehtinen:
Efficient Minimization of DFAs with Partial Transition Functions. CoRR abs/0802.2826 (2008) - 2006
- [j10]Lars Michael Kristensen, Karsten Schmidt, Antti Valmari:
Question-guided stubborn set methods for state properties. Formal Methods Syst. Des. 29(3): 215-251 (2006) - [j9]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): 180-194 (2006) - [c40]Henri Hansen, Antti Valmari:
Operational Determinism and Fast Algorithms. CONCUR 2006: 188-202 - [e1]Antti Valmari:
Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March 30 - April 1, 2006, Proceedings. Lecture Notes in Computer Science 3925, Springer 2006, ISBN 3-540-33102-6 [contents] - 2005
- [j8]Jaco Geldenhuys, Antti Valmari:
More efficient on-the-fly LTL verification with Tarjan's algorithm. Theor. Comput. Sci. 345(1): 60-82 (2005) - [c39]Timo Kellomäki
, Antti Valmari:
A Method for Analysing the Performance of Certain Testing Techniques for Concurrent Systems. ACSD 2005: 154-163 - 2004
- [c38]Heikki Virtanen, Henri Hansen, Antti Valmari, Juha Nieminen, Timo Erkkilä:
Tampere Verification Tool. TACAS 2004: 153-157 - [c37]Jaco Geldenhuys, Antti Valmari:
Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient. TACAS 2004: 205-219 - 2003
- [c36]Henri Hansen
, Heikki Virtanen, Antti Valmari:
Merging State-Based and Action-Based Verification. ACSD 2003: 150-156 - [c35]Jaco Geldenhuys, Antti Valmari:
A Nearly Memory-Optimal Data Structure for Sets and Mappings. SPIN 2003: 136-150 - [c34]Antero Kangas, Antti Valmari:
Verification with the Undefined: A New Look. FMICS 2003: 124-139 - 2002
- [c33]Antti Valmari, Antti Kervinen:
Alphabet-Based Synchronisation is Exponentially Cheaper. CONCUR 2002: 161-176 - [c32]Henri Hansen
, Wojciech Penczek
, Antti Valmari:
Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties. FMICS 2002: 178-193 - [c31]Antti Valmari, Heikki Virtanen, Antti Puhakka:
Context-Sensitive Visibility. FMICS 2002: 194-210 - 2001
- [j7]Doron A. Peled, Antti Valmari, Ilkka Kokkarinen:
Relaxed Visibility Enhances Partial Order Reduction. Formal Methods Syst. Des. 19(3): 275-289 (2001) - [c30]Antti Puhakka, Antti Valmari:
Liveness and Fairness in Process-Algebraic Verification. CONCUR 2001: 202-217 - [c29]Jaco Geldenhuys, Antti Valmari:
Techniques for Smaller Intermediary BDDs. CONCUR 2001: 233-247 - 2000
- [c28]Lars Michael Kristensen, Antti Valmari:
Improved Question-Guided Stubborn Set Methods for State Properties. ICATPN 2000: 282-302 - [c27]Antti Niemistö, Olli Yli-Harja, Antti Valmari, Pertti Koivisto, Ilya Shmulevich:
Reduction factors in finite automata with application to nonlinear filters. EUSIPCO 2000: 1-4 - [c26]Antti Valmari:
Composition and Abstraction. MOVEP 2000: 58-98 - [c25]Juhana Helovuo, Antti Valmari:
Checking for CFFD-Preorder with Tester Processes. TACAS 2000: 283-298
1990 – 1999
- 1999
- [c24]Antti Puhakka, Antti Valmari:
Weakest-Congruence Results for Livelock-Preserving Equivalences. CONCUR 1999: 510-524 - 1998
- [c23]Antti Valmari, Ilkka Kokkarinen:
Unbounded Verification Results by Finite-State Compositional Techniques: 10any States and Beyond. ACSD 1998: 75-85 - [c22]Lars Michael Kristensen, Antti Valmari:
Finding Stubborn Sets of Coloured Petri Nets Without Unfolding. ICATPN 1998: 104-123 - 1997
- [j6]Jaana Eloranta, Martti Tienari, Antti Valmari:
Essential Transitions to Bisimulation Equivalences. Theor. Comput. Sci. 179(1-2): 397-419 (1997) - [c21]Ilkka Kokkarinen, Doron A. Peled, Antti Valmari:
Relaxed Visibility Enhances Partial Order Reduction. CAV 1997: 328-339 - 1996
- [c20]Antti Valmari:
The State Explosion Problem. Petri Nets 1996: 429-528 - [c19]Antti Valmari:
Compositionality in State Space Verification Methods. Application and Theory of Petri Nets 1996: 29-56 - [c18]Antti Valmari:
Stubborn set methods for process algebras. Partial Order Methods in Verification 1996: 213-231 - [c17]Antti Valmari, Manu Setälä:
Visual Verification of Safety and Liveness. FME 1996: 228-247 - [c16]Konsta Karsisto, Antti Valmari:
Verification-Driven Development of a Collision-Avoidance Protocol for the Ethernet. FTRTFT 1996: 228-245 - [c15]Antti Valmari, Konsta Karsisto, Manu Setälä:
Visualisation of Reduced Abstracted Behaviour as a Design Tool. PDP 1996: 187-195 - 1995
- [j5]Antti Valmari, Martti Tienari:
Compositional Failure-based Semantics Models for Basic LOTOS. Formal Aspects Comput. 7(4): 440-468 (1995) - [j4]Antti Valmari:
The Weakest Deadlock-Preserving Congruence. Inf. Process. Lett. 53(6): 341-346 (1995) - [c14]Antti Valmari:
Failure-based Equivalences Are Faster Than Many Believe. STRICT 1995: 326-340 - 1994
- [c13]Antti Valmari:
Compositional Analysis with Place-Bordered Subnets. Application and Theory of Petri Nets 1994: 531-547 - 1993
- [c12]Antti Valmari:
On-the-Fly Verification with Stubborn Sets. CAV 1993: 397-408 - [c11]Antti Valmari, Jukka Kemppainen, Matthew Clegg, Mikko Levanto:
Putting Advanced Reachability Analysis Techniques Together: the "ARA" Tool. FME 1993: 597-616 - 1992
- [j3]Antti Valmari:
A Stubborn Attack on State Explosion. Formal Methods Syst. Des. 1(4): 297-322 (1992) - [c10]Roope Kaivola, Antti Valmari:
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic. CONCUR 1992: 207-221 - 1991
- [c9]Antti Valmari:
Compositional State Space Generation. Applications and Theory of Petri Nets 1991: 427-457 - [c8]Roope Kaivola, Antti Valmari:
Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models. CONCUR 1991: 361-375 - [c7]Antti Valmari, Matthew Clegg:
Reduced Labelled Transition Systems Save Verification Effort. CONCUR 1991: 526-540 - [c6]Antti Valmari, Martti Tienari:
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm. PSTV 1991: 3-18 - 1990
- [c5]Antti Valmari:
A Stubborn Attack On State Explosion. CAV 1990: 156-165 - [c4]Antti Valmari:
A Stubborn Attack on State Explosion. CAV (DIMACS/AMS volume) 1990: 25-42
1980 – 1989
- 1989
- [c3]Antti Valmari:
Stubborn sets for reduced state space generation. Applications and Theory of Petri Nets 1989: 491-515 - [c2]Antti Valmari:
Eliminating Redundant Interleavings During Concurrent Program Verification. PARLE (2) 1989: 89-103 - [c1]Antti Valmari:
State Space Generation with Induction. SCAI 1989: 99-115 - 1988
- [j2]Antti Valmari:
PC-Rimst - a tool for validating concurrent program designs. Microprocess. Microprogramming 24(1-5): 809-818 (1988) - 1987
- [j1]Antti Valmari:
Reachability analysis -based validation of embedded systems. Microprocess. Microprogramming 21(1-5): 393-403 (1987)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint