Antti Valmari

Proceedings of the 14th International Conference on Computer Supported Education, 2022

2021

A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction.

[BibT_eX]

[DOI]

Thomas Neele

Tim A. C. Willemse

Log. Methods Comput. Sci., 2021

Stubborn Sets, Frozen Actions, and Fair Testing.

[BibT_eX]

[DOI]

Walter Vogler

Fundam. Informaticae, 2021

A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value.

[BibT_eX]

[DOI]

Lauri Hella

CoRR, 2021

Automated Checking of Flexible Mathematical Reasoning in the Case of Systems of (In)Equations and the Absolute Value Operator.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Computer Supported Education, 2021

2020

All congruences below stability-preserving fair testing or CFFD.

[BibT_eX]

[DOI]

Acta Informatica, 2020

The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction.

[BibT_eX]

[DOI]

Thomas Neele

Tim A. C. Willemse

Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019

Arithmetic, Logic, Syntax and MathCheck.

[BibT_eX]

[DOI]

Johanna Rantala

Proceedings of the 11th International Conference on Computer Supported Education, 2019

2018

Fair testing and stubborn sets.

[BibT_eX]

[DOI]

Walter Vogler

Int. J. Softw. Tools Technol. Transf., 2018

Modelling Without a Modelling Language.

[BibT_eX]

[DOI]

Vesa Lappalainen

Proceedings of the Model Checking Software - 25th International Symposium, 2018

Progress Checking for Dummies.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Industrial Critical Systems, 2018

Algorithms and Logic as Programming Primers.

[BibT_eX]

[DOI]

Pia Niemelä

Simo Ali-Löytty

Proceedings of the Computer Supported Education - 10th International Conference, 2018

Elementary Math to Close the Digital Skills Gap.

[BibT_eX]

[DOI]

Pia Niemelä

Proceedings of the 10th International Conference on Computer Supported Education, 2018

2017

Stubborn Set Intuition Explained.

[BibT_eX]

[DOI]

Trans. Petri Nets Other Model. Concurr., 2017

Stop It, and Be Stubborn!

[BibT_eX]

[DOI]

ACM Trans. Embed. Comput. Syst., 2017

Stubborn Sets with Frozen Actions.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 11th International Workshop, 2017

More Stubborn Set Methods for Process Algebras.

[BibT_eX]

[DOI]

Proceedings of the Concurrency, Security, and Puzzles, 2017

2016

Constructing Minimal Coverability Sets.

[BibT_eX]

[DOI]

Artturi Piipponen

Fundam. Informaticae, 2016

Preface.

[BibT_eX]

[DOI]

Raymond R. Devillers

Wojciech Penczek

Fundam. Informaticae, 2016

Safety Property-Driven Stubborn Sets.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 10th International Workshop, 2016

The Congruences below Fair Testing with Initial Stability.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

CoRR, 2015

On constructibility and unconstructibility of LTS operators from other LTS operators.

[BibT_eX]

[DOI]

Acta Informatica, 2015

A state space tool for concurrent system models expressed in C++.

[BibT_eX]

[DOI]

Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST'15), 2015

Priority queue classes with priority update.

[BibT_eX]

[DOI]

Matti Rintala

Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST'15), 2015

2014

Old and New Algorithms for Minimal Coverability Sets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Character Strings and Gödel's Incompleteness Proof.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Asymptotic Proportion of Hard Instances of the Halting Problem.

[BibT_eX]

[DOI]

Acta Cybern., 2014

2013

External Behaviour of Systems of State Machines with Variables.

[BibT_eX]

[DOI]

Trans. Petri Nets Other Model. Concurr., 2013

Good to Know about the Efficiency of State Space Methods.

[BibT_eX]

Mikko Tiusanen

Nord. J. Comput., 2013

All Linear-Time Congruences for Familiar Operators.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

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

[BibT_eX]

[DOI]

CoRR, 2013

2012

Fast brief practical DFA minimization.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

All Linear-Time Congruences for Finite LTSs and Familiar Operators.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

2011

Can Stubborn Sets Be Optimal?

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

2010

Simple Bisimilarity Minimization in O(m log n) Time.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Simple O(m logn) Time Markov Chain Lumping.

[BibT_eX]

[DOI]

Giuliana Franceschinis

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

2009

Software model checking is a rich research field.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2009

Exploring the Scope for Partial Order Reduction.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2009

Bisimilarity Minimization in O(m logn) Time.

[BibT_eX]

[DOI]

Proceedings of the Applications and Theory of Petri Nets, 2009

2008

Efficient Minimization of DFAs with Partial Transition Functions

[BibT_eX]

[DOI]

Petri Lehtinen

CoRR, 2008

Efficient Minimization of DFAs with Partial Transition.

[BibT_eX]

[DOI]

Petri Lehtinen

Proceedings of the STACS 2008, 2008

Synthesizing Test Models from Test Cases.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2006

Question-guided stubborn set methods for state properties.

[BibT_eX]

[DOI]

Lars Michael Kristensen

Karsten Schmidt

Formal Methods Syst. Des., 2006

Operational Determinism and Fast Algorithms.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005

More efficient on-the-fly LTL verification with Tarjan's algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A Method for Analysing the Performance of Certain Testing Techniques for Concurrent Systems.

[BibT_eX]

[DOI]

Timo Kellomäki

Proceedings of the Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), 2005

2004

Tampere Verification Tool.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

2003

Verification with the Undefined: A New Look.

[BibT_eX]

