2007 |
|
108 | Henrik Petander. A network mobility management architecture for a heterogeneous network environment. Research Report A108, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007. Doctoral dissertation. ISBN 978-951-22-9098-7. |
|
|
107 | Matti Järvisalo. Impact of restricted branching on clause learning SAT solving. Research Report A107, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2007. ISBN 978-951-22-8907-3. |
|
2006 |
|
106 | Emilia Oikarinen. Modular answer set programming. Research Report A106, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2006. |
|
|
105 | Misa Keinänen. Techniques for solving boolean equation systems. Research Report A105, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2006. Doctoral dissertation. |
|
|
104 | Heikki Tauriainen. Automata and linear temporal logic: Translations with transition-based acceptance. Research Report A104, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2006. Doctoral dissertation. |
|
|
103 | Janne Lundberg. A wireless multicast delivery architecture for mobile terminals. Research Report A103, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, May 2006. Doctoral dissertation. |
|
|
102 | Satu Elisa Schaeffer. Algorithms for nonuniform networks. Research Report A102, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2006. Doctoral dissertation. |
|
|
101 | Jori Dubrovin. Jumbala — an action language for UML state machines. Research Report A101, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2006. |
|
|
100 | Antti E. J. Hyvärinen. SATU: A system for distributed propositional satisfiability checking in computational grids. Research Report A100, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2006. |
|
2005 |
|
99 | Antti Autere. Extensions and applications of the  algorithm. Research Report A98, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2005. Doctoral dissertation. |
|
|
98 | Misa Keinänen. Solving boolean equation systems. Research Report A99, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2005. |
|
|
97 | Toni Jussila. On bounded model checking of asynchronous systems. Research Report A97, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, October 2005. Doctoral dissertation. |
|
|
96 | Heikki Tauriainen. A note on the worst-case memory requirements of generalized nested depth-first search. Research Report A96, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2005. |
|
|
95 | Timo Latvala. Automata-theoretic and bounded model checking for linear temporal logic. Research Report A95, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2005. Doctoral dissertation. |
|
|
94 | Petteri Kaski. Algorithms for classification of combinatorial objects. Research Report A94, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2005. Doctoral dissertation. |
|
2004 |
|
93 | Tuomo Pyhälä. Specification-based test selection in formal conformance testing. Research Report A93, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2004. |
|
|
92 | Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple bounded LTL model checking. Research Report A92, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, July 2004. |
|
|
91 | Mikko Särelä. Measuring the effects of mobility on reactive ad hoc routing protocols. Research Report A91, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, May 2004. |
|
|
90 | Matti Järvisalo. Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking. Research Report A90, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2004. |
|
|
89 | Harri Haanpää and Patric R. J. Östergård. Sets in Abelian groups with distinct sums of pairs. Research Report A87, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2004. |
|
|
88 | Harri Haanpää. Minimum sum and difference covers of Abelian groups. Research Report A88, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2004. |
|
|
87 | Harri Haanpää. Constructing certain combinatorial structures by computational methods. Research Report A89, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2004. Doctoral dissertation. |
|
2003 |
|
86 | Heikki Tauriainen. On translating linear temporal logic into alternating and nondeterministic automata. Research Report A83, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
|
85 | Johan Wallén. On the differential and linear properties of addition. Research Report A84, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
|
84 | Emilia Oikarinen. Testing the equivalence of disjunctive logic programs. Research Report A85, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
|
83 | Tommi Syrjänen. Logic programming with cardinality constraints. Research Report A86, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
|
82 | Marko Mäkelä. Efficient computer-aided verification of parallel and distributed software systems. Research Report A81, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2003. Doctoral dissertation. |
|
|
81 | Tomi Janhunen. Translatability and intranslatability results for certain classes of logic programs. Research Report A82, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2003. |
|
|
80 | Tommi Junttila. On the symmetry reduction method for Petri nets and similar formalisms. Research Report A80, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2003. Doctoral dissertation. |
|
|
79 | Heikki Tauriainen. Nested emptiness search for generalized Büchi automata. Research Report A79, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, July 2003. |
|
|
78 | Petteri Kaski. A census of Steiner triple systems and some related combinatorial objects. Research Report A78, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2003. |
|
|
77 | Satu Virtanen. Properties of nonuniform random graph models. Research Report A77, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, May 2003. |
|
2002 |
|
76 | Timo Latvala. On model checking safety properties. Research Report A76, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2002. |
|
|
75 | Tommi Junttila. New canonical representative marking algorithms for place/transition-nets. Research Report A75, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, October 2002. |
|
|
74 | Sam Sandqvist. Aspects of modelling and simulation of genetic algorithms: A formal approach. Research Report A74, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2002. Doctoral dissertation. |
|
|
73 | Toni Jussila. Bounded model checking for verifying concurrent programs. Research Report A73, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2002. |
|
|
72 | Tommi Junttila. Symmetry reduction algorithms for data symmetries. Research Report A72, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, May 2002. |
|
|
71 | Keijo Heljanko. Combining symbolic and partial order methods for model checking 1-safe Petri nets. Research Report A71, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2002. Doctoral dissertation. |
|
2001 |
|
70 | Petteri Kaski. Isomorph-free exhaustive generation of combinatorial designs. Research Report A70, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2001. |
|
|
69 | Marko 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. |
|
|
68 | Javier 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. |
|
|
67 | Timo 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. |
|
2000 |
|
66 | 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. |
|
|
65 | 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. |
|
|
64 | 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. |
|
|
63 | 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. |
|
|
62 | 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. |
|
|
61 | 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. |
|
|
60 | 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. |
|
|
59 | 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. |
|
|
58 | 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. |
|
1999 |
|
57 | Tommi Syrjänen. A rule-based formal model for software configuration. Research Report A55, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 1999. |
|
|
56 | Keijo Heljanko. Deadlock and reachability checking with finite complete prefixes. Research Report A56, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, December 1999. |
|
|
55 | Tommi Junttila. Detecting and exploiting data type symmetries of algebraic system nets during reachability analysis. Research Report A57, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, December 1999. |
|
|
54 | Antti Huima. Analysis of cryptographic protocols via symbolic state space enumeration. Research Report A54, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 1999. |
|
1998 |
|
53 | Kimmo Varpaaniemi. On the stubborn set method in reduced state space generation. Research Report A51, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, May 1998. Doctoral dissertation. |
|
|
52 | Ilkka Niemelä and Torsten Schaub (Eds.). Proceedings of the workshop on computational aspects of nonmonotonic reasoning. Research Report A52, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, May 1998. |
|
|
51 | Tomi Janhunen. Non-monotonic systems: A framework for analyzing semantics and structural properties of NMR. Research Report A49, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, March 1998. Doctoral dissertation. |
|
|
50 | Ilkka Niemelä (Ed.). Proceedings of the HeCSE workshop on emerging technologies in distributed systems. Research Report A50, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, March 1998. |
|
|
49 | Stefan Rönn. Semantics of semaphores. Research Report A53, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1998. |
|
1997 |
|
48 | Tuomas Aura. On the structure of delegation networks. Research Report A48, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1997. |
|
|
47 | Patrik Simons. Towards constraint satisfaction through logic programs and the stable model semantics. Research Report A47, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, August 1997. |
|
|
46 | Keijo Heljanko. Model checking the branching time temporal logic CTL. Research Report A45, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, May 1997. |
|
|
45 | Tuomas Aura. Stateless connections. Research Report A46, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, May 1997. |
|
|
44 | Karsten Schmidt. Applying reduction rules to algebraic Petri nets. Research Report A44, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, March 1997. |
|
|
43 | Kari J. Nurmela. Minimum-energy point charge configurations on a circular disk. Research Report A43, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, February 1997. |
|
|
42 | Eero Lassila. Towards optimizing code generation by domain-sensitive macro expansion. Research Report A42, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, January 1997. |
|
1996 |
|
41 | Jussi Rintanen. Lexicographic ordering as a basis of priorities in default reasoning. Research Report A41, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1996. Doctoral dissertation. |
|
|
40 | Tino Pyssysalo, Leo Ojala, and Olli-Matti Penttinen. Performance analysis of a video on demand systems using stochastic Petri nets, a case study. Research Report A40, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1996. |
|
|
39 | Tuomas Aura. Time processes of time Petri nets. Research Report A38, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1996. |
|
|
38 | Karsten Schmidt. How to calculate symbolically siphons and traps for some algebraic Petri nets. Research Report A39, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1996. |
|
|
37 | Tino Pyssysalo. An induction theorem for ring protocols of processes described with predicate/transition nets. Research Report A37, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, April 1996. |
|
1995 |
|
36 | Tino Pyssysalo and Leo Ojala. A high-level net model of a video on demand system. Research Report A36, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, December 1995. |
|
|
35 | Patrik Simons. Efficient implementation of the stable model semantics for normal logic programs. Research Report A35, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, September 1995. |
|
|
34 | Johan Lilius. On the structure of high-level nets. Research Report A33, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, March 1995. Doctoral dissertation. |
|
|
33 | Jari Juopperi. PrT-net based analysis of information flow security nets. Research Report A34, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, March 1995. |
|
|
32 | Kari J. Nurmela. Constructing spherical codes by global optimization methods. Research Report A32, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, February 1995. |
|
1994 |
|
31 | Tomi Janhunen. Investigations on cautious autoepistemic reasoning. Research Report A31, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1994. |
|
|
30 | Johan Lilius. On the folding of algebraic nets. Research Report A30, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1994. |
|
|
29 | Tino Pyssysalo. The modelling and analysis of a high speed data bus with predicate/transition nets. Research Report A29, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, March 1994. |
|
1993 |
|
28 | Jussi Rintanen. Priorities and nonmonotonic reasoning. Research Report A28, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1993. |
|
|
27 | Kari J. Nurmela. Constructing combinatorial designs by local search. Research Report A27, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1993. |
|
|
26 | Kimmo Varpaaniemi. Efficient detection of deadlocks in Petri nets. Research Report A26, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, October 1993. |
|
|
25 | Patric R. J. Östergård. Construction methods for covering codes. Research Report A25, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, September 1993. Doctoral dissertation. |
|
|
24 | Ilkka Niemelä. Autoepistemic logic as a unified basis for nonmonotonic reasoning. Research Report A24, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, August 1993. Doctoral dissertation. |
|
|
23 | Johan Lilius. A sheaf semantics for Petri nets. Research Report A23, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, June 1993. |
|
|
22 | Patric R. J. Östergård and Heikki O. Hämäläinen. New upper bounds for binary/ternary mixed covering codes. Research Report A22, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, March 1993. |
|
|
21 | Tomi Janhunen. Weakened negative introspection in autoepistemic reasoning. Research Report A21, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, February 1993. |
|
1992 |
|
20 | Nisse Husberg. High level distributed transition systems in categories. Research Report A19, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, November 1992. Doctoral dissertation. |
|
|
19 | Jussi Rintanen. Stratification and tractability in nonmonotonic reasoning. Research Report A20, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1992. |
|
1991 |
|
18 | Kari Bjorn. A failure model of a distributed transaction processing system. Research Report A17, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1991. |
|
|
17 | Patric R. J. Östergård. Constructions of mixed covering codes. Research Report A18, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1991. |
|
|
16 | Abbas Moslemie. Automated interpretation of S-invariants of predicate/transition nets: An application of non-classical logics. Research Report A15, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, October 1991. |
|
|
15 | Johan Lilius. On the compositionality and analysis of algebraic high-level nets. Research Report A16, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, October 1991. |
|
1990 |
|
14 | Marko Rauhamaa. A comparative study of the methods for efficient reachability analysis. Research Report A14, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, September 1990. |
|
|
13 | Andrea Maggiolo-Schettini and Josef Winkowski. A generalization of predicate/transition nets. Research Report A13, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, February 1990. |
|
1989 |
|
12 | Mikko Tiusanen. A survey of fault-tolerant clock synchronization. Research Report A11, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, June 1989. |
|
|
11 | Kaj Johansson. Modelling solutions for agreement problems. Research Report A12, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, June 1989. |
|
|
10 | Nisse Husberg. A category of distributed transition systems. Research Report A10, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, May 1989. |
|
1988 |
|
9 | Tapio Halkola, Kaj Johansson, and Leo Ojala. Net theoretical methods in modelling byzantine consensus protocols in agreement problems. Research Report A9, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, December 1988. |
|
|
8 | Kaj Johansson. Modelling message protocols for the byzantine generals problem. Research Report A8, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1988. |
|
|
7 | Petri Krohn and Marko Rauhamaa. Reduction transformations of PrT-nets. Research Report A7, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, October 1988. |
|
|
6 | Abbas Moslemie. Towards automatic interpretation of S-invariants of predicate/transition nets. Research Report A6, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1988. |
|
|
5 | Heikki Tuominen. Logic in Petri net analysis. Research Report A5, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, January 1988. |
|
1987 |
|
4 | Mikko Tiusanen. Specification of a net description language compiler. Research Report A4, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1987. |
|
|
3 | Esa Montonen, Leo Ojala, and Timo Tuuliniemi. A PrT-net representation of graph grammars. Research Report A3, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, October 1987. |
|
|
2 | Viktor I. Varshavsky. Hardware support of parallel asynchronous processes. Research Report A2, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, September 1987. |
|
|
1 | Tapio Halkola, Kaj Johansson, and Leo Ojala. Modelling orel message solution protocols for agreement problems in fault-tolerant distributed systems using predicate/transition nets. Research Report A1, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1987. |
|
