A Deductive Approach towards Reasoning about Algebraic Transition Systems

Abstract EN

Algebraic transition systems are extended from labeled transition systems by allowing transitions labeled by algebraic equations for modeling more complex systems in detail.

We present a deductive approach for specifying and verifying algebraic transition systems.

We modify the standard dynamic logic by introducing algebraic equations into modalities.

Algebraic transition systems are embedded in modalities of logic formulas which specify properties of algebraic transition systems.

The semantics of modalities and formulas is defined with solutions of algebraic equations.

A proof system for this logic is constructed to verify properties of algebraic transition systems.

The proof system combines with inference rules decision procedures on the theory of polynomial ideals to reduce a proof-search problem to an algebraic computation problem.

The proof system proves to be sound but inherently incomplete.

Finally, a typical example illustrates that reasoning about algebraic transition systems with our approach is feasible.