A Partial Order Approach to Branching Time Logic Model Checking

Author： Gerth R.   Kuiper R.   Peled D.   Penczek W.  

Publisher： Academic Press

ISSN： 0890-5401

Source： Information and Computation, Vol.150, Iss.2, 1999-05, pp. : 132-152

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A clausal resolution method for branching-time logic ECTL+

By Bolotov Alexander   Basukoski Artie  

Annals of Mathematics and Artificial Intelligence, Vol. 46, Iss. 3, 2006-03 ,pp. : 235-263

Springer Publishing Company

Access to resources Recommend Favorite

Branching-Time Temporal Logic and Tree Automata

By Kupferman O.   Grumberg O.  

Information and Computation, Vol. 125, Iss. 1, 1996-02 ,pp. : 62-69

Academic Press

Access to resources Recommend Favorite

Compact labelings for efficient first-order model-checking

By Courcelle Bruno   Gavoille Cyril   Kanté Mamadou  

Journal of Combinatorial Optimization, Vol. 21, Iss. 1, 2011-01 ,pp. : 19-46

Springer Publishing Company

Access to resources Recommend Favorite

Relating logic programming theories of actions and partial order planning

By Baral Chitta  

Annals of Mathematics and Artificial Intelligence, Vol. 21, Iss. 2-4, 1997-12 ,pp. : 131-151

Springer Publishing Company

Access to resources Recommend Favorite

A Discrete-Time Branching Process Model of Yeast Prion Curing Curves*

By SINDI SUZANNE S.  

Mathematical Population Studies, Vol. 20, Iss. 1, 2013-01 ,pp. : 1-13

Routledge Ltd

Access to resources Recommend Favorite