Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=256
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Pushdown automata, multiset automata, and Petri nets
Yoram Hirsheld
,
Faron Moller
Theoretical Computer Science
256
(1-2), 2001, pp. 3-21
Nonprimitive recursive complexity and undecidability for Petri net equivalences
Petr Janc̑ar
Theoretical Computer Science
256
(1-2), 2001, pp. 23-30
Decidability of model checking with the temporal logic EF
Richard Mayr
Theoretical Computer Science
256
(1-2), 2001, pp. 31-62
Well-structured transition systems everywhere!
A. Finkel
,
Ph. Schnoebelen
Theoretical Computer Science
256
(1-2), 2001, pp. 63-92
Symbolic model checking with rich assertional languages
Y. Kesten
,
O. Maler
,
M. Marcus
,
A. Pnueli
,
E. Shahar
Theoretical Computer Science
256
(1-2), 2001, pp. 93-112
Automatic verification of parameterized networks of processes
David Lesens
,
Nicolas Halbwachs
,
Pascal Raymond
Theoretical Computer Science
256
(1-2), 2001, pp. 113-144
Ensuring completeness of symbolic verification methods for infinite-state systems
Parosh Aziz Abdulla
,
Bengt Jonsson
Theoretical Computer Science
256
(1-2), 2001, pp. 145-167