论文信息 - A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems

A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems

Abstract This paper gives an algorithm to compute the least fixed-point of a system of equations over a transition system. This algorithm has a time complexity linear in the size of the transition system, thus improving the known algorithms which are quadratic.

Paul Crubillé | André Arnold

[1] A. Prasad Sistla,et al. Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.

[2] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[3] Joseph Sifakis,et al. A Unified Approach for Studying the Properties of Transition Systems , 1982, Theor. Comput. Sci..

[4] Anne Dicky,et al. An algebraic and algorithmic method for analysing transition systems , 1986, Theor. Comput. Sci..

[5] Dexter Kozen,et al. RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[6] Robert M. Keller,et al. Formal verification of parallel programs , 1976, CACM.