 <DT>ReportA14</DT>
 <DD>Marko Rauhamaa,
  <A HREF="A14abstract.html"><EM>A comparative study of the methods for
  efficient reachability analysis</EM></A>,
  September 1990.</DD>

 <DT>ReportA16</DT>
 <DD>Johan Lilius,
  <A HREF="A16abstract.html"><EM>On the compositionality and analysis of
  algebraic high-level nets</EM></A>,
  October 1991.</DD>

 <DT>ReportA18</DT>
 <DD>Patric R. J. Östergård,
  <A HREF="A18abstract.html"><EM>Constructions of mixed covering
  codes</EM></A>,
  December 1991.</DD>

 <DT>ReportA20</DT>
 <DD>Jussi Rintanen,
  <A HREF="A20abstract.html"><EM>Stratification and tractability in
  nonmonotonic reasoning</EM></A>,
  November 1992.</DD>

 <DT>ReportA21</DT>
 <DD>Tomi Janhunen,
  <A HREF="A21abstract.html"><EM>Weakened negative introspection in
  autoepistemic reasoning</EM></A>,
  February 1993.</DD>

 <DT>ReportA22</DT>
 <DD>Patric R. J. Östergård and Heikki O. Hämäläinen,
  <A HREF="A22abstract.html"><EM>New upper bounds for binary/ternary mixed
  covering codes</EM></A>,
  March 1993.</DD>

 <DT>ReportA23</DT>
 <DD>Johan Lilius,
  <A HREF="A23abstract.html"><EM>A sheaf semantics for Petri nets</EM></A>,
  June 1993.</DD>

 <DT>ReportA24</DT>
 <DD>Ilkka Niemelä,
  <A HREF="A24abstract.html"><EM>Autoepistemic logic as a unified basis for
  nonmonotonic reasoning</EM></A>,
  August 1994.</DD>

 <DT>ReportA25</DT>
 <DD>Patric R. J. Östergård,
  <A HREF="A25abstract.html"><EM>Construction methods for covering
  codes</EM></A>,
  September 1993.</DD>

 <DT>ReportA26</DT>
 <DD>Kimmo Varpaaniemi,
  <A HREF="A26abstract.html"><EM>Efficient detection of deadlocks in Petri
  nets</EM></A>,
  October 1993.</DD>

 <DT>ReportA27</DT>
 <DD>Kari J. Nurmela,
  <A HREF="A27abstract.html"><EM>Constructing combinatorial designs by local
  search</EM></A>,
  November 1993.</DD>

 <DT>ReportA28</DT>
 <DD>Jussi Rintanen,
  <A HREF="A28abstract.html"><EM>Priorities and nonmonotonic
  reasoning</EM></A>,
  December 1993.</DD>

 <DT>ReportA29</DT>
 <DD>Tino Pyssysalo,
  <A HREF="A29abstract.html"><EM>The modelling and analysis of a high speed
  data bus with predicate/transition nets</EM></A>,
  March 1994.</DD>

 <DT>ReportA30</DT>
 <DD>Johan Lilius,
  <A HREF="A30abstract.html"><EM>On the folding of algebraic nets</EM></A>,
  August 1994.</DD>

 <DT>ReportA31</DT>
 <DD>Tomi Janhunen,
  <A HREF="A31abstract.html"><EM>Investigations on cautious autoepistemic
  reasoning</EM></A>,
  December 1994.</DD>

 <DT>ReportA32</DT>
 <DD>Kari J. Nurmela,
  <A HREF="A32abstract.html"><EM>Constructing spherical codes by global
  optimization methods</EM></A>,
  February 1995.</DD>

 <DT>ReportA33</DT>
 <DD>Johan Lilius,
  <A HREF="A33abstract.html"><EM>On the structure of high-level nets</EM></A>,
  March 1995.</DD>

 <DT>ReportA34</DT>
 <DD>Jari Juopperi,
  <A HREF="A34abstract.html"><EM>PrT-net based analysis of information flow
  security nets</EM></A>,
  March 1995.</DD>

 <DT>ReportA35</DT>
 <DD>Patrik Simons,
  <A HREF="A35abstract.html"><EM>Efficient implementation of the stable model
  semantics for normal logic programs</EM></A>,
  September 1995.</DD>

 <DT>ReportA38</DT>
 <DD>Tuomas Aura,
  <A HREF="A38abstract.html"><EM>Time processes of time Petri nets</EM></A>,
  August 1996.</DD>

 <DT>ReportA39</DT>
 <DD>Karsten Schmidt,
  <A HREF="A39abstract.html"><EM>How to calculate symbolically siphons and
  traps for some algebraic petri nets</EM></A>,
  August 1996.</DD>

 <DT>ReportA41</DT>
 <DD>Jussi Rintanen,
  <A HREF="A41abstract.html"><EM>Lexicographic ordering as a basis of
  priorities in default reasoning</EM></A>,
  December 1996.</DD>

 <DT>ReportA42</DT>
 <DD>Eero Lassila,
  <A HREF="A42abstract.html"><EM>Towards optimizing code generation by
  domain-sensitive macro expansion</EM></A>,
  January 1997.</DD>

 <DT>ReportA43</DT>
 <DD>Kari J. Nurmela,
  <A HREF="A43abstract.html"><EM>Minimum-energy point charge configurations on
  a circular disk</EM></A>,
  February 1997.</DD>

 <DT>ReportA44</DT>
 <DD>Karsten Schmidt,
  <A HREF="A44abstract.html"><EM>Applying reduction rules to algebraic petri
  nets</EM></A>,
  March 1997.</DD>

 <DT>ReportA45</DT>
 <DD>Keijo Heljanko,
  <A HREF="A45abstract.html"><EM>Model checking the branching time temporal
  logic ctl</EM></A>,
  May 1997.</DD>

 <DT>ReportA46</DT>
 <DD>Tuomas Aura,
  <A HREF="A46abstract.html"><EM>Stateless connections</EM></A>,
  May 1997.</DD>

 <DT>ReportA47</DT>
 <DD>Patrik Simons,
  <A HREF="A47abstract.html"><EM>Towards constraint satisfaction through logic
  programs and the stable model semantics</EM></A>,
  August 1997.</DD>

 <DT>ReportA48</DT>
 <DD>Tuomas Aura,
  <A HREF="A48abstract.html"><EM>On the structure of delegation
  networks</EM></A>,
  December 1997.</DD>

 <DT>ReportA49</DT>
 <DD>Tomi Janhunen,
  <A HREF="A49abstract.html"><EM>Non-monotonic systems: A framework for
  analyzing semantics and structural properties of NMR</EM></A>,
  March 1998.</DD>

 <DT>ReportA50</DT>
 <DD>Ilkka Niemelä (Ed.),
  <A HREF="A50abstract.html"><EM>Proceedings of the HeCSE workshop on emerging
  technologies in distributed systems</EM></A>,
  March 1998.</DD>

 <DT>ReportA51</DT>
 <DD>Kimmo Varpaaniemi,
  <A HREF="A51abstract.html"><EM>On the stubborn set method in reduced state
  space generation</EM></A>,
  May 1998.</DD>

 <DT>ReportA52</DT>
 <DD>Ilkka Niemelä and Torsten Schaub (Eds.),
  <A HREF="A52abstract.html"><EM>Proceedings of the workshop on computational
  aspects of nonmonotonic reasoning</EM></A>,
  May 1998.</DD>

 <DT>ReportA53</DT>
 <DD>Stefan Rönn,
  <A HREF="A53abstract.html"><EM>Semantics of semaphores</EM></A>,
  1998.</DD>

 <DT>ReportA54</DT>
 <DD>Antti Huima,
  <A HREF="A54abstract.html"><EM>Analysis of cryptographic protocols via
  symbolic state space enumeration</EM></A>,
  August 1999.</DD>

 <DT>ReportA55</DT>
 <DD>Tommi Syrjänen,
  <A HREF="A55abstract.html"><EM>A rule-based formal model for software
  configuration</EM></A>,
  December 1999.</DD>

 <DT>ReportA56</DT>
 <DD>Keijo Heljanko,
  <A HREF="A56abstract.html"><EM>Deadlock and reachability checking with finite
  complete prefixes</EM></A>,
  December 1999.</DD>

 <DT>ReportA57</DT>
 <DD>Tommi Junttila,
  <A HREF="A57abstract.html"><EM>Detecting and exploiting data type symmetries
  of ...</EM></A>,
  December 1999.</DD>

 <DT>ReportA58</DT>
 <DD>Patrik Simons,
  <A HREF="A58abstract.html"><EM>Extending and implementing the stable model
  semantics</EM></A>,
  April 2000.</DD>

 <DT>ReportA59</DT>
 <DD>Tommi Junttila,
  <A HREF="A59abstract.html"><EM>Computational complexity of the
  place/transition-net symmetry reduction method</EM></A>,
  April 2000.</DD>

 <DT>ReportA60</DT>
 <DD>Javier Esparza and Keijo Heljanko,
  <A HREF="A60abstract.html"><EM>A new unfolding approach to LTL model
  checking</EM></A>,
  April 2000.</DD>

 <DT>ReportA61</DT>
 <DD>Tuomas Aura and Carl Ellison,
  <A HREF="A61abstract.html"><EM>Privacy and accountability in certificate
  systems</EM></A>,
  April 2000.</DD>

 <DT>ReportA62</DT>
 <DD>Kari J. Nurmela and Patric R. J. Östergård,
  <A HREF="A62abstract.html"><EM>Covering a square with up to 30 equal
  circles</EM></A>,
  June 2000.</DD>

