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

Author： Labroue A.   Schnoebelen P.  

Publisher： Elsevier

ISSN： 1571-0661

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

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

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

The power of reachability testing for timed automata

By Aceto L.   Bouyer P.   Burgueno A.   Larsen K.G.  

Theoretical Computer Science, Vol. 300, Iss. 1, 2003-05 ,pp. : 411-475

Elsevier

Access to resources Recommend Favorite

Using Forward Reachability Analysis for Verification of Lossy Channel Systems

By Abdulla Parosh Aziz   Collomb-Annichini Aurore   Bouajjani Ahmed   Jonsson Bengt  

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

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

Resolution-based approach to compatibility analysis of interacting automata

By Chebotarev A.N.   Morokhovets M.K.  

Theoretical Computer Science, Vol. 194, Iss. 1, 1998-03 ,pp. : 183-205

Elsevier

Access to resources Recommend Favorite