O. Kupferman and M. Y. Vardi, Module checking, Computer aided verification, Proceedings of the 8th international conference, Lecture Notes in Computer Science, no. 1102, Springer-Verlag, 1996, pp. 75--86. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Behavior of Interacting Agents - Dekhtyar, Dikovsky, Valiev (2002) (Correct)
....of numbers, the size of descriptions of MA systems A(M;x) in (1) and (2) can be bounded by O(n log n) Then the required assertion is obtained by using an ATM M recognizing in space O(n) a set recognizable by a DTM in time 3 but not in time 2 . 4) Upper bound. It is well known (e.g. see [17, 5]) that propositional mu calculus model checking has time complexity upper bound O( jTSj j j) ad( for formulas with alternation depth ad( on transition systems T S: On the other hand, this problem belongs to NP co NP. These results are easily extended to first order mu calculus and ....
Bernholz, O., Vardi, M. Y., Wolper, P. An automata-theoretic approach to branching time model checking. Proc. Int. Workshop "Computer aided verification", Stanford, 1994 (LNCS).
The Bulletin of Symbolic Logic - Volume Number June Self-citation (Kupferman Vardi) (Correct)
No context found.
O. Kupferman and M. Y. Vardi, Module checking, Computer aided verification, Proceedings of the 8th international conference, Lecture Notes in Computer Science, no. 1102, Springer-Verlag, 1996, pp. 75--86.
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