Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

A Classification of Symbolic Transition Systems

Thomas A. Henzinger and Rupak Majumdar

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-99-1086
December 1999

http://www.eecs.berkeley.edu/Pubs/TechRpts/1999/CSD-99-1086.pdf

We define five increasingly comprehensive classes of infinite-state systems, called STS1-5, whose state spaces have finitary structure. For four of these classes, we provide examples from hybrid systems.

STS1: These are the systems with finite bisimilarity quotients. They can be analyzed symbolically by (1) iterating the predecessor and boolean operations starting from a finite set of observable state sets, and (2) terminating when no new state sets are generated. This enables model checking of the mu-calculus.

STS2: These are the systems with finite similarity quotients. They can be analyzed symbolically by iterating the predecessor and positive boolean operations. This enables model checking of the existential and universal fragments of the mu-calculus.

STS3: These are the systems with finite trace-equivalence quotients. They can be analyzed symbolically by iterating the predecessor operation and a restricted form of positive boolean operations (intersection is restricted to intersection with observables). This enables model checking of linear temporal logic.

STS4: These are the systems with finite distance-equivalence quotients (two states are equivalent if for every distance d, the same observables can be reached in d transitions). The systems in this class can be analyzed symbolically by iterating the predecessor operation and terminating when no new state sets are generated. This enables model checking of the existential conjunction-free and universal disjunction-free fragments of the mu-calculus.

STS5: These are the systems with finite bounded-reachability quotients (two states are equivalent if for every distance d, the same observables can be reached in d or fewer transitions). The systems in this class can be analyzed symbolically by iterating the predecessor operation and terminating when no new states are encountered. This enables model checking of reachability properties.


BibTeX citation:

@techreport{Henzinger:CSD-99-1086,
    Author = {Henzinger, Thomas A. and Majumdar, Rupak},
    Title = {A Classification of Symbolic Transition Systems},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1999},
    Month = {Dec},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1999/5304.html},
    Number = {UCB/CSD-99-1086},
    Abstract = {We define five increasingly comprehensive classes of infinite-state systems, called STS1-5, whose state spaces have finitary structure. For four of these classes, we provide examples from hybrid systems. <p>STS1: These are the systems with finite bisimilarity quotients. They can be analyzed symbolically by (1) iterating the predecessor and boolean operations starting from a finite set of observable state sets, and (2) terminating when no new state sets are generated. This enables model checking of the mu-calculus. <p>STS2: These are the systems with finite similarity quotients. They can be analyzed symbolically by iterating the predecessor and positive boolean operations. This enables model checking of the existential and universal fragments of the mu-calculus. <p>STS3: These are the systems with finite trace-equivalence quotients. They can be analyzed symbolically by iterating the predecessor operation and a restricted form of positive boolean operations (intersection is restricted to intersection with observables). This enables model checking of linear temporal logic. <p>STS4: These are the systems with finite distance-equivalence quotients (two states are equivalent if for every distance <i>d</i>, the same observables can be reached in <i>d</i> transitions). The systems in this class can be analyzed symbolically by iterating the predecessor operation and terminating when no new state sets are generated. This enables model checking of the existential conjunction-free and universal disjunction-free fragments of the mu-calculus. <p>STS5: These are the systems with finite bounded-reachability quotients (two states are equivalent if for every distance <i>d</i>, the same observables can be reached in <i>d</i> or fewer transitions). The systems in this class can be analyzed symbolically by iterating the predecessor operation and terminating when no new states are encountered. This enables model checking of reachability properties.}
}

EndNote citation:

%0 Report
%A Henzinger, Thomas A.
%A Majumdar, Rupak
%T A Classification of Symbolic Transition Systems
%I EECS Department, University of California, Berkeley
%D 1999
%@ UCB/CSD-99-1086
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1999/5304.html
%F Henzinger:CSD-99-1086