[DOI]

Antero Kangas

Proceedings of the Eighth International Workshop on Formal Methods for Industrial Critical Systems, 2003

A Nearly Memory-Optimal Data Structure for Sets and Mappings.

[BibT_eX]

[DOI]

Proceedings of the Model Checking Software, 2003

Merging State-Based and Action-Based Verification.

[BibT_eX]

[DOI]

Heikki Virtanen

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.

[BibT_eX]

[DOI]

Wojciech Penczek

Proceedings of the 7th International ERCIM Workshop in Formal Methods for Industrial Critical Systems, 2002

Context-Sensitive Visibility.

[BibT_eX]

[DOI]

Heikki Virtanen

Antti Puhakka

Proceedings of the 7th International ERCIM Workshop in Formal Methods for Industrial Critical Systems, 2002

Alphabet-Based Synchronisation is Exponentially Cheaper.

[BibT_eX]

[DOI]

Antti Kervinen

Proceedings of the CONCUR 2002, 2002

2001

Relaxed Visibility Enhances Partial Order Reduction.

[BibT_eX]

[DOI]

Doron A. Peled

Ilkka Kokkarinen

Formal Methods Syst. Des., 2001

Liveness and Fairness in Process-Algebraic Verification.

[BibT_eX]

[DOI]

Antti Puhakka

Proceedings of the CONCUR 2001, 2001

Techniques for Smaller Intermediary BDDs.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2001, 2001

2000

Checking for CFFD-Preorder with Tester Processes.

[BibT_eX]

[DOI]

Juhana Helovuo

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

Composition and Abstraction.

[BibT_eX]

[DOI]

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

Reduction factors in finite automata with application to nonlinear filters.

[BibT_eX]

[DOI]

Proceedings of the 10th European Signal Processing Conference, 2000

Improved Question-Guided Stubborn Set Methods for State Properties.

[BibT_eX]

[DOI]

Lars Michael Kristensen

Proceedings of the Application and Theory of Petri Nets 2000, 2000

1999

Weakest-Congruence Results for Livelock-Preserving Equivalences.

[BibT_eX]

[DOI]

Antti Puhakka

Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998

Finding Stubborn Sets of Coloured Petri Nets Without Unfolding.

[BibT_eX]

[DOI]

Lars Michael Kristensen

Proceedings of the Application and Theory of Petri Nets 1998, 1998

Unbounded Verification Results by Finite-State Compositional Techniques: 10any States and Beyond.

[BibT_eX]

[DOI]

Ilkka Kokkarinen

Proceedings of the 1st International Conference on Application of Concurrency to System Design (ACSD '98), 1998

1997

Essential Transitions to Bisimulation Equivalences.

[BibT_eX]

[DOI]

Jaana Eloranta

Martti Tienari

Theor. Comput. Sci., 1997

1996

Visualisation of Reduced Abstracted Behaviour as a Design Tool.

[BibT_eX]

[DOI]

Konsta Karsisto

Manu Setälä

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.

[BibT_eX]

[DOI]

Konsta Karsisto

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

Visual Verification of Safety and Liveness.

[BibT_eX]

[DOI]

Manu Setälä

Proceedings of the FME '96: Industrial Benefit and Advances in Formal Methods, 1996

Stubborn set methods for process algebras.

[BibT_eX]

[DOI]

Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

Compositionality in State Space Verification Methods.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 1996, 1996

The State Explosion Problem.

[BibT_eX]

[DOI]

Proceedings of the Lectures on Petri Nets I: Basic Models, 1996

1995

The Weakest Deadlock-Preserving Congruence.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Compositional Failure-based Semantics Models for Basic LOTOS.

[BibT_eX]

[DOI]

Martti Tienari

Formal Aspects Comput., 1995

Failure-based Equivalences Are Faster Than Many Believe.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

1994

Compositional Analysis with Place-Bordered Subnets.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 1994, 1994

1993

Putting Advanced Reachability Analysis Techniques Together: the "ARA" Tool.

[BibT_eX]

[DOI]

Proceedings of the FME '93: Industrial-Strength Formal Methods, 1993

On-the-Fly Verification with Stubborn Sets.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 5th International Conference, 1993

1992

A Stubborn Attack on State Explosion.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 1992

The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic.

[BibT_eX]

[DOI]

Roope Kaivola

Proceedings of the CONCUR '92, 1992

1991

An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm.

[BibT_eX]

Martti Tienari

Proceedings of the Protocol Specification, 1991

Reduced Labelled Transition Systems Save Verification Effort.

[BibT_eX]

[DOI]

Matthew Clegg

Proceedings of the CONCUR '91, 1991

Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models.

[BibT_eX]

[DOI]

Roope Kaivola

Proceedings of the CONCUR '91, 1991

Compositional State Space Generation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1993, 1991

1989

State Space Generation with Induction.

[BibT_eX]

Proceedings of the Second Scandinavian Conference on Artificial Intelligence 1989, 1989

Eliminating Redundant Interleavings During Concurrent Program Verification.

[BibT_eX]

[DOI]

Proceedings of the PARLE '89: Parallel Architectures and Languages Europe, 1989

Stubborn sets for reduced state space generation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1990 [10th International Conference on Applications and Theory of Petri Nets, 1989

1988

PC-Rimst - a tool for validating concurrent program designs.

[BibT_eX]

[DOI]

Microprocess. Microprogramming, 1988

1987

Reachability analysis -based validation of embedded systems.

[BibT_eX]

[DOI]