A linear algorithm for solving fixed-point equations on transition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 581 LNCS, Issue , 1992, Pages 322-341

  Vergauwen, Bart ^a   Lewi, Johan ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Modal logics; Model checking; Transition systems

Indexed keywords

ALGEBRA; FORESTRY;

EXTREMAL; FIXED POINT EQUATION; FIXED POINTS; LINEAR ALGORITHMS; MODAL LOGIC; RECURSIVE EQUATIONS; SYSTEM OF EQUATIONS; TRANSITION SYSTEM;

MODEL CHECKING;

EID: 85020736152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55251-0_18     Document Type: Conference Paper

References (10)

1. Arnold, A., Crubille, P.: A linear algorithm to solve fixed-points equations on transition systems, Information Processing Letters, vol. 29, 57-66, 1988
2. 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
3. Cleaveland, R.: Tableau-based model checking in the propositional \icalculus, Acta Informatica, 1990
4. Cleaveland, R., Steffen, B.: Computing Behavioural Relations, Logically, ICALP 91, pp. 127-138, LNCS 510
5. Dicky, A.: An algebraic and algorithmic method of analysing transition systems, TCS, 46, 285-303, 1986
6. Emerson, E. A., Lei, C.-L.: Efficient model checking in fragments of the propositional λ-calculus, LICS, 267-278, 1986
7. Kozen, D.: Results on the propositional µ-calculus, TCS, 27, 333-354, 1983
8. Stirling, C, Walker, D.: Local model checking in the modal mu-calculus, CAAP 1989, pp. 369-383, LNCS 351
9. Tarski, A.: A lattice-theoretic fixpoint theorem and its applications, Pacific Journal of Mathematics, vol 5, 1955
10. Winskel, G.: On the compositional checking of validity, LNCS 458, 481-501, CONCUR’90