Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/AbdullaJ01,
  author       = {Parosh Aziz Abdulla and
                  Bengt Jonsson},
  title        = {Ensuring completeness of symbolic verification methods for infinite-state
                  systems},
  journal      = {Theor. Comput. Sci.},
  volume       = {256},
  number       = {1-2},
  pages        = {145--167},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00105-5},
  doi          = {10.1016/S0304-3975(00)00105-5},
  timestamp    = {Tue, 31 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/AbdullaJ01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Bouajjani01,
  author       = {Ahmed Bouajjani},
  title        = {Preface},
  journal      = {Theor. Comput. Sci.},
  volume       = {256},
  number       = {1-2},
  pages        = {1--2},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00098-0},
  doi          = {10.1016/S0304-3975(00)00098-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Bouajjani01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FinkelS01,
  author       = {Alain Finkel and
                  Philippe Schnoebelen},
  title        = {Well-structured transition systems everywhere!},
  journal      = {Theor. Comput. Sci.},
  volume       = {256},
  number       = {1-2},
  pages        = {63--92},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00102-X},
  doi          = {10.1016/S0304-3975(00)00102-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FinkelS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HirshfeldM01,
  author       = {Yoram Hirshfeld and
                  Faron Moller},
  title        = {Pushdown automata, multiset automata, and Petri nets},
  journal      = {Theor. Comput. Sci.},
  volume       = {256},
  number       = {1-2},
  pages        = {3--21},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00099-2},
  doi          = {10.1016/S0304-3975(00)00099-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HirshfeldM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Jancar01,
  author       = {Petr Jancar},
  title        = {Nonprimitive recursive complexity and undecidability for Petri net
                  equivalences},
  journal      = {Theor. Comput. Sci.},
  volume       = {256},
  number       = {1-2},
  pages        = {23--30},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00100-6},
  doi          = {10.1016/S0304-3975(00)00100-6},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Jancar01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KestenMMPS01,
  author       = {Yonit Kesten and
                  Oded Maler and
                  Monica Marcus and
                  Amir Pnueli and
                  Elad Shahar},
  title        = {Symbolic model checking with rich assertional languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {256},
  number       = {1-2},
  pages        = {93--112},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00103-1},
  doi          = {10.1016/S0304-3975(00)00103-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KestenMMPS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LesensHR01,
  author       = {David Lesens and
                  Nicolas Halbwachs and
                  Pascal Raymond},
  title        = {Automatic verification of parameterized networks of processes},
  journal      = {Theor. Comput. Sci.},
  volume       = {256},
  number       = {1-2},
  pages        = {113--144},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00104-3},
  doi          = {10.1016/S0304-3975(00)00104-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LesensHR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Mayr01,
  author       = {Richard Mayr},
  title        = {Decidability of model checking with the temporal logic {EF}},
  journal      = {Theor. Comput. Sci.},
  volume       = {256},
  number       = {1-2},
  pages        = {31--62},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00101-8},
  doi          = {10.1016/S0304-3975(00)00101-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Mayr01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}