Efficient checking of behavioural relations and modal assertions using fixed-point inversion

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

Volumn 939, Issue , 1995, Pages 142-154

  Andersen, Henrik Reif ^a   Vergauwen, Bart ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b Department of Computer Science KU Leuven   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

ALGORITHM FOR SOLVING; EQUATION SYSTEMS; FIXED POINT EQUATION; FIXED POINT ITERATION; FIXED POINTS; TIME AND SPACE COMPLEXITY; WEAK BISIMULATION;

BOOLEAN ALGEBRA;

EID: 84947941823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60045-0_47     Document Type: Conference Paper

References (16)

1. [AHU74] Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
2. [And93] Henrik R. Andersen. Verification of Temporal Properties of Concurrent Systems. PhD thesis, Department of Computer Science, Aarhus University, Denmark, June 1993. PB-445.
3. [And94] Henrik R. Andersen. Model checking and boolean graphs. Theoretical Computer Science, 126(1):3-30, April 1994.
4. 20 states and beyond. In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 428-439. IEEE Computer Society Press, 1990.
5. [BP92] Bard Bloom and Robert Paige. Computing ready simulations efficiently. 1992.
6. [Bry92] Randal E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. Computing Surveys, 24(3):293-318, September 1992.
7. [CDS92] Ranee Cleaveland, Marion Dreimüller, and Bernhard Steffen. Faster model checking for the modal mu-calculus. In G. v. Bochmann and D. K. Probst, editors, Proceedings of the 4th Workshop on Computer Aided Verification, CAV'92, June 29 - July 1, 1992, Montreal, Quebec, Canada, volume 663 of LNCS, pages 383-394. Springer-Verlag, 1992.
8. [CES86] E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
9. [EJS93] E.A. Emerson, C.S. Jutla, and A.P. Sistla. On model-checking for fragments of μ-calculus. In Costas Courcoubetis, editor, Proceedings of the 5th International Conference on Computer Aided Verification, CAV'93, volume 697 of LNCS, pages 385-396. Springer-Verlag, 1993.
10. [ESTT91] Klaus Estenfeld, Hans-Albert Schneider, Dirk Taubner, and Erik Tidén. Computer aided verification of parallel processes. In A. Pfitzmann and E. Raubold, editors, VIS '91 Verlässliche Informationssysteme, volume 271 of Informatik Fachberichte, pages 208-226, Darmstadt, 1991. Springer-Verlag.
11. [GV90] J.F. Groote and F. Vaandrager. An efficient algorithm for branching bisimulation and stuttering equivalence. In M.S. Paterson, editor, Proceedings of ICALP, volume 443 of LNCS. Springer-Verlag, 1990.
12. [Koz83] Dexter Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27, 1983.
13. [KS90] P.C. Kanellakis and S.A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86:43-68, 1990.
14. [Mi189] Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
15. [Tar72] R. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Cornput., 2(1), June 1972.
16. [VL92] Bart Vergauwen and Johan Lewi. A linear algorithm for solving fixed-point equations on transition systems. In J.-C. Raoult, editor, Proceedings of 17th Colloquium on Trees in Algebra and Programming, CAAP'92, Rennes, France, volume 581 of LNCS, pages 322-341. Springer-Verlag, 1992.