Keijo Heljanko

Professor (Associate Professor)

Research outputs

  1. 2000
  2. Published

    Model Checking with Finite Complete Prefixes is PSPACE-Complete

    Heljanko, K., 2000, The 11th International Conference on Concurrency Theory, CONCUR 2000, University Park PA, USA, August 2000. Palamidessi, C. (ed.). Berlin, Germany, p. 108-122

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  3. Published

    Petri Net Analysis and Nonmonotonic Reasoning

    Heljanko, K. & Niemelä, I., 2000, Leksa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala. Husberg, N., Janhunen, T. & Niemelä, I. (eds.). Espoo: Helsinki University of Technology, p. 7-19

    Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

  4. Published

    PROD 3.3.08 -saavutettavuusanalyysiohjelmisto

    Anderson, L., Helander, J., Heljanko, K., Janhunen, T., Jürgens, R., Kangas, I., Nurmela, K. J., Oksanen, K., Pesonen, O., Rauhamaa, M. & 5 othersReilly, J., Suonsivu, H., Valkealahti, K., Varpaaniemi, K. & Väisänen, P., 2000

    Research output: Artistic and non-textual formSoftwareScientific

  5. Published

    Testing SPIN's LTL Formula Conversion into Büchi Automata with Randomly Generated Input

    Tauriainen, H. & Heljanko, K., 2000, The 7th International SPIN Workshop on Model Checking of Software, SPIN'2000, Stanford CA, USA, August/September 2000. Havelund, K., Penix, J. & Visser, W. (eds.). Berlin, Germany, p. 54-72

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  6. 1999
  7. Published

    Coping with strong fairness - on-the-fly emptiness checking with Streett Automata

    Latvala, T. & Heljanko, K., 1999, Concurrency, Specification & Programming'99 (CS&P'99), Varsova, Puola, 28.-30.9.1999. Burkhard, H-D., Czaja, L., Nguyen, H-S. & Starke, P. (eds.). Varsova: Warsaw University, p. 107-118

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  8. Published

    Deadlock and Reachability Checking with Finite Complete Prefixes

    Heljanko, K., 1999, Espoo, (HUT Laboratory for Theoretical Computer Science Research Reports; no. HUT-TCS-A56).

    Research output: Working paperProfessional

  9. Published

    Minimizing Finite Complete Prefixes

    Heljanko, K., 1999, Workshop Concurrency, Specification & Programming '99 (CS&P '99), Varsova, Puola, 28.-30.9.1999. Burkhard, H-D., Czaja, L., Nguyen, H-S. & Starke, P. (eds.). Varsova, Puola: Warsaw University, p. 83-95

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  10. Published

    Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-safe Petri Nets

    Heljanko, K., 1999, In : Fundamenta Informaticae. 37, 3, p. 247-268

    Research output: Contribution to journalArticleScientificpeer-review

  11. Published

    Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-safe Petri Nets

    Heljanko, K., 1999, 5th International Conference, Tools and Algorithms for the Construction and Analysis of Systems, TACAS'99, Amsterdam, Holland, 22.-28.3.1999. Rance Cleareland, W. (ed.). Berlin, p. 240-254

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  12. 1998
  13. Published

    Deadlock Checking for Complete Finite Prefixes Using Logic Programs with Stable Model Semantics

    Heljanko, K., 1998, Workshop Concurrency, Specification & Programming 1998. Burkhard, H-D., Czaja, L. & Starke, P. (eds.). Berlin: Humboldt-Universitat zu Berlin, p. 106-115

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  14. 1997
  15. Published

    Model Checking the Branching Time Temporal Logic CTL

    Heljanko, K., 1997, Espoo, (Series A: Research Reports; no. A45).

    Research output: Working paperProfessional

  16. Published

    PROD-3.2-An Advanced Tool for Efficient Reachability Analysis

    Varpaaniemi, K., Heljanko, K. & Lilius, J., 1997, 9th International Conference on Computer Aided Verification (CAV'97). Grumberg, O. (ed.). Berlin, p. 472-475

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  17. 1996
  18. Published

    An Advanced Tool for Efficient Reachability Analysis

    Varpaaniemi, K., Lilius, J. & Heljanko, K., 1996, Demos at Concur 96, August 1996, Pisa, Italy. Priami, C. (ed.). Pisa, Italy, p. 18-19

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  19. Published

    Implementing a CTL Model Checker

    Heljanko, K., 1996, Humboldt-University, September 1996. Nr. 69, I-B. (ed.). Berlin, Saksa: Humboldt University, p. 75-84

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  20. Published

    PROD 3.111 An Advanced Tool for Efficient Reachability Analysis

    Varpaaniemi, K., Lilius, J. & Heljanko, K., 1996, Schloss Dagstuhl, Germany.

    Research output: Working paperProfessional

Previous 1 2 3 Next

ID: 66590