Volume 256,
Number 1-2,
6 April 2001
ISS
- Ahmed Bouajjani:
Preface.
1-2
Electronic Edition (link) BibTeX
- Yoram Hirshfeld, Faron Moller:
Pushdown automata, multiset automata, and Petri nets.
3-21
Electronic Edition (link) BibTeX
- Petr Jancar:
Nonprimitive recursive complexity and undecidability for Petri net equivalences.
23-30
Electronic Edition (link) BibTeX
- Richard Mayr:
Decidability of model checking with the temporal logic EF.
31-62
Electronic Edition (link) BibTeX
- Alain Finkel, Ph. Schnoebelen:
Well-structured transition systems everywhere!
63-92
Electronic Edition (link) BibTeX
- Yonit Kesten, Oded Maler, Monica Marcus, Amir Pnueli, Elad Shahar:
Symbolic model checking with rich assertional languages.
93-112
Electronic Edition (link) BibTeX
- David Lesens, Nicolas Halbwachs, Pascal Raymond:
Automatic verification of parameterized networks of processes.
113-144
Electronic Edition (link) BibTeX
- Parosh Aziz Abdulla, Bengt Jonsson:
Ensuring completeness of symbolic verification methods for infinite-state systems.
145-167
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:24:38 2009
by Michael Ley (ley@uni-trier.de)
