|
65 | Heikki Tauriainen. Automated testing of Büchi automata translators for linear temporal logic. Research Report A66, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2000. |
|
|
64 | Tuomas Aura. Authorization and availability - aspects of open network security. Research Report A64, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2000. Doctoral dissertation. |
|
|
63 | Harri Haanpää. Computational methods for Ramsey numbers. Research Report A65, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2000. |
|
|
62 | Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä (Eds.). Leksa notes in computer science. Research Report A63, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, October 2000. |
|
|
61 | Marko Mäkelä. Modular reachability analyser. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala, pages 75–85. Helsinki University of Technology, October 2000. |
|
|
60 | 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, number 140 in Informatik-Bericht, pages 129–142. Humboldt-Universität zu Berlin, Germany, October 2000. |
|
|
59 | Silja Mäki, Tuomas Aura, and Maarit Hietalahti. Robust membership management for ad-hoc groups. In Proc. 5th Nordic Workshop on Secure IT Systems (NORDSEC 2000), Reykjavik, Iceland, October 2000. |
|
|
58 | Kimmo Varpaaniemi. Modelling of a PLC-based railway traffic control system. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala, number HUT-TCS-A63 in HUT-TCS Research Reports, pages 131–140. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, October 2000. |
|
|
57 | Eero Lassila. On tree belts and belt-selectors. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Lexa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala, pages 47–58. Helsinki University of Technology, Laboratory for Theoretical Computer Science, October 2000. |
|
|
56 | Tomi Janhunen. Specifying agent-based systems with nets and logic programs. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala, pages 33–46, Espoo, October 2000. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Research Reports HUT-TCS-A63. |
|
|
55 | Tomi Janhunen. Capturing stationary and regular extensions with Reiter's extensions. In Manuel Ojeda-Aciego et al., editors, Logics in Artificial Intelligence, European Workshop, JELIA 2000, pages 102–117, Málaga, Spain, September/October 2000. Springer-Verlag. LNAI 1919. |
|
|
54 | Marko Mäkelä. Maria: Modular reachability analyzer for high-level Petri nets. In The 5th Workshop on Discrete Event Systems (WODES 2000), pages 477–478, Ghent, Belgium, August 2000. Kluwer Academic Publishers, Boston, MA, USA. |
|
|
53 | Kimmo Varpaaniemi. Stable models for stubborn sets. Fundamenta Informaticae (Annales Societatis Mathematicae Polonae, Series IV), 43(1–4):355–375, August 2000. IOS Press, Amsterdam, The Netherlands. |
|
|
52 | Timo Soininen, Ilkka Niemelä, Juha Tiihonen, and Reijo Sulonen. Unified configuration knowledge representation using weight constraint rules. In Workshop Notes of the ECAI'2000 Configuration Workshop, pages 79–84, Berlin, Germany, August 2000. |
|
|
51 | Keijo Heljanko. Model checking with finite complete prefixes is PSPACE-complete. In Catuscia Palamidessi, editor, Proceedings of the 11th International Conference on Concurrency Theory (Concur'2000), volume 1877 of Lecture Notes in Computer Science, pages 108–122, State College, Pennsylvania, USA, August 2000. Springer-Verlag. |
|
|
50 | Tommi Syrjänen. Optimizing configurations. In Proceedings of the ECAI Workshop W02 on Configuration, pages 85 – 90, Berlin, Germany, August 2000. |
|
|
49 | Javier Esparza and Keijo Heljanko. A new unfolding approach to LTL model checking. In Ugo Montanari, José D. P. Rolim, and Emo Welzl, editors, Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), volume 1853 of Lecture Notes in Computer Science, pages 475–486, Geneva, Switzerland, July 2000. Springer-Verlag. |
|
|
48 | Tommi A. Junttila and Ilkka Niemelä. Towards an efficient tableau method for Boolean circuit satisfiability checking. In John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luís Moniz Pereira, Yehoshua Sagiv, and Peter J. Stuckey, editors, Computational Logic – CL 2000; First International Conference, volume 1861 of Lecture Notes in Artificial Intelligence, pages 553–567, London, UK, July 2000. Springer, Berlin. |
|
|
47 | Tommi Syrjänen. Including diagnostic information in configuration models. In Proceedings of the First International Conference on Computational Logic, London, UK, July 2000. Springer-Verlag. |
|
|
46 | Tomi Janhunen. Comparing the expressive powers of some syntactically restricted classes of logic programs. In John Lloyd et al., editors, Computational Logic, First International Conference, pages 852–866, London, UK, July 2000. Springer-Verlag. LNAI 1861. |
|
|
45 | Kari J. Nurmela and Patric R. J. Östergård. Covering a square with up to 30 equal circles. Research Report A62, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2000. |
|
|
44 | Marko Mäkelä. Condensed storage of multi-set sequences. In Kurt Jensen, editor, Practical Use of High-Level Petri Nets, number 547 in DAIMI report PB, pages 111–125. University of Århus, Denmark, June 2000. |
|
|
43 | Marko Mäkelä. Maria: Modular reachability analyser for high-level Petri nets. In Kjeld Mortensen, editor, Petri Nets 2000: Tool Demonstrations, pages 59–63, Århus, Denmark, June 2000. University of Århus. |
|
|
42 | Patrik Simons. Extending and implementing the stable model semantics. Research Report A58, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. Doctoral dissertation. |
|
|
41 | Tommi Junttila. Computational complexity of the place/transition-net symmetry reduction method. Research Report A59, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. |
|
|
40 | Javier Esparza and Keijo Heljanko. A new unfolding approach to LTL model checking. Research Report A60, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. |
|
|
39 | Tuomas Aura and Carl Ellison. Privacy and accountability in certificate systems. Research Report A61, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. |
|
|
38 | Maarit Hietalahti, Fabio Massacci, and Ilkka Niemelä. DES: a challenge problem for nonmonotonic reasoning systems. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (cs.AI/0003073), Breckenridge, Colorado, USA, April 2000. cs.AI/0003039. |
|
|
37 | Ilkka Niemelä, Patrik Simons, and Tommi Syrjänen. Smodels: a system for answer set programming. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (cs.AI/0003073), Breckenridge, Colorado, USA, April 2000. cs.AI/0003033. |
|
|
36 | Tomi Janhunen, Ilkka Niemelä, Patrik Simons, and Jia-Huai You. Unfolding partiality and disjunctions in stable model semantics. In Anthony Cohn, Fausto Giunchiglia, and Bart Selman, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 7th International Conference, pages 411–419, Breckenridge, Colorado, April 2000. Morgan Kaufmann. |
|
|
35 | Harri Haanpää. Computational Methods for Ramsey Numbers. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2000. |
|
|
34 | Marko Mäkelä. A Reachability Analyzer for Algebraic System Nets. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2000. |
|
|
33 | Mika Jalkanen. Sales statistics process - formal specification and implementation. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2000. |
|
|
32 | Teijo Kuoppala. Junan tiedonsiirtoverkkoon kuuluvien reaaliaikaprotokollien mallintaminen ja analysointi verkkoteoreettisin menetelmin. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2000. |
|
|
31 | Timo Latvala. Model checking linear temporal logic properties of Petri nets with fairness constraints. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2000. |
|
|
30 | Heikki Tauriainen. Automated testing of Büchi automata translators for linear temporal logic. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2000. |
|
|
29 | Tuomas Aura and Johan Lilius. A causal semantics for time petri nets. Theoretical Computer Science, 243(1–2):409–447, 2000. |
|
|
28 | Alexander Davydov and Patric R.J. Östergård. New quaternary linear codes with covering radius 2. Finite Fields and Their Applications, 6(2):164–174, 2000. |
|
|
27 | Alexander Davydov and Patric R.J. Östergård. On saturating sets in small projective geometries. European Journal of Combinatorics, 21(5):563–570, 2000. |
|
|
26 | T. Aaron Gulliver and Patric R.J. Östergård. New binary linear codes. Ars Combinatoria, 56(1):105–112, 2000. |
|
|
25 | Filip Karlemo and Patric R.J. Östergård. On sliding block puzzles. Journal of Combinatorial Mathematics and Combinatorial Computing, 34(1):97–107, 2000. |
|
|
24 | Kari J. Nurmela. Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles. Experimental Mathematics, 9(1):241–250, 2000. |
|
|
23 | Patric R.J. Östergård. Classification of binary/ternary one-error correcting codes. Discrete Mathematics, 223(1–3):253–262, 2000. |
|
|
22 | Patric R.J. Östergård. Enumeration of  designs. The Australasian Journal of Combinatorics, 22(1):227–231, 2000. |
|
|
21 | Patric R.J. Östergård. Computer search for small complete caps. Journal of Geometry, 69(1–2):172–179, 2000. |
|
|
20 | Patric R.J. Östergård and William D. Weakley. Classification of binary covering codes. Journal of Combinatorial Designs, 8(6):391–401, 2000. |
|
|
19 | Nisse Husberg. 30 years: From digital filters to high level petri nets. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science, Festschrift in Honour of Professor Leo Ojala, pages 21–31. Helsinki University of Technology, 2000. |
|
|
18 | Tuomas Aura Matt Bishop and Dean Sniegowski. Analyzing single-server network inhibition. In Proceedings of the 2000 IEEE Computer Security Foundations Workshop, pages 108–117. IEEE Computer Society Press, Los Alamitos CA, USA, 2000. |
|
|
17 | John R. Hughes, Tuomas Aura, and Matt Bishop. Using conservation of flow as a security mechanism in network protocols. In Proceedings of the 2000 IEEE Symposium on Security and Privacy, pages 132–141. IEEE Computer Society Press, Los Alamitos CA, USA, 2000. |
|
|
16 | Jussipekka Leiwo, Pekka Nikander, and Tuomas Aura. Towards network denial of service resistant protocols. In S. Qing and J.H.P. Eloff, editors, Information Security for Global Information Infrastructures, volume 175 of IFIP Series. Kluwer Academic Publishers, Boston MA, USA, 2000. |
|
|
15 | Marko Mäkelä, Kimmo Varpaaniemi, and Timo Latvala. Maria: The modular reachability analyzer. on the World Wide Web, 2000. computer program. |
|
|
14 | Lasse 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.08 — an advanced tool for efficient reachability analysis. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, 2000. Software. |
|
|
13 | Harri Haanpää. A lower bound for a Ramsey number. Congressus Numerantium, 144:189–191, 2000. |
|
|
12 | Ilkka Niemelä and Patrik Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, chapter 21, pages 491–521. Kluwer Academic Publishers, 2000. |
|
|
11 | Ilkka Niemelä. Stable model semantics: From theory to implementations and applications. Lecture notes for a tutorial given at the First International Conference on Computational Logic, Imperial College, London, UK, July 24–28, 2000. 72 pages., 2000. |
|
|
10 | Ilkka Niemelä and Mirosław Truszczyński. Practical tools for knowledge representation and nonmonotonic reasoning. Lecture notes for a tutorial given at the 17th National Conference on Artificial Intelligence, Austin, Texas, July 30–August 3, 2000. 166 pages. Available at http://www.tcs.hut.fi/ ini/, 2000. |
|
|
9 | Timo Soininen, Ilkka Niemelä, Juha Tiihonen, and Reijo Sulonen. Unified configuration knowledge representation using weight constraint rules. Technical Report TKO-B149, Helsinki University of Technology, Laboratory of Information Processing Science, Helsinki, Finland, 2000. |
|
|
8 | Keijo Heljanko and Ilkka Niemelä. Petri net analysis and nonmonotonic reasoning. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science, Festschrift in Honour of Professor Leo Ojala, pages 7–19. Helsinki University of Technology, Laboratory for Theoretical Computer Science, 2000. |
|
|
7 | Miia Hermelin. Cryptographic properties of the bluetooth combination generator. Master's thesis, Helsinki University of Technology, 2000. |
|
|
6 | Timo Latvala and Keijo Heljanko. Coping with strong fairness. Fundamenta Informaticae, 43(1–4):175–193, 2000. |
|
|
5 | Linfeng Yang, Jouni Karvo, Teemu Tynjälä, and Hannu Kari. Threshold-Based Registration (TBR) in Mobile IPv6. In IFIP-TC/6 European Commission NETWORKING 2000 International Workshop MWCN 2000, 2000. |
|
|
4 | Leo Ojala, Nisse Husberg, and Teemu Tynjälä. Modelling and Analysing a Distributed Dynamic Channel Allocation Algorithm for Mobile Computing Using High-Level Net Methods. In Workshop on Practical Use of High-Level Petri Nets (ICATPN'2000), 2000. |
|
|
3 | Nisse Husberg, Teemu Tynjälä, and Kimmo Varpaaniemi. Modelling and Analysing the SDL Description of the ISDN-DSS1 Protocol. In 21st International Conference on Applications and Theory of Petri Nets, 2000. |
|
|
2 | Teijo Kuoppala, Nisse Husberg, and Teemu Tynjälä. Modelling and Analysis of TCN Standard Message Transport Protocol by Net-Theoretical Methods. In World Multiconference on Systemics, Cybernetics and Informatics SCI 2000, volume 8, 2000. |
|
|
1 | Leo Ojala, Nisse Husberg, and Teemu Tynjälä. Modelling a Distributed Wireless Channel Allocation Algorithm for Cellular Systems with Mobile Base Stations Using Predicate/Transition Nets. In World Multiconference on Systemics, Cybernetics and Informatics SCI 2000, volume 8, 2000. |
|
