TCS / Research / Publications / 2001
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Publications in 2001

64Petteri Kaski. Isomorph-free exhaustive generation of combinatorial designs. Research Report A70, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2001.
NOTE: Reprint of Master's thesis; see URL below.
PostScript (1 MB)
GZipped PostScript (406 kB)
PDF (716 kB)
Info
See www.tcs.hut.fi ...
63Marko Mäkelä, Timo Latvala, and Kimmo Varpaaniemi. Maria 1.0—modular reachability analyser. Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, November 2001. Software.
Info
See www.tcs.hut.fi ...
62Marko Mäkelä. Rinnakkaisuus hallintaan—formaalit menetelmät mutkikkaiden järjestelmien suunnittelun apuna. Prosessori, pages 68–71, November 2001. Erikoisnumero: elektroniikan suunnittelu (ES).
Info
See www.prosessori.fi ...
61Marko Mäkelä and Kimmo Varpaaniemi. lsts2pn — a translator from TVT LSTS files to the input file language of MaRiA. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, September 2001. Software.
Info
See www.tcs.hut.fi ...
60Keijo Heljanko and Ilkka Niemelä. Bounded LTL model checking with stable models. In Thomas Eiter, Wolfgang Faber, and Mirosaw Truszczynski, editors, Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'2001), volume 2173 of Lecture Notes in Artificial Intelligence, pages 200–212, Vienna, Austria, September 2001. Springer-Verlag.
Info
See www.tcs.hut.fi ...
59Tommi Syrjänen. Omega-restricted logic programs. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 267–279, Vienna, Austria, September 2001. Springer-Verlag.
PostScript (199 kB)
GZipped PostScript (77 kB)
Info
58Tommi Syrjänen and Ilkka Niemelä. The smodels system. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, Vienna, Austria, September 2001. Springer-Verlag.
PostScript (106 kB)
GZipped PostScript (45 kB)
Info
57Tomi Janhunen. On the effect of default negation on the expressiveness of disjunctive rules. In Thomas Eiter, Wolfgang Faber, and Mirek Truszczyński, editors, Logic Programming and Nonmonotonic Reasoning, Proceedings of the 6th International Conference, pages 93–106, Vienna, Austria, September 2001. Springer-Verlag. LNAI 2173.
Info
See www.tcs.hut.fi ...
56Keijo Heljanko. Bounded reachability checking with process semantics. In Kim Guldstrand Larsen and Mogens Nielsen, editors, Proceedings of the 12th International Conference on Concurrency Theory (Concur'2001), volume 2154 of Lecture Notes in Computer Science, pages 218–232, Aalborg, Denmark, August 2001. Springer-Verlag.
Info
See www.tcs.hut.fi ...
55Tommi Syrjänen. Version spaces and rule-based configuration management. In Working Notes of the IJCAI 2001 Workshop on Configuration, August 2001.
PostScript (122 kB)
GZipped PostScript (45 kB)
Info
54Kimmo Varpaaniemi, editor. Annual report for the year 2000. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, July 2001.
PostScript (623 kB)
GZipped PostScript (249 kB)
PDF (353 kB)
Info
53Marko Mäkelä. A reachability analyser for algebraic system nets. Research Report A69, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2001.
PostScript (1 MB)
GZipped PostScript (471 kB)
PDF (867 kB)
Info
52Eero Lassila. A tree expansion formalism for generative string rewriting. Technical Report B20, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2001.
PostScript (3 MB)
GZipped PostScript (1 MB)
PDF (656 kB)
Info
51Marko 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, number 2075 in Lecture Notes in Computer Science, pages 283–302, Newcastle upon Tyne, UK, June 2001. Springer-Verlag, Berlin, Germany.
Errata 
Info
See link.springer.de ...
50Keijo Heljanko, Victor Khomenko, and Maciej Koutny. Parallelisation of the Petri net unfolding algorithm. Technical Report CS-TR-733, Department of Computer Science, University of Newcastle upon Tyne, Newcastle, United Kindom, June 2001.
Info
See www.cs.ncl.ac.uk ...
49Stefan Brass, Jürgen Dix, Ilkka Niemelä, and T.C. Przymusinski. On the equivalence of the static and disjunctive well-founded semantics and its computation. Theoretical Computer Science, 258(1–2):523–553, May 2001.
Info
48Javier Esparza and Keijo Heljanko. Implementing LTL model checking with net unfoldings. In Matthew B. Dwyer, editor, Proceedings of the 8th International SPIN Workshop on Model Checking of Software (SPIN'2001), volume 2057 of Lecture Notes in Computer Science, pages 37–56, Toronto, Canada, May 2001. Springer-Verlag.
Info
See www.tcs.hut.fi ...
47Tomi Janhunen. On the effect of default negation on the expressiveness of disjunctive rules. In Gerhard Brewka, Cees Witteween, and Torsten Schaub, editors, Working Notes of the 5th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications, pages 102–113, Potsdam, Germany, April 2001.
Info
46Javier Esparza and Keijo Heljanko. Implementing LTL model checking with net unfoldings. Research Report A68, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2001.
PostScript (666 kB)
GZipped PostScript (270 kB)
PDF (457 kB)
Info
45Keijo Heljanko and Ilkka Niemelä. Answer set programming and bounded model checking. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pages 90–96, Stanford, USA, March 2001. AAAI Press.
Info
44Timo Soininen, Ilkka Niemelä, Juha Tiihonen, and Reijo Sulonen. Representing configuration knowledge with weight constraint rules. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming, pages 195–201, Stanford, USA, March 2001. AAAI Press.
Info
43Catharina Candolin, Janne Lundberg, and Hannu Kari. Authorization and privacy protection in organizational ad hoc networks. In Proceedings of the 3rd Nordic Usenix Conference, Stockholm, Sweden, February 2001.
Info
42Pekka Nikander, Janne Lundberg, Catharina Candolin, and Tuomas Aura. Homeless mobile ipv6. Technical report, Internet Engineering Task Force, February 2001. Internet Draft, work in progress.
Info
41Lasse Anderson, Johannes Helander, Keijo Heljanko, Tomi Janhunen, Robert Jürgens, Ismo Kangas, Kari J. Nurmela, Kenneth Oksanen, Olavi Pesonen, Marko Rauhamaa, James Reilly, Heikki Suonsivu, Kimmo Valkealahti, Kimmo Varpaaniemi, and Pauli Väisänen. PROD 3.3.09 — an advanced tool for efficient reachability analysis. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, February 2001. Software.
Info
See www.tcs.hut.fi ...
40Timo Latvala. Model checking linear temporal logic properties of Petri nets with fairness constraints. Research Report A67, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, January 2001.
NOTE: Reprint of Master's thesis; see URL below.
PostScript (694 kB)
GZipped PostScript (297 kB)
PDF (548 kB)
Info
See www.tcs.hut.fi ...
39Toni Jussila. Bounded Model Checking for Verifying Concurrent Programs. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001.
Info
See www.tcs.hut.fi ...
38Maarit Hietalahti. Efficient key agreement for ad-hoc networks. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001.
Info
37Jari Katajavuori. An architecture for dynamic software upgrading over-the-air in mobile systems. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001.
Info
36Petteri Kaski. Isomorph-free exhaustive generation of combinatorial designs. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001.
Info
See www.tcs.hut.fi ...
35Harri Kuusisto. Käyttäjän sähköinen tunnistaminen ja yksityisyys. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, 2001.
Info
34Rauni Pääkkönen. Implementing a formal agent description language. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001.
Info
33Veera Lehtonen. Implementation of a robust electronic voting system. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001.
Info
32Viktor Rosendahl. A customized very long intruction word processor for Viterbi decoding. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2001.
Info
31Janne Olavi Salmi. An adaptive mobility management mechanism for ip networks using ad hoc routing. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, 2001.
Info
30Kjell Sand. Development of unit and module testing in embedded systems. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001.
Info
29Sami Olavi Virtanen. Effective long code generation in WCDMA. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2001.
Info
28Galina T. Bogdanova, Andries E. Brouwer, Stoian N. Kapralov, and Patric R.J. Östergård. Error-correcting codes over an alphabet of four elements. Designs, Codes and Cryptography, 23(3):333–342, 2001.
Info
27Galina T. Bogdanova and Patric R.J. Östergård. Bounds on codes over an alphabet of five elements. Discrete Mathematics, 240(1–3):13–19, 2001.
Info
See www.elsevier.nl ...
26Alexander A. Davydov and Patric R.J. Östergård. Linear codes with covering radius and codimension . IEEE Transactions on Information Theory, 47(1):416–421, 2001.
Info
See ieeexplore.ieee.org ...
25Alexander A. Davydov and Patric R.J. Östergård. Recursive constructions of complete caps. Journal of Statistical Planning and Inference, 95(1–2):167–173, 2001.
Info
See www.elsevier.nl ...
24T. Aaron Gulliver and Patric R.J. Östergård. Improved bounds for ternary linear codes of dimension 8 using tabu search. Journal of Heuristics, 7(1):37–46, 2001.
Info
23Patric R.J. Östergård. A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing, 8(4):424–436, 2001.
Info
22Patric R.J. Östergård. There are 270,474,142 nonisomorphic 2-(9,4,6) designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 37(1):173–176, 2001.
Info
21Patric R.J. Östergård and Uri Blass. On the size of optimal binary codes of length 9 and covering radius 1. IEEE Transactions on Information Theory, 47(6):2556–2557, 2001.
Info
See ieeexplore.ieee.org ...
20Patric R.J. Östergård and William D. Weakley. Values of domination numbers of the queen's graph. The Electronic Journal of Combinatorics, 8(1), 2001.
Info
See www.combinatorics.org ...
19Tuomas Aura, Pekka Nikander, and Jussipekka Leiwo. DOS-resistant authentication with client puzzles. In B. Christianson, B. Crispo, J.A. Malcolm, and M. Roe, editors, Security Protocols, 8th International Workshop Cambridge, UK, April 2000, Revised Papers, volume 2133 of Lecture Notes in Computer Science, pages 170–177. Springer-Verlag, Berlin, Germany, 2001.
Info
See link.springer.de ...
18Tuomas Aura. DOS-resistant authentication with client puzzles (transcript of discussion). In B. Christianson, B. Crispo, J.A. Malcolm, and M. Roe, editors, Security Protocols, 8th International Workshop Cambridge, UK, April 2000, Revised Papers, volume 2133 of Lecture Notes in Computer Science, pages 178–181. Springer-Verlag, Berlin, Germany, 2001.
Info
See link.springer.de ...
17Marko Mäkelä. lsts2dot—a translator from TVT LSTS files to the input file language of GraphViz. on the World Wide Web, 2001. computer program.
Info
See www.tcs.hut.fi ...
16Kimmo Varpaaniemi. Minimizing the number of successor states in the stubborn set method. In Ludwik Czaja, editor, Concurrency, Specification and Programming: Proceedings of the CS&P'2001 Workshop, Warsaw, Poland, 3–5 October 2001, pages 279–290. Zakład Graficzny UW, zam. 583/2001, Warsaw, Poland, 2001.
Info
15Jürgen Dix, Ulrich Furbach, and Ilkka Niemelä. Nonmonotonic reasoning: Towards efficient calculi and implementations. In Andrei Voronkov and Alan Robinson, editors, Handbook of Automated Reasoning, chapter 19, pages 1241–1354. Elsevier Science, Amsterdam, 2001.
Info
14Keijo Heljanko. punroll 0.3: a bounded reachability checker. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software.
Info
See www.tcs.hut.fi ...
13Keijo Heljanko and Patrik Simons. boundsmodels 0.9: a bounded LTL model checker. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software.
Info
See www.tcs.hut.fi ...
12Keijo Heljanko and Patrik Simons. unfsmodels 0.9: a LTL model checker using net unfoldings. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software.
Info
See www.tcs.hut.fi ...
11Leo Ojala, Teemu Tynjälä, and Harriet Beaver. Modeling Serial Quantum Processors Using High-Level Petri Nets. In Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics - SCI'2001, 2001.
Info
10Leo Ojala, Elina Parviainen, Olli-Matti Penttinen, Teemu Tynjälä, and Harriet Beaver. Modeling Feynman's Quantum Computer Using Stochastic High-Level Petri Nets. In Proceedings of 2001 IEEE International Conference on Systems, Man & Cybernetics (CD-ROM), pages 2735–2741, 2001.
Info
9Jiří Šíma and Pekka Orponen. Computing with continuous-time Liapunov systems. In J. S. Vitter, P. Spirakis, and M. Yannakakis, editors, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC'01, Crete, July 2001), pages 722–731, New York NY, 2001. Association for Computing Machinery.
Info
See doi.acm.org ...
8Jiří Šíma and Pekka Orponen. Exponential transients in continuous-time symmetric Hopfield nets. In G. Dorffner, H. Bischof, and K. Hornik, editors, Proceedings of Artificial Neural Networks – ICANN 2001 (Vienna, August 2001), volume 2130 of Lecture Notes in Computer Science, pages 806–813, Berlin Heidelberg, 2001. Springer-Verlag.
Info
See link.springer.de ...
7Petteri Kaski and Patric R. J. Östergård. There exists no (15,5,4) RBIBD. Journal of Combinatorial Designs, 9(5):357–362, 2001.
Info
See dx.doi.org ...
6Timo Latvala. Model checking LTL properties of high-level petri nets with fairness constraints. In J-M. Colom and M. Koutny, editors, Application and Theory of Petri Nets, pages 242–262, Berlin, 2001. Springer. [Copyright © Springer-Verlag]
Info
See link.springer.de ...
5Leo Ojala, Teemu Tynjälä, and Harriet Beaver. Modelling Serial Quantum Processors Using Petri Nets. In World Multiconference on Systemics, Cybernetics and Informatics SCI 2001, volume 14, 2001.
Info
4Leo Ojala, Elina Parviainen, Olli-Matti Penttinen, Harriet Beaver, and Teemu Tynjälä. Modelling Feynman's Quantum Computer Using Stochastic High Level Petri Nets. In Systems, Man and Cybernetics (SMC 2001), 2001. This article appears only in the CD-ROM version of the proceedings.
Info
3Leo Ojala, Nisse Husberg, and Teemu Tynjälä. Modelling and Analysing a Distributed Dynamic Channel Allocation Algorithm for Mobile Computing Using High-Level Net Methods. Software Tools for Technology Transfer, 3, 2001.
Info
2Tommi A. Junttila. Computational complexity of the Place/Transition-net symmetry reduction method. Journal of Universal Computer Science, 7(4):307–326, 2001.
Info
See www.jucs.org ...
1Tommi Junttila. BCSat 0.3 - a satisfiability checker for boolean circuits. Computer program, 2001.
Info
See www.tcs.hut.fi ...

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.