Antti Valmari

According to our database1, Antti Valmari
  • authored at least 85 papers between 1989 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Stubborn Set Intuition Explained.
T. Petri Nets and Other Models of Concurrency, 2017

Stop It, and Be Stubborn!.
ACM Trans. Embedded Comput. Syst., 2017

Stubborn Sets with Frozen Actions.
Proceedings of the Reachability Problems - 11th International Workshop, 2017

More Stubborn Set Methods for Process Algebras.
Proceedings of the Concurrency, Security, and Puzzles, 2017

2016
Constructing Minimal Coverability Sets.
Fundam. Inform., 2016

Preface.
Fundam. Inform., 2016

Fair Testing and Stubborn Sets.
Proceedings of the Model Checking Software - 23rd International Symposium, 2016

Safety Property-Driven Stubborn Sets.
Proceedings of the Reachability Problems - 10th International Workshop, 2016

Stubborn Set Intuition Explained.
Proceedings of the International Workshop on Petri Nets and Software Engineering 2016, 2016

The Congruences below Fair Testing with Initial Stability.
Proceedings of the 16th International Conference on Application of Concurrency to System Design, 2016

2015
A State Space Tool for Models Expressed In C++ (tool paper).
CoRR, 2015

Stop It, and Be Stubborn!
CoRR, 2015

On constructibility and unconstructibility of LTS operators from other LTS operators.
Acta Inf., 2015

A state space tool for concurrent system models expressed in C++.
Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST'15), 2015

Priority queue classes with priority update.
Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST'15), 2015

Stop It, and Be Stubborn!
Proceedings of the 15th International Conference on Application of Concurrency to System Design, 2015

2014
Old and New Algorithms for Minimal Coverability Sets.
Fundam. Inform., 2014

Character Strings and Gödel's Incompleteness Proof.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Asymptotic Proportion of Hard Instances of the Halting Problem.
Acta Cybern., 2014

2013
External Behaviour of Systems of State Machines with Variables.
Trans. Petri Nets and Other Models of Concurrency, 2013

Good to Know about the Efficiency of State Space Methods.
Nord. J. Comput., 2013

All Linear-Time Congruences for Familiar Operators.
Logical Methods in Computer Science, 2013

The Asymptotic Behaviour of the Proportion of Hard Instances of the Halting Problem (Extended Version).
CoRR, 2013

Constructing Minimal Coverability Sets.
Proceedings of the Reachability Problems - 7th International Workshop, 2013

2012
Fast brief practical DFA minimization.
Inf. Process. Lett., 2012

All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Old and New Algorithms for Minimal Coverability Sets.
Proceedings of the Application and Theory of Petri Nets - 33rd International Conference, 2012

All Linear-Time Congruences for Finite LTSs and Familiar Operators.
Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

2011
Can Stubborn Sets Be Optimal?
Fundam. Inform., 2011

2010
Simple Bisimilarity Minimization in O(m log n) Time.
Fundam. Inform., 2010

Simple O(m logn) Time Markov Chain Lumping.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Can Stubborn Sets Be Optimal?
Proceedings of the Applications and Theory of Petri Nets, 2010

2009
Software model checking is a rich research field.
STTT, 2009

Exploring the Scope for Partial Order Reduction.
Proceedings of the Automated Technology for Verification and Analysis, 2009

Bisimilarity Minimization in O(m logn) Time.
Proceedings of the Applications and Theory of Petri Nets, 2009

2008
Efficient Minimization of DFAs with Partial Transition Functions
CoRR, 2008

Efficient Minimization of DFAs with Partial Transition.
Proceedings of the STACS 2008, 2008

Synthesizing Test Models from Test Cases.
Proceedings of the Hardware and Software: Verification and Testing, 2008

2006
What the small Rubik's cube taught me about data structures, information theory, and randomisation.
STTT, 2006

Question-guided stubborn set methods for state properties.
Formal Methods in System Design, 2006

Operational Determinism and Fast Algorithms.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
More efficient on-the-fly LTL verification with Tarjan's algorithm.
Theor. Comput. Sci., 2005

A Method for Analysing the Performance of Certain Testing Techniques for Concurrent Systems.
Proceedings of the Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), 2005

2004
Tampere Verification Tool.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

2003
Verification with the Undefined: A New Look.
Electr. Notes Theor. Comput. Sci., 2003

