Model checking the full modal mu-calculus for infinite sequential processes

Author： Burkart O.   Steffen B.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.221, Iss.1, 1999-06, pp. : 251-270

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

The modal mu-calculus alternation hierarchy is strict

By Bradfield J.C.  

Theoretical Computer Science, Vol. 195, Iss. 2, 1998-03 ,pp. : 133-153

Elsevier

Access to resources Recommend Favorite

On model checking for the -calculus and its fragments

By Emerson  

Theoretical Computer Science, Vol. 258, Iss. 1, 2001-05 ,pp. : 491-522

Elsevier

Access to resources Recommend Favorite

A logical encoding of the π-calculus: model checking mobile processes using tabled resolution

By Yang Ping   Ramakrishnan C.R.   Smolka Scott A.  

International Journal on Software Tools for Technology Transfer, Vol. 6, Iss. 1, 2004-07 ,pp. : 38-66

Springer Publishing Company

Access to resources Recommend Favorite

Bounded model checking of infinite state systems

By Schuele Tobias   Schneider Klaus  

Formal Methods in System Design, Vol. 30, Iss. 1, 2007-02 ,pp. : 51-81

Springer Publishing Company

Access to resources Recommend Favorite

Resolution and model building in the infinite-valued calculus of Lukasiewicz

By Mundici D.   Olivetti N.  

Theoretical Computer Science, Vol. 200, Iss. 1, 1998-06 ,pp. : 335-366

Elsevier

Access to resources Recommend Favorite