A logical reconstruction of reachability

Tatiana Rybina, Andrei Voronkov

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    In this paper we discuss reachability analysis for infinite-state systems. Infinite-state systems are formalized using transition systems over a first-order structure. We establish a common ground relating a large class of algorithms by analyzing the connections between the symbolic representation of transition systems and formulas used in various reachability algorithms. Our main results are related to the so-called guarded assignment systems. © Springer-Verlag Berlin Heidelberg 2003.
    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.
    PublisherSpringer Nature
    Pages222-237
    Number of pages15
    Volume2890
    Publication statusPublished - 2003
    EventPerspectives of Systems Informatics, 5th International Andrei Ershov Memorial Conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9-12, 2003, Revised Papers -
    Duration: 1 Jan 1824 → …
    http://dblp.uni-trier.de/db/conf/ershov/ershov2003.html#RybinaV03http://dblp.uni-trier.de/rec/bibtex/conf/ershov/RybinaV03.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/ershov/RybinaV03

    Publication series

    NameLecture Notes in Computer Science

    Conference

    ConferencePerspectives of Systems Informatics, 5th International Andrei Ershov Memorial Conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9-12, 2003, Revised Papers
    Period1/01/24 → …
    Internet address

    Keywords

    • Infinite-state systems
    • Model theory
    • Reachability analysis
    • Theoretical foundation

    Fingerprint

    Dive into the research topics of 'A logical reconstruction of reachability'. Together they form a unique fingerprint.

    Cite this