Bild mit Unilogo
homeicon university sucheicon search siteicon sitemap kontakticon contact impressicon legal notice
unilogo University of Stuttgart 
Institute of Formal Methods in Computer Science

SZS - Publications in 2001

 

Tero Harju and Dirk Nowotka. Density of critical factorizations. TUCS Tech. Rep. 435, Turku Centre of Computer Science, Finland, December 2001.
GZipped PostScript (99 kB)
PDF (149 kB)
Info
Journal version
Tero Harju and Dirk Nowotka. On the independence of equations in three variables. TUCS Tech. Rep. 432, Turku Centre of Computer Science, Finland, November 2001.
GZipped PostScript (148 kB)
PDF (236 kB)
Info
Journal version
Javier Esparza, Antonín Kučera, and Stefan Schwoon. Model-checking LTL with regular valuations for pushdown systems. In Naoki Kobayashi and Benjamin C. Pierce, editors, Proceedings of TACS 2001, volume 2215 of Lecture Notes in Computer Science, pages 306–339. Springer, October 2001.
GZipped PostScript (154 kB)
Info
Tech report version, Journal version
Javier Esparza, Antonín Kučera, and Stefan Schwoon. Model-checking LTL with regular valuations for pushdown systems. Informatics Research Report EDI-INF-RR-0044, University of Edinburgh, School of Informatics, August 2001.
PDF (224 kB)
Info
Conference version, Journal version
Javier Esparza and Stefan Schwoon. A BDD-based model checker for recursive programs. In Gérard Berry, Hubert Comon, and Alain Finkel, editors, Proceedings of CAV 2001, volume 2102 of Lecture Notes in Computer Science, pages 324–336. Springer, July 2001.
GZipped PostScript (61 kB)
Info
See www.fmi.uni-stuttgart.de ...
Markus Holzer and Stefan Schwoon. Assembling molecules in Atomix is hard. Technical Report TUM-I0101, Technische Universität München, May 2001.
GZipped PostScript (75 kB)
Info
Journal version
J. Esparza and K. Heljanko. Implementing LTL model checking with net unfoldings. Research Report A68, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2001.
GZipped PostScript (271 kB)
PDF (281 kB)
Info
Conference version
J. Esparza and C. Schröter. Unfolding based algorithms for the reachability problem. Fundamenta Informaticae, 47(3–4):231–245, 2001.
GZipped PostScript (150 kB)
PDF (177 kB)
Info
J. Esparza and C. Schröter. Net reductions for LTL model-checking. In Proc. of 11th CHARME, volume 2144 of Lecture Notes in Computer Science, pages 310–324, Livingston, Scotland, 2001.
GZipped PostScript (177 kB)
PDF (164 kB)
Info
Kozura V.E. Unfoldings of coloured petri nets. In Proc. of Ershov Memorial Conference 2001, pages 268–278. Springer, 2001. LNCS 2244.
Info
Kozura V.E. Unfoldings of timed coloured petri nets. In Proc. of the CS&P'2001 Workshop, Warsaw 3-5 Oktober 2001, pages 128–139, 2001.
Info