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

By Burkart O.   Steffen B.  

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

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

On the decidability of fragments of the asynchronous -calculus

By Amadio R.M.   Meyssonnier C.  

Electronic Notes in Theoretical Computer Science, Vol. 52, Iss. 1, 2004-01 ,pp. : 1-17

Elsevier

Access to resources Recommend Favorite

Model Checking with Strong Fairness

By Kesten Yonit   Pnueli Amir   Raviv Li-On   Shahar Elad  

Formal Methods in System Design, Vol. 28, Iss. 1, 2006-01 ,pp. : 57-84

Springer Publishing Company

Access to resources Recommend Favorite

Trail-Directed Model Checking

By Edelkamp S.   Lluch-Lafuente A.   Leue S.  

Electronic Notes in Theoretical Computer Science, Vol. 55, Iss. 3, 2004-01 ,pp. : 1-14

Elsevier

Access to resources Recommend Favorite