| A. Bouajjani, J.-C. Fernandez, N. Halbwachs. Minimal model generation. Computer-aided Verification, Springer LNCS 531, pp. 197--203, 1990. |
.... = g. Each step of the procedure BisimApprox is effectively computable if A is effective. The successive approximation converges i.e. the procedure BisimApprox terminates iff A is finitary. Implementations of the procedure BisimApprox are discussed in [16, 23] for finite automata and in [7, 17] for arbitrary transition systems. Questions about transition systems. 1 The emptiness problem for transition systems asks, given a transition system A, is the language [ A] L empty. If A is effective and finitary, then the emptiness problem can be solved by first computing the bisimilarity ....
A. Bouajjani, J.-C. Fernandez, N. Halbwachs. Minimal model generation. Computer-aided Verification, Springer LNCS 531, pp. 197--203, 1990.
....target object) asynchronous communication (between distributed target objects) data or control dependencies, real time dependencies, etc. The interpretation of distributed objects as communicating automata or symbolic transition systems allows to use efficient verification tools, such as CADP [8], in order to verify the global safety properties of the target systems (e.g. deadlock freedom, reachability of states) The interpretation of confined objects as synchronous programs allows to compile them separately in order to generate either simulation programs or intelligent program stubs ....
J.-C. Fernandez, H. Garavel, A. Kerbrat, L. Mounier, R. Mateescu and M. Sighineanu. Computer Aided Verification. In CADP: a protocol validation and verification toolbox, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC