Using Forward Reachability Analysis for Verification of Lossy Channel Systems

Author： Abdulla Parosh Aziz   Collomb-Annichini Aurore   Bouajjani Ahmed   Jonsson Bengt  

Publisher： Springer Publishing Company

ISSN： 0925-9856

Source： Formal Methods in System Design, Vol.25, Iss.1, 2004-07, pp. : 39-65

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

Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols

By Meseguer José  

LISP and Symbolic Computation, Vol. 20, Iss. 1-2, 2007-06 ,pp. : 123-160

Springer Publishing Company

Access to resources Recommend Favorite

Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations

By Bouajjani A.   Habermehl P.  

Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. : 211-250

Elsevier

Access to resources Recommend Favorite

An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems

By Labroue A.   Schnoebelen P.  

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

Elsevier

Access to resources Recommend Favorite

Reachability Analysis over Term Rewriting Systems

By Feuillade Guillaume   Genet Thomas   Viet Triem Tong Valérie  

Journal of Automated Reasoning, Vol. 33, Iss. 3-4, 2004-10 ,pp. : 341-383

Springer Publishing Company

Access to resources Recommend Favorite

Reachability analysis of logic Petri nets using incidence matrix

By Du Yu Yue   Ning Yu Hui   Qi Liang  

Enterprise Information Systems, Vol. 8, Iss. 6, 2014-11 ,pp. : 630-647

Taylor & Francis Ltd

Access to resources Recommend Favorite