Antti Valmari

Available identifiers

zbMath Open valmari.anttiWikidataQ11852267 ScholiaQ11852267MaRDI QIDQ216118

List of research outcomes

Publication	Date of Publication	Type
A completeness proof for a regular predicate logic with undefined truth value	2023-05-31	Paper
Finding Stubborn Sets of Coloured Petri Nets without Unfolding	2022-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q5155669	2021-10-08	Paper
https://portal.mardi4nfdi.de/entity/Q4994956	2021-06-22	Paper
Stubborn Set Intuition Explained	2021-06-14	Paper
Stubborn Sets, Frozen Actions, and Fair Testing	2021-05-21	Paper
The inconsistent labelling problem of stutter-preserving partial-order reduction	2020-09-23	Paper
All congruences below stability-preserving fair testing or CFFD	2020-05-26	Paper
Compositionality in state space verification methods	2019-05-02	Paper
Safety property-driven stubborn sets	2018-03-26	Paper
More stubborn set methods for process algebras	2018-03-26	Paper
Stubborn sets with frozen actions	2017-12-20	Paper
Constructing Minimal Coverability Sets	2017-03-16	Paper
Fair Testing and Stubborn Sets	2016-06-22	Paper
On constructibility and unconstructibility of LTS operators from other LTS operators	2015-04-16	Paper
Asymptotic Proportion of Hard Instances of the Halting Problem	2015-01-09	Paper
Constructing Minimal Coverability Sets	2014-07-07	Paper
Old and New Algorithms for Minimal Coverability Sets	2014-05-12	Paper
https://portal.mardi4nfdi.de/entity/Q2866408	2013-12-13	Paper
All Linear-Time Congruences for Familiar Operators	2013-11-28	Paper
External Behaviour of Systems of State Machines with Variables	2013-05-31	Paper
Does the Shannon bound really apply to all data structures?	2013-04-30	Paper
Efficient Minimization of DFAs with Partial Transition Functions	2013-03-19	Paper
All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs	2012-09-25	Paper
Old and New Algorithms for Minimal Coverability Sets	2012-09-04	Paper
Fast brief practical DFA minimization	2012-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q3225722	2012-03-22	Paper
Simple Bisimilarity Minimization in O(m log n) Time	2011-03-28	Paper
Can Stubborn Sets Be Optimal?	2010-06-22	Paper
Simple O(m logn) Time Markov Chain Lumping	2010-04-27	Paper
Exploring the Scope for Partial Order Reduction	2009-12-01	Paper
Bisimilarity Minimization in O(m logn) Time	2009-06-30	Paper
Tools and Algorithms for the Construction and Analysis of Systems	2007-09-28	Paper
Tools and Algorithms for the Construction and Analysis of Systems	2007-09-28	Paper
Operational Determinism and Fast Algorithms	2007-09-04	Paper
Question-guided stubborn set methods for state properties	2007-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q5482937	2006-08-15	Paper
More efficient on-the-fly LTL verification with Tarjan's algorithm	2005-12-06	Paper
https://portal.mardi4nfdi.de/entity/Q4426377	2003-09-16	Paper
https://portal.mardi4nfdi.de/entity/Q4484486	2003-06-12	Paper
https://portal.mardi4nfdi.de/entity/Q4791836	2003-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q4791838	2003-02-03	Paper
Relaxed visibility enhances partial order reduction	2002-10-23	Paper
https://portal.mardi4nfdi.de/entity/Q2766568	2002-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4532076	2002-05-28	Paper
https://portal.mardi4nfdi.de/entity/Q4518900	2001-05-20	Paper
https://portal.mardi4nfdi.de/entity/Q4270078	1999-12-20	Paper
Essential transitions to bisimulation equivalences	1998-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q4353636	1997-09-10	Paper
The weakest deadlock-preserving congruence	1997-02-28	Paper
Compositional failure-based semantic models for basic LOTOS	1996-02-01	Paper
A stubborn attack on state explosion	1993-09-30	Paper
https://portal.mardi4nfdi.de/entity/Q4037087	1993-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4037380	1993-05-18	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Antti Valmari