List of Publications of Antti Valmari

1. In English

Many of these can be downloaded without violating copyrights at http://www.cs.tut.fi/ohj/VARG/publications/.

Ten most important for this application: 91, 88, 81, 80, 70, 63, 62, 50, 43, 30

Categories, as required by the Academy of Finland:
A contains all publications marked as a, b, or c.
B contains all publications marked as d and 72, 69, 68, 61, 50, 48, 43, 38, 37, 33, 26, 5.
C contains publications 74, 67, 51.
D contains publication 34.
G contains publication 8.

Categories:
(If several publications have the same number (see below), other than the highest-category instances are shown in parentheses.)
a international strictly refereed journal: 93, 91, 90, 84, 83, 82, 81, 80, 77, 71, 66, 62, 40, 39, 29, 27, 15
b international strictly refereed book (other than conference proceedings): 88, 14, 11
c international strictly refereed conference: 97, 96, 95, 92, (90), 89, 87, 86, 85, (84), (82), (80), 79, 78, (77), 76, 75, 73, 70, 64, 63, (62), 60, 59, 58, 57, 56, 55, 54, 53, 52, 49, 47, 46, 45, 44, 42, 41, (39), 35, 32, 30, 28, 24, 23, 22, 20, 19, 18, 17, 16, (15), (15), (14), (11), 9, 4, 2
d international conference, selection based on short abstracts (≤ 3 pages): 65, 36, 31, 25, 13, 12, 10, 6, 3, 1
e other international: 94, (90), 74, 72, 69, 68, 67, 51, 50, 48, (48), (46), 43, 37, 33, 26, (20)
f domestic: (64), 61, 38, 34, (30), (29), 21, (14), 8, 7, 5

If essentially the same publication has appeared several times, they are mentioned in the same entry. If a publication in a higher category is essentially an extension or improvement of a publication in a lower category, the same number is used.

97c Rintala, M. & Valmari, A.: Priority Queue Classes with Priority Update. Proceedings of SPLST '15, 14th Symposium on Programming Languages and Software Tools, Tampere, Finland, October 9–10, 2015, pp. ??–??.

96c Valmari, A.: A State Space Tool for Concurrent System Models Expressed In C++. Proceedings of SPLST '15, 14th Symposium on Programming Languages and Software Tools, Tampere, Finland, October 9–10, 2015, pp. ??–??. Preliminary version CoRR abs/1504.02597

95c Valmari, A.: Stop It, and Be Stubborn! To appear in Stefan Haar & Roland Meyer (eds.): Proceedings of ACSD 2015, 15th International Conference on Application of Concurrency to System Design, Brussels, Belgium, June 24–26, 2015, IEEE, pp. ??–??. Preliminary version CoRR abs/1504.02587

94e Devillers, R. & Valmari, A. (editors): Application and Theory of Petri Nets and Concurrency — 36th International Conference, PETRI NETS 2015, Brussels, Belgium, June 21–26, 2015, Proceedings. Lecture Notes in Computer Science 9115, Springer 2015

93a Valmari, A.: On Constructibility and Unconstructibility of LTS Operators from Other LTS Operators. Acta Informatica Vol. 52 (2-3) 2015, pp. 207–234.

92c Valmari, A.: A Simple Character String Proof of the “True but Unprovable” Version of Gödel's First Incompleteness Theorem. Zoltán Ésik, Zoltán Fülöp (Eds.) Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014, Electronic Proceedings in Theoretical Computer Science 151, pp. 355–369. Online as arXiv:1402.7253.

91a Valmari, A.: All Linear-Time Congruences for Familiar Operators. Logical Methods in Computer Science Vol. 9(4:11) 2013, pp. 1–34. Online as arXiv:1310.8408.

90a Valmari, A.: Asymptotic Proportion of Hard Instances of the Halting Problem. Acta Cybernetica 21(3), 2014, pp. 307–330. online

90ce Valmari, A.: The Asymptotic Behaviour of the Proportion of Hard Instances of the Halting Problem. (Kiss, Á. ed:) Proceedings of SPLST '13, 13th Symposium on Programming Languages and Software Tools, Szeged, Hungary, August 26–27, 2013, pp. 170–184. An extended version is in CoRR abs/1307.7066.

89c Piipponen, A. & Valmari, A.: Constructing Minimal Coverability Sets. (Abdulla, P. A. & Potapov, I.: eds.:) Proceedings of RP 2013 — 7th International workshop on Reachability Problems, Uppsala, Sweden, September 25–27, Lecture Notes in Computer Science 8169, Springer 2013, pp. 183–195.

88b Valmari, A.: External Behaviour of Systems of State Machines with Variables. (K. Jensen et al. eds.:) Transactions on Petri Nets and Other Models of Concurremcy VII, Lecture Notes in Computer Science 7480, Springer 2013, pp. 255–299. (post-proceedings of Advanced Course on Petri Nets 2010)

87c Valmari, A.: Sizes of Up-to-n Halting Testers. Vesa Halava, Juhani Karhumäki, Yuri Matiyasevich (eds.): RuFiDiM II, Proceedings of the Second Russian Finnish Symposium on Discrete Mathematics 2012, TUCS Lecture Notes No 17, September 2012, pp. 176–183.

