Nisse Husberg and Tapio Manner. Emma: developing an industrial reachability analyser for SDL. In Jeannette M. Wing, Jim Woodcock, and Jim Davies, editors, Proceedings of Formal Methods 1999, volume 1708 of Lecture Notes in Computer Science, pages 642–661, Toulouse, France, September 1999. Springer-Verlag, Berlin, Germany.
Nisse Husberg, Tomi Janhunen and Ilkka Niemelä, editors, Leksa Notes in Computer Science: Festscrift in Honour of Professor Leo Ojala. Research Report A63, Helsinki University of Technology, Laboratory for Theoretical Computer Science.
Nisse Husberg, Teemu Tynjälä and Kimmo Varpaaniemi. Modelling and analysing the SDL description of the ISDN-DSS1 protocol. In Mogens Nielsen and Dan Simpson, editors, Application and Theory of Petri Nets 2000, 21st International Conference, ICATPN 2000, volume 1825 of Lecture Notes in Computer Science, pages 244–260, Århus, Denmark, June 2000. Springer-Verlag, Berlin, Germany.
Jukka Järvenpää and Marko Mäkelä. Towards Automated Checking of Component-Oriented Enterprise Applications. In Daniel Moldt, editor, Second Workshop on Modelling of Objects, Components and Agents, DAIMI report PB-561, University of Århus, Denmark, August 2002.
Ekkart Kindler and Hagen Völzer. Flexibility in algebraic nets. In Jörg Desel and Manuel Silva, editors, Application and Theory of Petri Nets 1998, 19th International Conference, ICATPN'98, volume 1420 of Lecture Notes in Computer Science, pages 345–364, Lisbon, Portugal, June 1998. Springer-Verlag, Berlin, Germany.
Timo Latvala. Model Checking Linear Temporal Logic Properties of Petri Nets with Fairness Constraints. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Espoo, Finland, October 2000. Superseded by HUT TCS Research Report A67.
Timo Latvala. Model checking LTL properties of high-level Petri nets with fairness constraints. In José-Manuel Colom and Maciej Koutny, editors, Application and Theory of Petri Nets 2001, 22nd International Conference, ICATPN 2001, volume 2075 of Lecture Notes in Computer Science, pages 242–262, Newcastle upon Tyne, England, June 2001. Springer-Verlag, Berlin, Germany.
Timo Latvala and Keijo Heljanko. Coping with Strong Fairness. Fundamenta Informaticae, 43(1–4):175–193, 2000.
Timo Latvala. Model Checking Linear Temporal Logic Properties of Petri Nets with Fairness Constraints, Research Report A67, Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, January 2001
Glenn Lewis and Charles Lakos. Incremental state space construction for coloured Petri nets. In José-Manuel Colom and Maciej Koutny, editors, Application and Theory of Petri Nets 2001, 22nd International Conference, ICATPN 2001, volume 2075 of Lecture Notes in Computer Science, pages 263–282, Newcastle upon Tyne, England, June 2001. Springer-Verlag, Berlin, Germany.
Marko Mäkelä. Implementing the Front-End of an SDL Compiler. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Espoo, Finland, December 1998
Marko Mäkelä. A Reachability Analyser for Algebraic System Nets. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Espoo, Finland, March 2000. Superseded by HUT TCS Research Report A69.
Marko Mäkelä. Condensed storage of multi-set sequences. In Workshop on the Practical Use of High-Level Petri Nets, Århus, Denmark, June 2000
Marko Mäkelä. Modular reachability analyzer for high-level Petri nets. In Réne Boel and Geert Stremersch, editors, Discrete Event Systems: Analysis and Control. Proceedings of the 5th Workshop on Discrete Event Systems, pages 477–478. Ghent, Belgium, August 2000. Kluwer Academic Publishers.
Marko Mäkelä. Applying compiler techniques to reachability analysis of high-level models. In Hans-Dieter Burkhard, Ludwik Czaja, Andrzej Skowron and Peter Starke, editors, Workshop on Concurrency, Specification & Programming 2000, Informatik-Bericht 140, pages 129–142. Humboldt-Universität zu Berlin, Germany, October 2000.
Marko Mäkelä. A Reachability Analyser for Algebraic System Nets, Research Report A69, Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, June 2001
Marko Mäkelä. Optimising enabling tests and unfoldings of algebraic system nets. In José-Manuel Colom and Maciej Koutny, editors, Application and Theory of Petri Nets 2001, 22nd International Conference, ICATPN 2001, volume 2075 of Lecture Notes in Computer Science, pages 283–302, Newcastle upon Tyne, England, June 2001. Springer-Verlag, Berlin, Germany.
Marko Mäkelä. Maria: modular reachability analyser for algebraic system nets. In Javier Esparza and Charles Lakos, editors, Application and Theory of Petri Nets 2002, 23rd International Conference, ICATPN 2002, volume 2360 of Lecture Notes in Computer Science, pages 434–444, Adelaide, Australia, June 2002. Springer-Verlag, Berlin, Germany.
Marko Mäkelä. Efficiently verifying safety properties with idle office computers. In Charles Lakos, Robert Esser, Lars M. Kristensen and Jonathan Billington, editors, Formal Methods in Software Engineering and Defence Systems 2002, volume 12 of Conferences in Research and Practice in Information Technology, pages 11–16, Adelaide, Australia, June 2002. Australian Computer Society Inc.
Marko Mäkelä. Model checking safety properties in modular high-level nets. In Wil M.P. van der Aalst and Eike Best, editors, Application and Theory of Petri Nets 2003, 24th International Conference, ICATPN 2003, volume 2679 of Lecture Notes in Computer Science, pages 201–220, Eindhoven, The Netherlands, June 2003. Springer-Verlag, Berlin, Germany.
Leo Ojala, Nisse Husberg and Simo Blom. Modelling a distributed dynamic channel allocation algorithm for mobile computing using Predicate/Transition nets. In 1999 IEEE International Conference on Systems, Man, and Cybernetics, volume III, pages 875–880. Tokyo, Japan, October 1999. IEEE, USA.
Kimmo Varpaaniemi. Stable models for stubborn sets. Fundamenta Informaticae, 43(1–4):355-375, 2000.