| R. Cleaveland and B. Ste#en. Computing behavioral relations, logically. ICALP '91, LNCS 510, 1991. |
....to checking whether, say, A is a model of the characteristic formula for B. The approach to (automated) verification where the problem of checking behavioral relations between finite Labelled Transition Systems (LTSs) 16] is reduced to model checking is advocated by Cleaveland and Steffen in [9, 10]. In their approach, the language being model checked is a logic equivalent in expressive power to the alternation free fragment of the modal calculus [17] The e#ciency of this approach hinges on the following two facts: 1. the characteristic formula associated with a finite labelled transition ....
....associated with a finite labelled transition system has size that is linear in that of the original LTS, and 2. the time complexity of determining whether a process satisfies a formula is proportional to the product of the sizes of the process and the formula. The resulting algorithm o#ered in [9] is still considered to be one of the most e#cient for checking behavioural preorders. In the setting of modelling and verification for real time systems, a characteristic formula construction for timed bisimulation equivalence over timed automata [2] has been o#ered in [19] In op. cit. ....
[Article contains additional citation context not shown here]
R. Cleaveland and B. Steffen, Computing behavioral relations, logically, in ICALP '91: Automata, Languages and Programming, J. L. Albert, B. Monien, and M. R. Artalejo, eds., vol. 510 of Lecture Notes in Computer Science, Madrid, July 1991, Springer-Verlag, pp. 127--138.
No context found.
R. Cleaveland and B. Ste#en. Computing behavioral relations, logically. ICALP '91, LNCS 510, 1991.
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