86c Valmari, A.: All Linear-time Congruences for Familiar Operators Part 2: Infinite LTSs. Maciej Koutny, Irek Ulidowski (eds.): Proceedings of CONCUR 2012 — Concurrency Theory, 23rd International Conference, Newcastle upon Tyne, UK, September 3–8, Lecture Notes in Computer Science 7454, Springer 2012, pp. 162–176.

85c Valmari, A.: All Linear-Time Congruences for Finite LTSs and Familiar Operators. Jens Brandt, Keijo Heljanko (eds.): Proceedings of ACSD 2012, 12th International Conference on Application of Concurrency to System Design, Hamburg, Germany, June 27–29, 2012, IEEE, pp. 12–21.

84ac Valmari, A. & Hansen, H.: Old and New Algorithms for Minimal Coverability Sets. Fundamenta Informaticae Volume 131, Number 1 / 2014, pp. 1–25. Online Monday, March 24, 2014. Earlier version: Serge Haddad, Lucia Pomello (eds.): Proceedings of Application and Theory of Petri Nets and Concurrency, 33rd International Conference, Hamburg, Germany, June 27–29, Lecture Notes in Computer Science 7347, Springer 2012, pp. 208–227.

83a Valmari, A.: Fast Brief Practical DFA Minimization. Information Processing Letters Volume 112, Issue 6, 15 March 2012, pp. 213–217. Online 7 December 2011.

82a Valmari, A.: Does the Shannon Bound Really Apply to All Data Structures? Proceedings of the Estonian Academy of Sciences vol. 62 number 1, 2013, pp. 47–58.

82c Valmari, A.: Does the Shannon Bound Really Apply to Data Structures? Proc. 12th Symposium on Programming Languages and Software Tools – SPLST'11, TUT Press, Tallinn, Estonia 2011, pp. 174–184.

81a Valmari, A.: Simple Bisimilarity Minimization in O(m log n) Time. Fundamenta Informaticae Volume 105, Number 3 / 2010, pp. 319–339. Online Monday, February 07, 2011.

80ac Valmari, A. & Hansen, H.: Can Stubborn Sets Be Optimal? Fundamenta Informaticae Volume 113, Number 3-4 / 2011, pp. 377–397. Online Thursday, February 09, 2012. Earlier version: Can Stubborn Sets Be Optimal? Proceedings of Applications and Theory of Petri Nets, 31st International Conference, Braga, Portugal, June 21–25, Lecture Notes in Computer Science 6128, Springer 2010, pp. 43–62.

79c Valmari, A. & Franceschinis, G.: Simple O(m log n) Time Markov Chain Lumping. Proceedings of Tools and Algorithms for the Construction and Analysis of Systems, 16th International Conference, TACAS 2010, Paphos, Cyprus, March 20–28, Lecture Notes in Computer Science 6015, Springer 2010, pp. 38–52.

78c Geldenhuys, J., Hansen, H. & Valmari, A.: Exploring the Scope for Partial Order Reduction. Proceedings of Automated Technology for Verification and Analysis, 7th International Symposium, ATVA 2009, Macao, China, October 14–16, Lecture Notes in Computer Science 5799, Springer 2009, pp. 39–53.

77a Tiusanen, M. & Valmari, A.: Good to Know About the Efficiency of State Space Methods. Nordic Journal of Computing 15 (2012), 53–74.

77c Tiusanen M. & Valmari, A.: Good to Know about the Efficiency of State Space Methods. (Peltonen, J. ed:) Proceedings of 11th Symposium on Programming Languages and Software Tools and 7th Nordic Workshop on Model Driven Software Engineering, Tampere University of Technology, Department of Software Systems, Report 5, 2009, pp. 147–161.

76c Valmari, A.: Bisimilarity Minimization in O(m log n) Time. Proceedings of Applications and Theory of Petri Nets, 30th International Conference, Paris, France, June 22–26, Lecture Notes in Computer Science 5606, Springer 2009, pp. 123–142.

75c Jääskeläinen, A., Kervinen, A., Katara, M., Valmari, A. & Virtanen, H.: Synthesizing Test Models from Test Cases. Hardware and Software: Verification and Testing (Proceedings of Haifa Verification Conference 2008), Lecture Notes in Computer Science 5394, Springer 2009, pp. 179–193.

74e Valmari, A.: Software Model Checking is a Rich Research Field. Introduction to a special issue. International Journal on Software Tools for Technology Transfer (STTT) (2009) 11: 1–11 Also DOI 10.1007/s10009-008-0089-7, November 13, 2008.

73c Valmari, A. & Lehtinen, P.: Efficient Minimization of DFAs with Partial Transition Functions. Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), Feb. 21-23, Bordeaux, France, pp. 645-656. The publication and the proceedings are archived in the DROPS database (and elsewhere). Online also as CoRR abs/0802.2826.

72e Valmari, A. & Kangas, A.: Cut States and Elusive Actions (Extended Abstract). AVOCS '07, Seventh International Workshop on Automated Verification of Critical Systems, Oxford, UK, Sept. 10-12, 2007, pp. 9--13. One of four 1-hour invited talks.

71a Kristensen, L. M., Schmidt, K. & Valmari, A.: Question-guided Stubborn Set Methods for State Properties. Formal Methods in System Design (2006) 29:215--251.

