M. Vardi. Linear vs branching time: A complexity-theoretic perspective. In Proceedings, 13th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....also been applied successfully to verification of probabilistic systems [PZ93] PZ86] BCHG 97] which is the topic of the ESSLLI 2000 course o#ered by Mark Ryan and Marta Kwiatkowska. For more on model checking, attend that course, or see e.g. EL86] SW91] Zuc93b] KVW94] Zuc93a] Var98] 7.2 Branching time vs linear time logics The debate on the pros and contras of using linear vs branching time temporal logics has been alive and unabating since the begining of the 80 s. See [Lam80] and [EH86] for the beginning of it. Of course, the linear and branching time approaches have ....

....( PSPACE ) complexity of the satisfiability, fares worse ( EXPTIME) when it comes to model checking. All these suggest that, so far, there are no decisive theoretical arguments in favour of one approach to the other, so the practical consideration play a leading role here and, as Vardi puts it in [Var98] the debate might end up being decided by the market place rather than by the research community For more on the discussion, see Moshe Vardi s paper and check out his website at http: www.cs.rice.edu vardi . 7.3 Characterizing expressiveness of temporal logics in terms of automata and monadic ....

M. Vardi. Linear vs branching time: A complexity-theoretic perspective. In Proceedings, 13th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1998.

No context found.

M. Vardi. Linear vs branching time: A complexity-theoretic perspective. In Proceedings, 13th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1998.

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