Antti Valmari
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Antti Valmari has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Henri Hansen
Tampere University of Technology
2 shared publications - Artturi Piipponen1 shared publication
- Jaco Geldenhuys
Tampere University of Technology, Institute of Software Systems, PO Box 553, FI-33101 Tampere, Finland
1 shared publication - Karsten Schmidt
Humboldt-Universität zu Berlin
1 shared publication - Lars Michael Kristensen
University of Aarhus
1 shared publication - Petri Lehtinen
Tampere University of Technology
1 shared publication
Latest Publications
- 30 August 2018
- Published by Springer Nature
- p. 115-130
Progress Checking for Dummies
- 25 August 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 160-175
Stubborn Sets with Frozen Actions
- 25 August 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 160-175
Stubborn Sets with Frozen Actions
- 18 December 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 246-271
More Stubborn Set Methods for Process Algebras
- 18 December 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 246-271
More Stubborn Set Methods for Process Algebras
- 13 September 2016
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 146 (1)
Preface
- 4 March 2016
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 143 (3-4) , 393-414
Constructing Minimal Coverability Sets
This publication addresses two bottlenecks in the construction of minimal coverability sets of Petri nets: the detection of situations where the marking of a place can be converted to ω , and the manipulation of the set A of maximal ω -markings that
- 4 March 2016
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 143 (3-4) , 393-414
Constructing Minimal Coverability Sets
This publication addresses two bottlenecks in the construction of minimal coverability sets of Petri nets: the detection of situations where the marking of a place can be converted to ω , and the manipulation of the set A of maximal ω -markings that
- Open Access
A State Space Tool for Models Expressed In C++ (tool paper)
This publication introduces A State Space Exploration Tool that is based on representing the model under verification as a piece of C++ code that obeys certain conventions. Its name is ASSET. Model checking takes place by compiling the model and the tool together, and executing the result. This approach facilitates very fast execution of the transitions of the model. On the other hand, the use of stubborn sets and symmetries requires that either the modeller or a preprocessor tool analyses the model at a syntactic level and expresses stubborn set obligation rules and the symmetry mapping as suitable C++ functions. The tool supports the detection of illegal deadlocks, safety errors, and may progress errors. It also partially supports the detection of must progress errors.
Open AccessA State Space Tool for Models Expressed In C++ (tool paper)
This publication introduces A State Space Exploration Tool that is based on representing the model under verification as a piece of C++ code that obeys certain conventions. Its name is ASSET. Model checking takes place by compiling the model and the tool together, and executing the result. This approach facilitates very fast execution of the transitions of the model. On the other hand, the use of stubborn sets and symmetries requires that either the modeller or a preprocessor tool analyses the model at a syntactic level and expresses stubborn set obligation rules and the symmetry mapping as suitable C++ functions. The tool supports the detection of illegal deadlocks, safety errors, and may progress errors. It also partially supports the detection of must progress errors.
- 3 February 2015
- Published by Springer Nature in Acta Informatica
- Vol. 52 (2) , 207-234
On constructibility and unconstructibility of LTS operators from other LTS operators
- 3 February 2015
- Published by Springer Nature in Acta Informatica
- Vol. 52 (2) , 207-234
On constructibility and unconstructibility of LTS operators from other LTS operators
- 1 April 2014
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 131 (1) , 1-25
Old and New Algorithms for Minimal Coverability Sets
Many algorithms for computing minimal coverability sets for Petri nets prune futures. That is, if a newmarking strictly covers an old one, then not just the old marking but also some subset of its successor markings is discarded from search. In this publication, a simpler algorithm that lacks future pruning is presented and proven correct. Its performance is compared with future pruning. It is demonstrated, using examples, that neither approach is systematically better than the other. However, the simple algorithm has some attractive features. It never needs to re-construct pruned parts of the minimal coverability set. It automatically gives most of the advantage of future pruning, if the minimal coverability set is constructed in depth-first or most tokens first order, and if so-called history merging is applied. Some implementation aspects of minimal coverability set construction are also discussed. Some measurements are given to demonstrate the effect of construction order and other implementation aspects.
- 1 April 2014
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 131 (1) , 1-25
Old and New Algorithms for Minimal Coverability Sets
Many algorithms for computing minimal coverability sets for Petri nets prune futures. That is, if a newmarking strictly covers an old one, then not just the old marking but also some subset of its successor markings is discarded from search. In this publication, a simpler algorithm that lacks future pruning is presented and proven correct. Its performance is compared with future pruning. It is demonstrated, using examples, that neither approach is systematically better than the other. However, the simple algorithm has some attractive features. It never needs to re-construct pruned parts of the minimal coverability set. It automatically gives most of the advantage of future pruning, if the minimal coverability set is constructed in depth-first or most tokens first order, and if so-called history merging is applied. Some implementation aspects of minimal coverability set construction are also discussed. Some measurements are given to demonstrate the effect of construction order and other implementation aspects.
- Open Access
- 16 February 2013
- Published by Estonian Academy Publishers in Proceedings of the Estonian Academy of Sciences
- Vol. 62 (1) , 47-58
Does the Shannon bound really apply to all data structures?; pp. 47–58
Shannon’s information-theoretic lower bound has been developed for uniquely decodable systems of bit strings, while ordinary data structures often consist of many separate blocks of memory. One might expect that adapting the bound to data structures is trivial, but we demonstrate that this is not the case. Kraft’s inequality is at the heart of information-theoretic lower bound proofs. We present a tiny distributed data structure where Kraft’s inequality fails, or it is at least very difficult to give any other satisfactory explanation. Then we formalize the concept of data structure with the notion of “representation scheme†that is general enough to model the example system. We re-establish the information-theoretic lower bound by proving that Kraft’s inequality applies to a subset of representation schemes that contains at least one memory-optimal scheme for each set of objects. Unlike in classical information theory, a representation scheme may be memory-optimal even if some object has more than one representation. However, this only happens if some representation has probability zero.
- 16 February 2013
- Published by Estonian Academy Publishers in Proceedings of the Estonian Academy of Sciences
- Vol. 62 (1) , 47-58
Open AccessDoes the Shannon bound really apply to all data structures?; pp. 47–58
Shannon’s information-theoretic lower bound has been developed for uniquely decodable systems of bit strings, while ordinary data structures often consist of many separate blocks of memory. One might expect that adapting the bound to data structures is trivial, but we demonstrate that this is not the case. Kraft’s inequality is at the heart of information-theoretic lower bound proofs. We present a tiny distributed data structure where Kraft’s inequality fails, or it is at least very difficult to give any other satisfactory explanation. Then we formalize the concept of data structure with the notion of “representation scheme†that is general enough to model the example system. We re-establish the information-theoretic lower bound by proving that Kraft’s inequality applies to a subset of representation schemes that contains at least one memory-optimal scheme for each set of objects. Unlike in classical information theory, a representation scheme may be memory-optimal even if some object has more than one representation. However, this only happens if some representation has probability zero.