Well structured transition system

Formal definition

Recall that a well-quasi-ordering ≤ on a set X is a quasi-ordering (i.e., a preorder or reflexive, transitive binary relation) such that any infinite sequence of elements x 0 , x 1 , x 2 , … , from X contains an increasing pair x i ≤ x j with i < j . The set X is said to be well-quasi-ordered, or shortly wqo.

For our purposes, a transition system is a structure S = ⟨ S , → , ⋯ ⟩ , where S is any set (its elements are called states), and →⊆ S × S (its elements are called transitions). In general a transition system may have additional structure like initial states, labels on transitions, accepting states, etc. (indicated by the dots), but they do not concern us here.

A well-structured transition system consists of a transition system ⟨ S , → , ≤ ⟩ , such that

Well-structured systems

A well-structured system is a transition system ( S , → ) with state set S = Q × D made up from a finite control state set Q , a data values set D , furnished with a decidable pre-order ≤⊆ D × D which is extended to states by ( q , d ) ≤ ( q ′ , d ′ ) ⇔ q = q ′ ∧ d ≤ d ′ , which is well-structured as defined above ( → is monotonic, i.e. upward compatible, with respect to ≤ ) and in addition has a computable set of minima for the set of predecessors of any upward closed subset of S .

Well-structured systems adapt the theory of well-structured transition systems for modelling certain classes of systems encountered in computer science and provide the basis for decision procedures to analyse such systems, hence the supplementary requirements: the definition of a WSTS itself says nothing about the computability of the relations ≤ , → .

Well-structured Systems

Coverability can be decided for any well-structured system, and so can reachability of a given control state, by the backward algorithm of Abdulla et al. or for specific subclasses of well-structured systems (subject to strict monotonicity, e.g. in the case of unbounded Petri nets) by a forward analysis based on a Karp-Miller coverability graph.

Backward Algorithm

The backward algorithm allows the following question to be answered: given a well-structured system and a state s , is there any transition path that leads from a given start state s 0 to a state s ′ ≥ s (such a state is said to cover s )?

An intuitive explanation for this question is: if s represents an error state, then any state containing it should also be regarded as an error state. If a well-quasi-order can be found that models this "containment" of states and which also fulfills the requirement of monotonicity with respect to the transition relation, then this question can be answered.

Instead of one minimal error state s , one typically considers an upward closed set S e of error states.

The algorithm is based on the facts that in a well-quasi-order ( A , ≤ ) , any upward closed set has a finite set of minima, and any sequence S 1 ⊆ S 2 ⊆ . . . of upward-closed subsets of A converges after finitely many steps (1).

The algorithm needs to store an upward-closed set S s of states in memory, which it can do because an upward-closed set is representable as a finite set of minima. It starts from the upward closure of the set of error states S e and computes at each iteration the (by monotonicity also upward-closed) set of immediate predecessors and adding it to the set S s . This iteration terminates after a finite number of steps, due to the property (1) of well-quasi-orders. If s 0 is in the set finally obtained, then the output is "yes" (a state of S e can be reached), otherwise it is "no" (it is not possible to reach such a state).