Abstract
In this paper we present an algorithm for effectively computing extremal fixed-points of a system of mutually recursive equations over a finite transition system. The proposed algorithm runs in time linear in the size of the transition system and linear in the size of the system of equations, thereby improving on [AC].
Preview
Unable to display preview. Download preview PDF.
References
Arnold, A., Crubille, P.: A linear algorithm to solve fixed-points equations on transition systems, Information Processing Letters, vol.29, 57–66, 1988
Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Progr. Languages and Systems, Vol.8, No. 2, pp. 244–263, April 1986
Cleaveland, R.: Tableau-based model checking in the propositional μcalculus, Acta Informatica, 1990
Cleaveland, R., Steffen, B.: Computing Behavioural Relations, Logically, ICALP 91, pp. 127–138, LNCS 510
Dicky, A.: An algebraic and algorithmic method of analysing transition systems, TCS, 46, 285–303, 1986
Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional μ-calculus, LICS, 267–278, 1986
Kozen, D.: Results on the propositional μ-calculus, TCS, 27, 333–354, 1983
Stirling, C., Walker, D.: Local model checking in the modal mu-calculus, CAAP 1989, pp. 369–383, LNCS 351
Tarski, A.: A lattice-theoretic fixpoint theorem and its applications, Pacific Journal of Mathematics, vol 5, 1955
Winskel, G.: On the compositional checking of validity, LNCS 458, 481–501, CONCUR'90
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vergauwen, B., Lewi, J. (1992). A linear algorithm for solving fixed-point equations on transition systems. In: Raoult, J.C. (eds) CAAP '92. CAAP 1992. Lecture Notes in Computer Science, vol 581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55251-0_18
Download citation
DOI: https://doi.org/10.1007/3-540-55251-0_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55251-2
Online ISBN: 978-3-540-46799-1
eBook Packages: Springer Book Archive