License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2017.85
URN: urn:nbn:de:0030-drops-81393
URL: http://drops.dagstuhl.de/opus/volltexte/2017/8139/
Go to the corresponding LIPIcs Volume Portal


Schnoebelen, Philippe

Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk)

pdf-format:
LIPIcs-MFCS-2017-85.pdf (0.3 MB)


Abstract

We explain how the downward-closed subsets of a well-quasi-ordering (X,\leq) can be represented via the ideals of X and how this leads to simple and efficient algorithms for the verification of well-structured systems.

BibTeX - Entry

@InProceedings{schnoebelen:LIPIcs:2017:8139,
  author =	{Philippe Schnoebelen},
  title =	{{Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk)}},
  booktitle =	{42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
  pages =	{85:1--85:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-046-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{83},
  editor =	{Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8139},
  URN =		{urn:nbn:de:0030-drops-81393},
  doi =		{10.4230/LIPIcs.MFCS.2017.85},
  annote =	{Keywords: Well-structured systems and verification, Order theory}
}

Keywords: Well-structured systems and verification, Order theory
Seminar: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Issue Date: 2017
Date of publication: 22.11.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI