The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Antti Valmari: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Antti Valmari
    The State Explosion Problem. [Citation Graph (0, 0)][DBLP]
    Petri Nets, 1996, pp:429-528 [Conf]
  2. Henri Hansen, Heikki Virtanen, Antti Valmari
    Merging State-Based and Action-Based Verification. [Citation Graph (0, 0)][DBLP]
    ACSD, 2003, pp:150-156 [Conf]
  3. Antti Valmari, Ilkka Kokkarinen
    Unbounded Verification Results by Finite-State Compositional Techniques: 10any States and Beyond. [Citation Graph (0, 0)][DBLP]
    ACSD, 1998, pp:75-0 [Conf]
  4. Timo Kellomaki, Antti Valmari
    A Method for Analysing the Performance of Certain Testing Techniques for Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    ACSD, 2005, pp:154-163 [Conf]
  5. Lars Michael Kristensen, Antti Valmari
    Improved Question-Guided Stubborn Set Methods for State Properties. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2000, pp:282-302 [Conf]
  6. Lars Michael Kristensen, Antti Valmari
    Finding Stubborn Sets of Coloured Petri Nets Without Unfolding. [Citation Graph (0, 0)][DBLP]
    ICATPN, 1998, pp:104-123 [Conf]
  7. Antti Valmari
    Stubborn sets for reduced state space generation. [Citation Graph (0, 0)][DBLP]
    Applications and Theory of Petri Nets, 1989, pp:491-515 [Conf]
  8. Antti Valmari
    Compositional State Space Generation. [Citation Graph (0, 0)][DBLP]
    Applications and Theory of Petri Nets, 1991, pp:427-457 [Conf]
  9. Antti Valmari
    Compositional Analysis with Place-Bordered Subnets. [Citation Graph (0, 0)][DBLP]
    Application and Theory of Petri Nets, 1994, pp:531-547 [Conf]
  10. Antti Valmari
    Compositionality in State Space Verification Methods. [Citation Graph (0, 0)][DBLP]
    Application and Theory of Petri Nets, 1996, pp:29-56 [Conf]
  11. Ilkka Kokkarinen, Doron Peled, Antti Valmari
    Relaxed Visibility Enhances Partial Order Reduction. [Citation Graph (0, 0)][DBLP]
    CAV, 1997, pp:328-339 [Conf]
  12. Antti Valmari
    A Stubborn Attack On State Explosion. [Citation Graph (0, 0)][DBLP]
    CAV, 1990, pp:156-165 [Conf]
  13. Antti Valmari
    On-the-Fly Verification with Stubborn Sets. [Citation Graph (0, 0)][DBLP]
    CAV, 1993, pp:397-408 [Conf]
  14. Jaco Geldenhuys, Antti Valmari
    Techniques for Smaller Intermediary BDDs. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2001, pp:233-247 [Conf]
  15. Roope Kaivola, Antti Valmari
    Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:361-375 [Conf]
  16. Roope Kaivola, Antti Valmari
    The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:207-221 [Conf]
  17. Henri Hansen, Antti Valmari
    Operational Determinism and Fast Algorithms. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:188-202 [Conf]
  18. Antti Puhakka, Antti Valmari
    Liveness and Fairness in Process-Algebraic Verification. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2001, pp:202-217 [Conf]
  19. Antti Puhakka, Antti Valmari
    Weakest-Congruence Results for Livelock-Preserving Equivalences. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:510-524 [Conf]
  20. Antti Valmari, Matthew Clegg
    Reduced Labelled Transition Systems Save Verification Effort. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:526-540 [Conf]
  21. Antti Valmari, Antti Kervinen
    Alphabet-Based Synchronisation is Exponentially Cheaper. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:161-176 [Conf]
  22. Antti Valmari, Jukka Kemppainen, Matthew Clegg, Mikko Levanto
    Putting Advanced Reachability Analysis Techniques Together: the "ARA" Tool. [Citation Graph (0, 0)][DBLP]
    FME, 1993, pp:597-616 [Conf]
  23. Antti Valmari, Manu Setälä
    Visual Verification of Safety and Liveness. [Citation Graph (0, 0)][DBLP]
    FME, 1996, pp:228-247 [Conf]
  24. Konsta Karsisto, Antti Valmari
    Verification-Driven Development of a Collision-Avoidance Protocol for the Ethernet. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1996, pp:228-245 [Conf]
  25. Antti Valmari
    Composition and Abstraction. [Citation Graph (0, 0)][DBLP]
    MOVEP, 2000, pp:58-98 [Conf]
  26. Antti Valmari
    Eliminating Redundant Interleavings During Concurrent Program Verification. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1989, pp:89-103 [Conf]
  27. Antti Valmari, Konsta Karsisto, Manu Setälä
    Visualisation of Reduced Abstracted Behaviour as a Design Tool. [Citation Graph (0, 0)][DBLP]
    PDP, 1996, pp:187-195 [Conf]
  28. Antti Valmari, Martti Tienari
    An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm. [Citation Graph (0, 0)][DBLP]
    PSTV, 1991, pp:3-18 [Conf]
  29. Antti Valmari
    State Space Generation with Induction. [Citation Graph (0, 0)][DBLP]
    SCAI, 1989, pp:99-115 [Conf]
  30. Jaco Geldenhuys, Antti Valmari
    A Nearly Memory-Optimal Data Structure for Sets and Mappings. [Citation Graph (0, 0)][DBLP]
    SPIN, 2003, pp:136-150 [Conf]
  31. Juhana Helovuo, Antti Valmari
    Checking for CFFD-Preorder with Tester Processes. [Citation Graph (0, 0)][DBLP]
    TACAS, 2000, pp:283-298 [Conf]
  32. Jaco Geldenhuys, Antti Valmari
    Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:205-219 [Conf]
  33. Heikki Virtanen, Henri Hansen, Antti Valmari, Juha Nieminen, Timo Erkkilä
    Tampere Verification Tool. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:153-157 [Conf]
  34. Antti Valmari, Heikki Virtanen, Antti Puhakka
    Context-Sensitive Visibility. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:2, pp:- [Journal]
  35. Henri Hansen, Wojciech Penczek, Antti Valmari
    Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:66, n:2, pp:- [Journal]
  36. Antero Kangas, Antti Valmari
    Verification with the Undefined: A New Look. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:80, n:, pp:- [Journal]
  37. Antti Valmari, Martti Tienari
    Compositional Failure-based Semantics Models for Basic LOTOS. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1995, v:7, n:4, pp:440-468 [Journal]
  38. Antti Valmari
    A Stubborn Attack on State Explosion. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1992, v:1, n:4, pp:297-322 [Journal]
  39. Doron Peled, Antti Valmari, Ilkka Kokkarinen
    Relaxed Visibility Enhances Partial Order Reduction. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2001, v:19, n:3, pp:275-289 [Journal]
  40. Lars Michael Kristensen, K. Schmidt, Antti Valmari
    Question-guided stubborn set methods for state properties. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2006, v:29, n:3, pp:215-251 [Journal]
  41. Antti Valmari
    The Weakest Deadlock-Preserving Congruence. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:6, pp:341-346 [Journal]
  42. Antti Valmari
    What the small Rubik's cube taught me about data structures, information theory, and randomisation. [Citation Graph (0, 0)][DBLP]
    STTT, 2006, v:8, n:3, pp:180-194 [Journal]
  43. Jaana Eloranta, Martti Tienari, Antti Valmari
    Essential Transitions to Bisimulation Equivalences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:179, n:1-2, pp:397-419 [Journal]
  44. Jaco Geldenhuys, Antti Valmari
    More efficient on-the-fly LTL verification with Tarjan's algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:1, pp:60-82 [Journal]

  45. Bisimilarity Minimization in O(m logn) Time. [Citation Graph (, )][DBLP]


  46. Can Stubborn Sets Be Optimal? [Citation Graph (, )][DBLP]


  47. Exploring the Scope for Partial Order Reduction. [Citation Graph (, )][DBLP]


  48. Synthesizing Test Models from Test Cases. [Citation Graph (, )][DBLP]


  49. Efficient Minimization of DFAs with Partial Transition. [Citation Graph (, )][DBLP]


  50. Simple O(m logn) Time Markov Chain Lumping. [Citation Graph (, )][DBLP]


  51. Efficient Minimization of DFAs with Partial Transition Functions [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002