A Nearly Memory-Optimal Data Structure for Sets and Mappings.
Proceedings of the Model Checking Software, 2003

Merging State-Based and Action-Based Verification.
Proceedings of the 3rd International Conference on Application of Concurrency to System Design (ACSD 2003), 2003

2002
Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties.
Electr. Notes Theor. Comput. Sci., 2002

Context-Sensitive Visibility.
Electr. Notes Theor. Comput. Sci., 2002

Alphabet-Based Synchronisation is Exponentially Cheaper.
Proceedings of the CONCUR 2002, 2002

2001
Relaxed Visibility Enhances Partial Order Reduction.
Formal Methods in System Design, 2001

Liveness and Fairness in Process-Algebraic Verification.
Proceedings of the CONCUR 2001, 2001

Techniques for Smaller Intermediary BDDs.
Proceedings of the CONCUR 2001, 2001

2000
Checking for CFFD-Preorder with Tester Processes.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

Composition and Abstraction.
Proceedings of the Modeling and Verification of Parallel Processes, 4th Summer School, 2000

Reduction factors in finite automata with application to nonlinear filters.
Proceedings of the 10th European Signal Processing Conference, 2000

Improved Question-Guided Stubborn Set Methods for State Properties.
ICATPN, 2000

1999
Weakest-Congruence Results for Livelock-Preserving Equivalences.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Finding Stubborn Sets of Coloured Petri Nets Without Unfolding.
Proceedings of the Application and Theory of Petri Nets 1998, 1998

Unbounded Verification Results by Finite-State Compositional Techniques: 10any States and Beyond.
Proceedings of the 1st International Conference on Application of Concurrency to System Design (ACSD '98), 1998

1997
Essential Transitions to Bisimulation Equivalences.
Theor. Comput. Sci., 1997

Relaxed Visibility Enhances Partial Order Reduction.
Proceedings of the Computer Aided Verification, 9th International Conference, 1997

1996
Visualisation of Reduced Abstracted Behaviour as a Design Tool.
Proceedings of the 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96), 1996

Verification-Driven Development of a Collision-Avoidance Protocol for the Ethernet.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

Visual Verification of Safety and Liveness.
Proceedings of the FME '96: Industrial Benefit and Advances in Formal Methods, 1996

Stubborn set methods for process algebras.
Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

Compositionality in State Space Verification Methods.
Proceedings of the Application and Theory of Petri Nets 1996, 1996

The State Explosion Problem.
Proceedings of the Lectures on Petri Nets I: Basic Models, 1996

1995
The Weakest Deadlock-Preserving Congruence.
Inf. Process. Lett., 1995

Compositional Failure-based Semantics Models for Basic LOTOS.
Formal Asp. Comput., 1995

1994
Compositional Analysis with Place-Bordered Subnets.
Proceedings of the Application and Theory of Petri Nets 1994, 1994

1993
Putting Advanced Reachability Analysis Techniques Together: the "ARA" Tool.
Proceedings of the FME '93: Industrial-Strength Formal Methods, 1993

On-the-Fly Verification with Stubborn Sets.
Proceedings of the Computer Aided Verification, 5th International Conference, 1993

1992
A Stubborn Attack on State Explosion.
Formal Methods in System Design, 1992

The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic.
Proceedings of the CONCUR '92, 1992

1991
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm.
Proceedings of the Protocol Specification, 1991

Reduced Labelled Transition Systems Save Verification Effort.
Proceedings of the CONCUR '91, 1991

Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models.
Proceedings of the CONCUR '91, 1991

Compositional State Space Generation.
Proceedings of the Advances in Petri Nets 1993, 1991

1990
A Stubborn Attack on State Explosion.
Proceedings of the Computer-Aided Verification, 1990

A Stubborn Attack On State Explosion.
Proceedings of the Computer Aided Verification, 2nd International Workshop, 1990

1989
State Space Generation with Induction.
SCAI, 1989

Eliminating Redundant Interleavings During Concurrent Program Verification.
Proceedings of the PARLE '89: Parallel Architectures and Languages Europe, 1989

Stubborn sets for reduced state space generation.
Proceedings of the Advances in Petri Nets 1990 [10th International Conference on Applications and Theory of Petri Nets, 1989


  Loading...