70c Hansen, H. & Valmari, A.: Operational Determinism and Fast Algorithms. CONCUR 2006 -- Concurrency Theory, 17th International Conference, Bonn, Germany, August 27-30, 2006, Proceedings. Lecture Notes in Computer Science 4137, Springer-Verlag 2006, pp. 188-202.

69e Valmari, A.: Teaching Concepts of Compositional Concurrency with State Machines. Proceedings of the Workshop on Teaching Concurrency (TeaConc '2006), Turku, Finland, June 27, 2006. Åbo Akademi and TUCS, pp.41-55.

68e Valmari, A.: Teaching mathematically demanding computer science topics to software engineering students: Is there any reason? Is there any hope? Invited talk. Proceedings of the Workshop on Teaching Concurrency (TeaConc '2006), Turku, Finland, June 27, 2006. Åbo Akademi and TUCS, pp. 1-8.

67e Valmari, A. (editor): Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March/April 2006, Proceedings. Lecture Notes in Computer Science 3925, Springer-Verlag 2006. X+307 p.

66a Valmari, A.: What the Small Rubik's Cube Taught Me about Data Structures, Information Theory and Randomisation. International Journal on Software Tools for Technology Transfer (STTT) (2006) 8(3): 180-194. Published online 16 February, 2006. Journal version of an invited talk in TACAS 2004, Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, Barcelona, Spain, March 29-April 2.

65d Valmari, A.: A Modern Mathematical Theory of Co-operating State Machines. Proceedings of the Algorithmic Information Theory Conference, Vaasa, Finland, May 16-18 2005, Proceedings of the University of Vaasa, Reports 124, ss. 201-214.

64cf Kellomäki, T. & Valmari, A.: A Method for Analysing the Performance of Certain Testing Techniques for Concurrent Systems. Proceedings of ACSD 2005, Fifth International Conference on Application of Concurrency to System Design, St. Malo, France, June 7-9, IEEE Computer Society Press, pp. 154--163. Earlier version: A Method for Analysing the Performance of Testing Techniques for Concurrent Systems. Tampere University of Technology, Institute of Software Systems Report 37, 2004, 12 p. ISBN 952-15-1273-3, ISSN 1459-417X.

63c Virtanen, H., Hansen, H., Valmari, A., Nieminen, J. & Erkkilä, T.: Tampere Verification Tool. Proceedings of TACAS 2004, Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, Barcelona, Spain, March 29-April 2, Lecture Notes in Computer Science 2988, Springer-Verlag 2004, pp. 153-157.

62a Geldenhuys, J. & Valmari, A.: More Efficient On-the-fly LTL Verification with Tarjan's Algorithm. Theoretical Computer Science Vol. 345 1 (2005) pp. 60-82.

62c Geldenhuys, J. & Valmari, A.: Tarjan's Algorithm Makes On-the-fly LTL Verification More Efficient. Proceedings of TACAS 2004, Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, Barcelona, Spain, March 29-April 2, Lecture Notes in Computer Science 2988, Springer-Verlag 2004, pp. 205-219.

61f Valmari, A.: Software Mathematics as a Course Topic. Kolin Kolistelut -- Koli Calling 2003, Proc. Third Finnish / Baltic Sea Conference on Computer Science Education, Oct. 3-5, 2003 Koli, Finland, Helsinki University Printing House, pp. 101-109.

60c Hansen, H., Virtanen, H. & Valmari, A.: Merging State-based and Action-based Verification. Third International Conference on Application of Concurrency to System Design (ACSD'03), June 18-20, 2003, Guimarães, Portugal, IEEE, pp. 150-156.

59c Kangas, A. & Valmari, A.: Verification with the Undefined: A New Look. Ed. Thomas Arts and Wan Fokkink, Proc. Eighth International Workshop on Formal Methods for Industrial Critical Systems (FMICS'03), Røros, Norway, June 5-7, 2003, ERCIM, pp. 122-137. Also Electronic Notes in Theoretical Computer Science Volume 80, Elsevier Science, August 2003. PDF file

58c Geldenhuys, J. & Valmari, A.: A Nearly Memory-optimal Data Structure for Sets and Mappings. Model Checking Software: 10th International SPIN Workshop, Portland, OR, USA, May 9-10, 2003. Proceedings, Lecture Notes in Computer Science 2648, pages 136-150. Springer-Verlag, May 2003.

57c Valmari, A. & Kervinen, A.: Alphabet-Based Synchronisation is Exponentially Cheaper. Proc. CONCUR 2002 -- Concurrency Theory, 13th International Conference, Brno, Czech Republic, 20-23 August 2002, Lecture Notes in Computer Science 2421, Springer-Verlag 2002, pp. 161-176.

56c Valmari, A., Virtanen, H. & Puhakka, A.: Context-Sensitive Visibility. FMICS'02, 7th International ERCIM Workshop on Formal Methods for Industrial Critical Systems, University of Malaga, Spain, 12-13 July 2002, pp. 201-217. Ed. Rance Cleaveland and Hubert Garavel, Electronic Notes in Theoretical Computer Science Volume 66 Issue 2, Elsevier Science, December 2002. PDF file

55c Hansen, H., Penczek, W. & Valmari, A: Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties. FMICS'02, 7th International ERCIM Workshop on Formal Methods for Industrial Critical Systems, University of Malaga, Spain, 12-13 July 2002, pp. 185-200. Ed. Rance Cleaveland and Hubert Garavel, Electronic Notes in Theoretical Computer Science Volume 66 Issue 2, Elsevier Science, December 2002. PDF file

54c Puhakka, A. & Valmari, A.: Liveness and Fairness in Process-Algebraic Verification. CONCUR 2001 -- Concurrency Theory, 12th International Conference, Aalborg, Denmark, 21-24 August 2001, Lecture Notes in Computer Science 2154, Springer-Verlag 2001, pp. 202-217.

53c Geldehuys, J. & Valmari, A.: Techniques for Smaller Intermediary BDDs. CONCUR 2001 -- Concurrency Theory, 12th International Conference, Aalborg, Denmark, 21-24 August 2001, Lecture Notes in Computer Science 2154, Springer-Verlag 2001, pp. 233-247.

52c Kervinen, A., Valmari, A. & Järnström, R.: Debugging a Real-life Protocol with CFFD-Based Verification Tools. FMICS 2001, 6th International Workshop on Formal Methods for Industrial Critical Systems, Paris, 16-17 July 2001, INRIA, pp. 13-27.

51e Yakovlev, A. & Valmari, A.: Message from the Programme Chairs. ICACSD 2001, 2nd IEEE International Conference on Application of Concurrency to System Design, Newcastle upon Tyne, U.K., 25-29 June, IEEE Computer Society 2001, pp. vii-viii.

50e Valmari, A.: A Chaos-Free Failures Divergences Semantics with Applications to Verification. Millennial Perspectives in Computer Science: Proceedings of the 1999 Oxford--Microsoft Symposium in honour of Sir Tony Hoare, Palgrave "Cornerstones of Computing" series, 2000, pp. 365-382. (There were 36 talks, all of them invited by the organisers.)

49c Niemistö, A., Yli-Harja, O., Valmari, A., Koivisto, P. & Shmulevich, I.: Reduction Factors in Finite Automata with Application to Nonlinear Filters. Signal Processing X, Theories and Applications, Proc. EUSIPCO 2000 (Tenth European Signal Processing Conference), Tampere, Finland 4-8 Sept. 2000, pp. 2441-2444.

48ee Valmari, A.: Composition and Abstraction. Cassez, F., Jard., C., Rozoy, B. & Ryan, M. (eds.): Modelling and Verification of Parallel Processes. LNCS Tutorials, Lecture Notes in Computer Science 2067, Springer-Verlag 2001, pp. 58-99. Earlier version in Movep '2k, Modelling and Verification of Parallel Processes, Proceedings of the Summer School, Nantes, France 19-23 June 2000, pp. 3-32. (Invited tutorial.)

47c Puhakka, A. & Valmari, A.: Livelocks, Fairness and Protocol Verification. Proceedings of Conference on Software: Theory and Practice, ICS2000, 16th World Computer Congress 2000, Beijing, China, August 21-25, 2000 pp. 471-481.

46ce Kristensen, L. M. & Valmari, A: Improved Question-Guided Stubborn Set Methods for State Properties. Application and Theory of Petri Nets 2000, 21st International Conference, Aarhus, Denmark, June 26-30, 2000, Proceedings, Lecture Notes in Computer Science 1825, Springer-Verlag 2000, pp. 282-302. Also Department of Computer Science, University of Aarhus, DAIMI PB-543, January 2000, 21 p.

45c Helovuo, J. & Valmari, A: Checking for CFFD-Preorder with Tester Processes. Tools and Algorithms for the Construction and Analysis of Systems, 6th International Conference, TACAS 2000, Berlin, March 27-31 2000, Proceedings, Lecture Notes in Computer Science 1785, Springer-Verlag 2000, pp. 283-298.

44c Puhakka, A. & Valmari, A.: Weakest-Congruence Results for Livelock-Preserving Equivalences. Proceedings of CONCUR '99 (Concurrency Theory), Lecture Notes in Computer Science 1664, Springer-Verlag 1999, pp. 510-524.

43e Valmari, A.: The State Explosion Problem. Reisig, W. & Rozenberg, G. (eds.): Lectures on Petri Nets I: Basic Models, LNCS Tutorials, Lecture Notes in Computer Science 1491, Springer-Verlag 1998, pp. 429-528.

42c Kristensen, L. M. & Valmari, A.: Finding Stubborn Sets of Coloured Petri Nets Without Unfolding. Application and Theory of Petri Nets 1998, 19th International Conference, Lisbon, Portugal, June 22-26, 1998, Proceedings, Lecture Notes in Computer Science 1420, Springer-Verlag 1998, pp. 104-123.

41c Valmari, A. & Kokkarinen, I.: Unbounded Verification Results by Finite-State Compositional Techniques: 10^any States and Beyond. 1998 International Conference on Application of Concurrency to System Design, Proceedings, Aizu-Wakamatsu, Fukushima, Japan, March 1998, IEEE Computer Society, 75-85. (This paper, presented by AV, won the "Best Paper Award" of the conference. The winner was elected by the conference participants from 23 papers.)

40a Eloranta, J., Tienari, M. & Valmari, A.: Essential Transitions to Bisimulation Equivalences. Theoretical Computer Science 179 (1997) 397-419.

39a Peled, D., Valmari, A. & Kokkarinen, I.: Relaxed Visibility Enhances Partial Order Reduction. Formal Methods in System Design, 19, 275-289, 2001.

39c Kokkarinen, I., Peled, D. & Valmari, A.: Relaxed Visibility Enhances Partial Order Reduction. Computer Aided Verification, 9th International Conference, CAV'97, Haifa, Israel, June 1997, Proceedings, Lecture Notes in Computer Science 1254, Springer-Verlag 1997, pp. 328-339.

38f Puhakka, A. & Valmari, A.: Verification of Self-Synchronizing Alternating Bit Protocols with ARA. Proceedings of the Fifth Symposium on Programming Languages and Software Tools, Jyväskylä, Finland, June 1997, University of Helsinki, Department of Computer Science, Series of Publications C, Report C-1997-37, pp. 167-178.

37e Valmari, A.: Stubborn Set Methods for Process Algebras. Proceedings of POMIV'96, Workshop on Partial Order Methods in Verification, Princeton, NJ, USA, July 24-26, 1996, DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 29, American Mathematical Society 1997, pp. 213-231. (preliminary proceedings 1996, pp. 192-210.) (There were 25 talks, all of them invited by the organisers.)

36d Valmari, A.: Optimality Results for Median Computation. NORSIG'96, 1996 IEEE Nordic Signal Processing Symposium, September 24-27, 1996, Espoo, Finland, TKK Offset, pp. 279-282.

35c Karsisto, K. & Valmari, A.: Verification-Driven Development of a Collision-Avoidance Protocol for the Ethernet. Formal Techniques in Real-Time and Fault Tolerant Systems, 4th International Symposium, Uppsala, Sweden, Sept. 11-13, 1996, Proceedings, Lecture Notes in Computer Science 1135, Springer-Verlag 1996, pp. 228-245.

34f Valmari, A.: Verification Algorithm Research Group at Tampere University of Technology. Tietojenkäsittelytiede, nr. 8, August 1996, pp. 25-38.

33e Valmari, A.: Compositionality in State Space Verification Methods. Invited talk, Application and Theory of Petri Nets 1996, 17th International Conference, Osaka, Japan, June 1996, Proceedings, Lecture Notes in Computer Science 1091, Springer-Verlag 1996, pp. 29-56. (This was one of three one-hour invited talks during the conference. The conference had also 26 ordinary talks.)

32c Valmari, A., Karsisto, K. & Setälä, M.: Visualisation of Reduced Abstracted Behaviour as a Design Tool. Proceedings of PDP'96, the Fourth Euromicro Workshop on Parallel and Distributed Processing, Braga, Portugal, January 24-26 1996, IEEE Computer Society Press, pp. 187-194.

31d Valmari, A. & Savola, R. Verification of the Behaviour of Reactive Software with CFFD-semantics and Ara Tools. Proceedings of an International Symposium on On-board Real-time Software, ESTEC, Noordwijk, The Netherlands, 13-15 November 1995, ESA SP-375, January 1996, pp. 173-180.

30cf Valmari, A. & Setälä, M.: Visual Verification of Safety and Liveness. Proceedings of Formal Methods Europe '96: Industrial Benefit and Advances in Formal Methods, Lecture Notes in Computer Science 1051, Springer-Verlag 1996, pp. 228-247. Also Tampere University of Technology, Software Systems Laboratory, Report 17, Tampere, Finland, September 1995, 20 p.

29af Valmari, A. & Tienari, M.: Compositional Failure-Based Semantic Models for Basic LOTOS. Formal Aspects of Computing (1995) 7: 440­468. Also Tampere University of Technology, Software Systems Laboratory, Report 16, Tampere, Finland, July 1993, 25 p.

28c Valmari, A.: Failure-based Equivalences Are Faster Than Many Believe. Structures in Concurrency Theory, Proceedings, Berlin, Germany, May 1995, Springer-Verlag "Workshops in Computing" series 1995, pp. 326­340.

27a Valmari, A.: The Weakest Deadlock-Preserving Congruence. Information Processing Letters 53 (1995) 341-346.

26e Valmari, A.: State of the Art Report: Stubborn Sets. Invited article, Petri Net Newsletter 46, April 1994, pp. 6-14.

25d Setälä, M. & Valmari, A.: Validation and Verification with Weak Process Semantics. Proceedings of Nordic Seminar on Dependable Computing Systems 1994, Lyngby, Denmark, August 1994, pp. 15-26.

24c Valmari, A.: Compositional Analysis with Place-Bordered Subnets. Application and Theory of Petri Nets 1994, 15th International Conference, Zaragoza, Spain, June 1994, Proceedings, Lecture Notes in Computer Science 815, Springer-Verlag 1994, pp. 531-547.

23c Valmari, A.: On-the-fly Verification with Stubborn Sets. Proceedings of CAV '93, 5th International Conference on Computer-Aided Verification, Elounda, Greece, Lecture Notes in Computer Science 697, Springer-Verlag 1993, pp. 397-408.

22c Kaivola, R. & Valmari, A.: The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic. Proceedings of CONCUR '92 (Concurrency Theory), Lecture Notes in Computer Science 630, Springer-Verlag 1992, pp. 207-221.

21f Valmari, A.: Alleviating State Explosion during Verification of Behavioural Equivalence. Department of Computer Science, University of Helsinki, Report A-1992-4, Helsinki, Finland 1992, 57 p.

20c Valmari, A., Kemppainen, J., Clegg, M. & Levanto, M.: Putting Advanced Reachability Analysis Techniques Together: the "ARA" Tool. Proceedings of Formal Methods Europe '93: Industrial-Strength Formal Methods, Lecture Notes in Computer Science 670, Springer-Verlag 1993, pp. 597-616. An updated version of the below 20.

20e Kemppainen, J., Levanto, M., Valmari, A. & Clegg, M.: "ARA" Puts Advanced Reachability Analysis Methods Together. Proceedings of the Fifth Nordic Workshop on Programming Environment Research, Tampere, Finland, January 1992, Tampere University of Technology, Software Systems Laboratory, Report 14. An earlier version of the above 20.

19c Kaivola, R. & Valmari, A.: Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models. Proceedings of CONCUR '91 (Concurrency Theory), Lecture Notes in Computer Science 527, Springer-Verlag 1991, pp. 361-375.

18c Valmari, A. & Clegg, M.: Reduced Labelled Transition Systems Save Verification Effort. Proceedings of CONCUR '91 (Concurrency Theory), Lecture Notes in Computer Science 527, Springer-Verlag 1991, pp. 526-540.

17c Valmari, A. & Tienari, M.: An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm. Protocol Specification, Testing and Verification XI (Proceedings of 11th International IFIP WG 6.1 Symposium on Protocol Specification, Testing and Verification, Stockholm, Sweden, June 1991), North-Holland 1991, pp. 3-18.

16c Valmari, A.: Stubborn Sets of Coloured Petri Nets. Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Gjern, Denmark 1991, pp. 102-121.

15acc Valmari, A.: A Stubborn Attack on State Explosion. Formal Methods in System Design, 1: 297-322 (1992). (Earlier versions: Computer-Aided Verification, 2nd International Conference, CAV '90, New Brunswick, NJ, USA, June 1990, Proceedings, Lecture Notes in Computer Science 531, Springer-Verlag 1991, pp. 156-165 and Computer-Aided Verification '90, DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 3, AMS & ACM 1991, pp. 25-41.)

14bfc Valmari, A.: Compositional State Space Generation. Advances in Petri Nets 1993, Lecture Notes in Computer Science 674, Springer-Verlag 1993, pp. 427-457. (Also: Department of Computer Science, University of Helsinki, Report A-1991-5, Helsinki, Finland 1992, 30 p., and earlier version: Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris, France 1990, pp. 43-62.)

13d Wheeler, G. R., Valmari, A. & Billington, J.: Baby TORAS Eats Philosophers but Thinks about Solitaire. Proceedings of the fifth Australian Software Engineering Conference, Sydney, Australia 1990, pp. 283-288.

12d Valmari, A. & Jokela, T.: Embedded Software Validation Through State Space Generation. Second International Conference on Software Engineering for Real Time Systems, UK, 1989. IEE Conference Publication no. 309, pp. 278-282.

11bc Valmari, A.: Stubborn Sets for Reduced State Space Generation. Advances in Petri Nets 1990, Lecture Notes in Computer Science 483, Springer-Verlag 1991, pp. 491-515. (Earlier version: Proceedings of the 10th International Conference on Application and Theory of Petri Nets, Bonn, West Germany 1989, Vol II, pp. 1-22.)

10d Valmari, A.: State Space Generation with Induction. Scandinavian Conference on Artificial Intelligence -89, Tampere, Finland, IOS, Amsterdam 1989, pp. 99-115.

9c Valmari, A.: Eliminating Redundant Interleavings during Concurrent Program Verification. Proceedings of Parallel Architectures and Languages Europe '89, Lecture Notes in Computer Science 366, Springer-Verlag 1989, pp. 89-103.

8f Valmari, A.: State Space Generation: Efficiency and Practicality. PhD Thesis, Tampere University of Technology Publications 55, 1988, 169 p. Contains publications 2, 3, ..., 7 from below.

7f Valmari, A.: Some Polynomial Space Complete Concurrency Problems. Tampere University of Technology, Software Systems Laboratory Report 4, 1988, 34 p.

6d Valmari, A.: PC-Rimst - A Tool for Validating Concurrent Program Designs. Microprocessing and Microprogramming 24 (1988) 1-5 (Proceedings of the Euromicro `88), pp. 809-818.

5f Valmari, A.: Heuristics for Lazy State Generation Speeds up Analysis of Concurrent Systems. Proceedings of the Finnish Artificial Intelligence Symposium STeP-88, Helsinki 1988, Vol. 2 pp. 640-650.

4c Valmari, A.: Error Detection by Reduced Reachability Graph Generation. Proceedings of the 9th European Workshop on Application and Theory of Petri Nets, Venice, Italy 1988, pp. 95-112.

3d Valmari, A.: Reachability Analysis -Based Validation of Embedded Systems. Microprocessing and Microprogramming 21 (1987) 1-5 (Proceedings of the Euromicro `87), pp. 393-403.

2c Valmari, A. & Tiusanen, M.: A Graph Model for Efficient Reachability Analysis of Description Languages. Proceedings of the Eighth European Workshop on Application and Theory of Petri Nets, Zaragoza, Spain 1987, pp. 349-366.

1d Pulli, P. & Valmari, A.: Enhancing Yourdon's Extended SA/SD Method for Embedded System Design. IEE International Conference on Software Engineering for Real Time Systems, UK, 1987. IEE Publication no. 77, pp. 29-35.

2. In Finnish

some of these can be downloaded without violating copyrights at http://www.cs.tut.fi/~ava/kirjoitelmia/

Remarks:
(2) “Tietojenkäsittelytiede” is the journal of the Finnish Society for Computer Science.
(1) “INSKO“ was a continuing education centre owned by Finnish engineering organisations.

33 nimeltä mainitsematon Matematiikan laitoksen professori: Ovatko kaikki lottorivit satunnaisia? Liaani (TUT sciences student magazine) Dec. 2012, pp. 6–7

32 Valmari, A.: Kuinka kiltti mutta tarpeeton pikku algoritmi sai tärkeän tehtävän. Tietojenkäsittelytiede 30, July 2010, pp. 33–55.

31 Valmari, A.: Käytännön kokemus algoritmikirjastojen autuudesta. Tietojenkäsittelytiede 29, October 2009, pp. 49–70.

30 Valmari, A.: Onko √-1 olemassa? Keskipituinen kertomus lukujen olemuksesta. 1. osa Solmu 1/2008 pp. 18–24. 2. osa Solmu 2/2008 pp. 13–20.

29 Valmari, A.: Rinnakkaisjärjestelmien algoritminen verifiointi. Tietojenkäsittelytiede 27, December 2007, pp. 47–76. ("Algorithmic verification of concurrent systems". One of the survey articles that were originally invited for the 20th anniversary of the Finnish Society for Computer Science.) (2)

28 Valmari, A.: Vuosijuhla-artikkelien julkaiseminen alkaa. Päätoimittajan palsta, Tietojenkäsittelytiede 26, July 2007, p. 8. (Responsible editor's column, "The publication of anniversary surveys begins".) (2)

27 Valmari, A.: Tuleeko kaikista rinnakkaisohjelmoijia? Päätoimittajan palsta, Tietojenkäsittelytiede 25, December 2006, pp. 4–7. (Responsible editor's column, "Will Everyone become a Concurrent Programmer?".) (2)

26 Valmari, A.: Opiskelijan myyttiset 1600 tuntia. Päätoimittajan palsta, Tietojenkäsittelytiede 24, December 2005, pp. 4–7. (Responsible editor's column, "The Mythical 1600 Hours Of a Student".)

25 Valmari, A.: Pääkirjoitus Pääsatu. Päätoimittajan palsta, Tietojenkäsittelytiede 23, June 2005, pp. 4–7. (Responsible editor's column, a fairy tale where mathematics is a friendly monster and bugs are its nasty cousin.) (2)

24 Valmari, A.: Linjakkaita linjapäätöksiä. Päätoimittajan palsta, Tietojenkäsittelytiede 22, December 2004, pp. 6–9. (Responsible editor's column, about the paper selection policy of the journal.) (2)

23 Valmari, A.: Esimerkki modernista sovellushakuisesta teoriasta: vuorovaikuttavat tilakoneet. Teoksessa: Fränti, P. & Marjomaa, E. (toim.). Tietojenkäsittelytieteen päivät 2004, 24.-26.5.2004, Joensuun Tiedepuisto, International Proceedings Series. Joensuun yliopisto, Tietojenkäsittelytieteen laitos. s. 7–12. (An example of a modern application-oriented theory: interacting state machines.)

22 Valmari, A.: Mitä pieni Rubikin kuutio opetti minulle tietorakenteista, informaatioteoriasta ja satunnaisuudesta. Tietojenkäsittelytiede 20, December 2003, pp. 53–78. (What a small Rubik's cube taught me on data structures, information theory and randomness.) (2)

21 Valmari, A.: Hyvä opinnäytetyö. Puheenjohtajan palsta, Tietojenkäsittelytiede 20, December 2003, pp. 4–6. (The chairperson's and responsible editor's column, discusses the criteria for a good thesis.) (2)

20 Valmari, A.: Kannattiko päiviä laajentaa? Puheenjohtajan palsta, Tietojenkäsittelytiede 19, June 2003, pp. 4–6. (The chairperson's and responsible editor's column, analyses the success of the change of the annual Finnish Computer Science Days from a two-day event to a three-day event.) (2)

19 Valmari, A.: Tietojenkäsittelytieteen päivät laajenevat. Puheenjohtajan palsta, Tietojenkäsittelytiede 18, December 2002, pp. 4–5. (The chairperson's and responsible editor's column, discusses the change of the annual Finnish Computer Science Days from a two-day event to a three-day event.) (2)

18 Valmari, A.: Ja taas lehti muuttui! Puheenjohtajan palsta, Tietojenkäsittelytiede 17, May 2002, pp. 4–5. (The chairperson's and responsible editor's column, discusses the future of the journal after a peaceful change of the editors and format.) (2)

17 Valmari, A.: Matematiikan tarve ohjelmistotyössä. Arkhimedes 2/2001 pp. 18–22. (Discusses the mathematics needs in the software profession. "A" is a membership journal of some finnish societies in physics and mathematics.)

16 Valmari, A.: Ohjelmointi on tietotekniikan ydin. Aamulehti, alakerta-artikkeli 2000-10-24, p. 2. (A visiting expert's article in the editorial page of one of Finland's largest daily newspapers that is the main newspaper of Tampere region. Discusses changes in the nature of software production during the decade before the millennium.)

15 Valmari, A.: Kun ohjelmistotuotanto ei riitä. Tietojenkäsittelytiede, kesäkuu 2000, pp. 10-14. (Discusses the role of mathematics and formal methods in solving demanding practical software problems. Likes mathematics and to some extent dislikes formal methods.)

14 Valmari, A.: Tietotekniikan huippukoulutus on vinoutunutta. Puheenvuoro, Suomen Kuvalehti 18, 5.5.2000, pp. 72-73. (A letter to the editor in a high-quality Finnish weekly magazine about the education of high-end software professionals.)

13 Valmari, A.: Tietojenkäsittelytieteiden päivät, Ohjelmoinnin perusopetuksen uudet tuulet. Tietojenkäsittelytiede, kesäkuu 1998, pp. 28-30. (Report of the "Programming first courses" session in the National Computer Science days.) (2)

12 Valmari, A.: Reaktiivisten ohjelmistojen tutkijat Tampereella. Anturi 3, 21.3.1995, p. 10. (Report of REACT general meeting in the monthly newspaper of Tampere University of Technology.)

11 Valmari, A.: Insinööreille töitä - mutta millaisille? Puheenvuoro, Suomen Kuvalehti 50, 16.12.1994, pp. 42-43. (A letter to the editor in a high-quality Finnish weekly magazine about the distribution of the need for electronics, information technology and software engineers in the labour market, based on an analysis of the topics and sources of funding of DI (~ MSc) theses.)

10 Valmari, A.: Rinnakkaisjärjestelmien validointi ja verifiointi - katsaus: käsitteet, teoriat ja menetelmät (Validation and Verification of Concurrent Systems - A Survey: Concepts, Theories and Methods.) University of Oulu, Department of Information Processing Science, Working Papers Series B 16, February 1991, 32 p. Abstract in English.

9 Hakalahti, H. & Valmari, A.: Tietokoneohjelmistot riskitekijana (Computer Software as a Risk Factor). Tekniikan tekijät ("Technology Developers", an annual advertisement magazine of the Technical Research Centre of Finland, 104 p.) 1991 pp. 32-35.

8 Valmari, A.: Käyttäytymisen samuuden osoittamiseen perustuva verifiointimenetelmä (A Verification Method Based on Showing Equivalence of Behaviours). INSKO seminar "Sulautettujen järjestelmien ohjelmistoturvallisuus" ("Software Safety of Embedded Systems") Nov. 26-27, 1990 and Sept. 12-13, 1991. 15 p. (1)

7 Valmari, A.: Ohjelmointikielten tarjoamat turvallisuutta lisäävät keinot (Safety-Improving Features in Programming Languages). INSKO seminar "Sulautettujen järjestelmien ohjelmistoturvallisuus" ("Software Safety of Embedded Systems") Nov. 26-27, 1990 and Sept. 12-13, 1991. 21 p. (1)

6 Valmari, A.: Reaaliaikaohjelmistojen erityispiirteet (The Special Properties of Real-Time Programs). INSKO seminar "Reaaliaikaohjelmistojen testaus" ("Testing of Real-Time Programs") Nov. 12-13, 1987, Aug. 29-31, 1988 and March 22-23, 1990. 10 p. (1)

5 Valmari, A.: Johdatus rinnakkaisuuteen (An Introduction to Concurrency). INSKO seminar "Reaaliaikajärjestelmien suunnitteluperiaatteet" ("Design Principles of Real-Time Systems") Febr. 2-3, 1987, Oct. 6-7, 1987 and Oct. 10-11, 1988. 14 p. (1)

4 Valmari, A.: Reaaliaikajärjestelmä kommunikoivien automaattien muodostamana systeeminä (Real-Time Systems as Systems of Communicating Automata). INSKO seminar "Reaaliaikajärjestelmien suunnitteluperiaatteet" ("Design Principles of Real-Time Systems") Febr. 2-3, 1987, Oct. 6-7, 1987 and Oct. 10-11, 1988. 12 p. (1)

3 Valmari, A.: Petriverkkopohjainen rinnakkaisohjelma-analysaattori (A Petri Net Based Concurrent Program Analyser). Diploma Thesis, Helsinki University of Technology, Department of Technical Physics, Espoo 1985. 153 p. Abstract in English.

2 Valmari, A.: Roudan kehittymisen tilastollinen malli (A Statistical Model for the Development of Ground Frost). MTTK Tiedote 9/84 (Agricultural Research Centre, Finland report 9/84), 1984, 33 p.

1 Valmari, A.: MC 68120, Älykäs yleiskäyttöinen oheislaiteohjain (MC 68120, an Intelligent Universal Peripheral Adapter). Erikoismikroprosessorit (Special Microprocessors), eds.: Hartimo, I.: & Simula, O., Seminar in Computer Technology, spring 1983, Helsinki University of Technology, Report TKK-F-B77 (1983), pp. A2-1 - A2-9.