Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic 1

ISSN： 1387-2532

Source： Autonomous Agents and Multi-Agent Systems, Vol.11, Iss.1, 2005-07, pp. : 69-89

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

Coverage metrics for temporal logic model checking^*

By Chockler Hana Kupferman Orna Vardi Moshe

Formal Methods in System Design, Vol. 28, Iss. 3, 2006-05 ,pp. : 189-212

Springer Publishing Company

Access to resources Recommend Favorite

Mapping OWL-S Process Model to Timed Automata: A Model-Checking Timed Temporal Logic Oriented Approach

Journal of Information Technology Research (JITR), Vol. 11, Iss. 1, 2018-01 ,pp. : 29-48

IGI Global_journal

Access to resources Recommend Favorite

Data structures for symbolic multi-valued model-checking

By Chechik Marsha Gurfinkel Arie Devereux Benet Lai Albert Easterbrook Steve

Formal Methods in System Design, Vol. 29, Iss. 3, 2006-11 ,pp. : 295-344

Springer Publishing Company

Access to resources Recommend Favorite

Counter-example generation in symbolic abstract model-checking

By Pace Gordon Halbwachs Nicolas Raymond Pascal

International Journal on Software Tools for Technology Transfer, Vol. 5, Iss. 2-3, 2004-03 ,pp. : 158-164

Springer Publishing Company

Access to resources Recommend Favorite

Computable fixpoints in well-structured symbolic model checking

By Bertrand N. Schnoebelen P.

Formal Methods in System Design, Vol. 43, Iss. 2, 2013-10 ,pp. : 233-267

Springer Publishing Company

Access to resources Recommend Favorite