A complexity analysis of bisimilarity for value-passing processes

By Boreale M.   Trevisan L.  

Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. : 313-345

Elsevier

Access to resources Recommend Favorite

One-way probabilistic reversible and quantum one-counter automata

By Yamasaki T.   Kobayashi H.   Tokunaga Y.   Imai H.  

Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. : 963-976

Elsevier

Access to resources Recommend Favorite

A polynomial algorithm for deciding bisimilarity of normed context-free processes

By Hirshfeld Y.   Jerrum M.   Moller F.  

Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. : 143-159

Elsevier

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

Belief Revision and Update: Complexity of Model Checking

By Liberatore P.   Schaerf M.  

Journal of Computer and System Sciences, Vol. 62, Iss. 1, 2001-02 ,pp. : 43-72

Academic Press

Access to resources Recommend Favorite