default search action
Theoretical Computer Science, Volume 256
Volume 256, Number 1-2, 6 April 2001
- Ahmed Bouajjani:
Preface. 1-2 - Yoram Hirshfeld, Faron Moller
:
Pushdown automata, multiset automata, and Petri nets. 3-21 - Petr Jancar
Nonprimitive recursive complexity and undecidability for Petri net equivalences. 23-30 - Richard Mayr:
Decidability of model checking with the temporal logic EF. 31-62 - Alain Finkel, Philippe Schnoebelen:
Well-structured transition systems everywhere! 63-92 - Yonit Kesten, Oded Maler, Monica Marcus, Amir Pnueli, Elad Shahar:
Symbolic model checking with rich assertional languages. 93-112 - David Lesens, Nicolas Halbwachs, Pascal Raymond:
Automatic verification of parameterized networks of processes. 113-144 - Parosh Aziz Abdulla, Bengt Jonsson:
Ensuring completeness of symbolic verification methods for infinite-state systems. 145-167
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-11 21:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: