- Series editor:
- Professor Ilkka Niemelä
- Editorial assistant:
- mrs Ulla Kangasniemi
- ReportA14
- Marko Rauhamaa,
A comparative study of the methods for
efficient reachability analysis,
September 1990.
- ReportA16
- Johan Lilius,
On the compositionality and analysis of
algebraic high-level nets,
October 1991.
- ReportA18
- Patric R. J. Östergård,
Constructions of mixed covering
codes,
December 1991.
- ReportA20
- Jussi Rintanen,
Stratification and tractability in
nonmonotonic reasoning,
November 1992.
- ReportA21
- Tomi Janhunen,
Weakened negative introspection in
autoepistemic reasoning,
February 1993.
- ReportA22
- Patric R. J. Östergård and Heikki O. Hämäläinen,
New upper bounds for binary/ternary mixed
covering codes,
March 1993.
- ReportA23
- Johan Lilius,
A sheaf semantics for Petri nets,
June 1993.
- ReportA24
- Ilkka Niemelä,
Autoepistemic logic as a unified basis for
nonmonotonic reasoning,
August 1994.
- ReportA25
- Patric R. J. Östergård,
Construction methods for covering
codes,
September 1993.
- ReportA26
- Kimmo Varpaaniemi,
Efficient detection of deadlocks in Petri
nets,
October 1993.
- ReportA27
- Kari J. Nurmela,
Constructing combinatorial designs by local
search,
November 1993.
- ReportA28
- Jussi Rintanen,
Priorities and nonmonotonic
reasoning,
December 1993.
- ReportA29
- Tino Pyssysalo,
The modelling and analysis of a high speed
data bus with predicate/transition nets,
March 1994.
- ReportA30
- Johan Lilius,
On the folding of algebraic nets,
August 1994.
- ReportA31
- Tomi Janhunen,
Investigations on cautious autoepistemic
reasoning,
December 1994.
- ReportA32
- Kari J. Nurmela,
Constructing spherical codes by global
optimization methods,
February 1995.
- ReportA33
- Johan Lilius,
On the structure of high-level nets,
March 1995.
- ReportA34
- Jari Juopperi,
PrT-net based analysis of information flow
security nets,
March 1995.
- ReportA35
- Patrik Simons,
Efficient implementation of the stable model
semantics for normal logic programs,
September 1995.
- ReportA38
- Tuomas Aura,
Time processes of time Petri nets,
August 1996.
- ReportA39
- Karsten Schmidt,
How to calculate symbolically siphons and
traps for some algebraic petri nets,
August 1996.
- ReportA41
- Jussi Rintanen,
Lexicographic ordering as a basis of
priorities in default reasoning,
December 1996.
- ReportA42
- Eero Lassila,
Towards optimizing code generation by
domain-sensitive macro expansion,
January 1997.
- ReportA43
- Kari J. Nurmela,
Minimum-energy point charge configurations on
a circular disk,
February 1997.
- ReportA44
- Karsten Schmidt,
Applying reduction rules to algebraic petri
nets,
March 1997.
- ReportA45
- Keijo Heljanko,
Model checking the branching time temporal
logic ctl,
May 1997.
- ReportA46
- Tuomas Aura,
Stateless connections,
May 1997.
- ReportA47
- Patrik Simons,
Towards constraint satisfaction through logic
programs and the stable model semantics,
August 1997.
- ReportA48
- Tuomas Aura,
On the structure of delegation
networks,
December 1997.
- ReportA49
- Tomi Janhunen,
Non-monotonic systems: A framework for
analyzing semantics and structural properties of NMR,
March 1998.
- ReportA50
- Ilkka Niemelä (Ed.),
Proceedings of the HeCSE workshop on emerging
technologies in distributed systems,
March 1998.
- ReportA51
- Kimmo Varpaaniemi,
On the stubborn set method in reduced state
space generation,
May 1998.
- ReportA52
- Ilkka Niemelä and Torsten Schaub (Eds.),
Proceedings of the workshop on computational
aspects of nonmonotonic reasoning,
May 1998.
- ReportA53
- Stefan Rönn,
Semantics of semaphores,
1998.
- ReportA54
- Antti Huima,
Analysis of cryptographic protocols via
symbolic state space enumeration,
August 1999.
- ReportA55
- Tommi Syrjänen,
A rule-based formal model for software
configuration,
December 1999.
- ReportA56
- Keijo Heljanko,
Deadlock and reachability checking with finite
complete prefixes,
December 1999.
- ReportA57
- Tommi Junttila,
Detecting and exploiting data type symmetries
of ...,
December 1999.
- ReportA58
- Patrik Simons,
Extending and implementing the stable model
semantics,
April 2000.
- ReportA59
- Tommi Junttila,
Computational complexity of the
place/transition-net symmetry reduction method,
April 2000.
- ReportA60
- Javier Esparza and Keijo Heljanko,
A new unfolding approach to LTL model
checking,
April 2000.
- ReportA61
- Tuomas Aura and Carl Ellison,
Privacy and accountability in certificate
systems,
April 2000.
- ReportA62
- Kari J. Nurmela and Patric R. J. Östergård,
Covering a square with up to 30 equal
circles,
June 2000.
- ReportA63
- Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä (Eds.),
Leksa notes in computer science,
October 2000.
- ReportA64
- Tuomas Aura,
Authorization and Availability - Aspects of Open Network Security,
November 2000.
- ReportA65
- Harri Haanpää,
Computational Methods for Ramsey Numbers,
November 2000.
- ReportA66
- Heikki Tauriainen,
Automated Testing of Büchi Automata Translators for Linear Temporal Logic,
December 2000.
- ReportA67
- Timo Latvala,
Model Checking Linear Temporal Logic Properties of Petri Nets with Fairness Constraints,
January 2001.
- ReportA68
- Javier Esparza and Keijo Heljanko,
Implementing {LTL} Model Checking with Net Unfoldings,
March 2001.
- ReportA69
- Marko Mäkelä,
A Reachability Analyser for Algebraic System Nets,
June 2001.
- ReportA70
- Petteri Kaski,
Isomorph-Free Exhaustive Generation of Combinatorial Designs,
December 2001.
- ReportA71
- Keijo Heljanko,
Combining Symbolic and Partial Order Methods for Model Checking 1-Safe Petri Nets,
February 2002.
- ReportB10
- Kari J. Nurmela and Patric R. J. Östergård,
Constructing covering designs by simulated
annealing,
January 1993.
- ReportB12
- Kimmo Varpaaniemi,
On computing symmetries and stubborn
sets,
April 1994.
- ReportB13
- Kimmo Varpaaniemi, Jaakko Halme, Kari Hiekkanen, and Tino Pyssysalo,
PROD reference manual,
August 1995.
- ReportB14
- Tuomas Aura,
Modelling the Needham-Schröder authentication
protocol with high level Petri nets,
September 1995.
- ReportB15
- Eero Lassila,
ReFlEx --- an experimental tool for
special-purpose processor code generation,
March 1996.
- ReportB18
- Tommi Syrjänen,
Implementation of local grounding for logic
programs with stable model semantics,
October 1998.
- ReportB19
- Marko Mäkelä, Jani Lahtinen, and Leo Ojala,
Performance analysis of a traffic control
system using stochastic petri nets,
December 1998.
- ReportB20
- Eero Lassila,
A tree expansion formalism for
generative string rewriting,
June 2001.
Ilkka Niemelä,
Annual Report for the Year 1993,
May 1994.
Ilkka Niemelä,
Annual Report for the Year 1994,
May 1995.
Kimmo Varpaaniemi (Ed.),
Annual Report for the Year 2000,
July 2001.
(pdf with hyperlinks,
ps)
Kimmo Varpaaniemi (Ed.),
Annual Report for the Year 2001,
April 2002.
(pdf with hyperlinks,
ps)
Prices and other information about obtaining printed versions of
these reports are available on request (email: techreports@tcs.hut.fi.)
Authors: see the instructions
for preparing the PostScript versions of reports.
BibTeX files for the reports are available as
reportsA.bib and as
reportsB.bib.