Antti Valmari

From MaRDI portal
Person:216118

Available identifiers

zbMath Open valmari.anttiDBLP97/3306WikidataQ11852267 ScholiaQ11852267MaRDI QIDQ216118

List of research outcomes





PublicationDate of PublicationType
A completeness proof for a regular predicate logic with undefined truth value2023-05-31Paper
Finding Stubborn Sets of Coloured Petri Nets without Unfolding2022-12-09Paper
https://portal.mardi4nfdi.de/entity/Q51556692021-10-08Paper
A simple character string proof of the ``true but unprovable version of Gödel's first incompleteness theorem2021-06-22Paper
Stubborn set intuition explained2021-06-14Paper
Stubborn Sets, Frozen Actions, and Fair Testing2021-05-21Paper
The inconsistent labelling problem of stutter-preserving partial-order reduction2020-09-23Paper
All congruences below stability-preserving fair testing or CFFD2020-05-26Paper
Compositionality in state space verification methods2019-05-02Paper
Safety property-driven stubborn sets2018-03-26Paper
More stubborn set methods for process algebras2018-03-26Paper
Stubborn sets with frozen actions2017-12-20Paper
Constructing Minimal Coverability Sets2017-03-16Paper
Fair testing and stubborn sets2016-06-22Paper
On constructibility and unconstructibility of LTS operators from other LTS operators2015-04-16Paper
Asymptotic proportion of hard instances of the halting problem2015-01-09Paper
Constructing minimal coverability sets2014-07-07Paper
Old and new algorithms for minimal coverability sets2014-05-12Paper
Good to know about the efficiency of state space methods2013-12-13Paper
All linear-time congruences for familiar operators2013-11-28Paper
External behaviour of systems of state machines with variables2013-05-31Paper
Does the Shannon bound really apply to all data structures?2013-04-30Paper
Efficient minimization of DFAs with partial transition2013-03-19Paper
All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs2012-09-25Paper
Old and new algorithms for minimal coverability sets2012-09-04Paper
Fast brief practical DFA minimization2012-07-18Paper
https://portal.mardi4nfdi.de/entity/Q32257222012-03-22Paper
Simple bisimilarity minimization in \(O(m \log n)\) time2011-03-28Paper
Can stubborn sets be optimal?2010-06-22Paper
Simple \(O(m \log n)\) time Markov chain lumping2010-04-27Paper
Exploring the scope for partial order reduction2009-12-01Paper
Bisimilarity Minimization in O(m logn) Time2009-06-30Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-09-28Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-09-28Paper
Operational Determinism and Fast Algorithms2007-09-04Paper
Question-guided stubborn set methods for state properties2007-01-24Paper
A modern mathematical theory of co-operating state machines2006-08-15Paper
More efficient on-the-fly LTL verification with Tarjan's algorithm2005-12-06Paper
https://portal.mardi4nfdi.de/entity/Q44263772003-09-16Paper
https://portal.mardi4nfdi.de/entity/Q44844862003-06-12Paper
https://portal.mardi4nfdi.de/entity/Q47918362003-02-03Paper
https://portal.mardi4nfdi.de/entity/Q47918382003-02-03Paper
Relaxed visibility enhances partial order reduction2002-10-23Paper
https://portal.mardi4nfdi.de/entity/Q27665682002-06-17Paper
https://portal.mardi4nfdi.de/entity/Q45320762002-05-28Paper
https://portal.mardi4nfdi.de/entity/Q45189002001-05-20Paper
https://portal.mardi4nfdi.de/entity/Q42700781999-12-20Paper
Essential transitions to bisimulation equivalences1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q43536361997-09-10Paper
The weakest deadlock-preserving congruence1997-02-28Paper
Compositional failure-based semantic models for basic LOTOS1996-02-01Paper
A stubborn attack on state explosion1993-09-30Paper
https://portal.mardi4nfdi.de/entity/Q40373801993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40370871993-05-18Paper

Research outcomes over time

This page was built for person: Antti Valmari