A work-efficient distributed algorithm for reachability analysis

Author： Grumberg Orna   Heyman Tamir   Schuster Assaf  

Publisher： Springer Publishing Company

ISSN： 0925-9856

Source： Formal Methods in System Design, Vol.29, Iss.2, 2006-09, pp. : 157-175

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

A Distributed Algorithm for GSPN Reachability Graph Generation

By Caselli S.   Conte G.   Marenzoni P.  

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 1, 2001-01 ,pp. : 79-95

Academic Press

Access to resources Recommend Favorite

Work‐efficient parallel union‐find

By  

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 30, Iss. 4, 2018-02 ,pp. : n/a-n/a

John Wiley & Sons Inc

Access to resources Recommend Favorite

Efficient reduction of finite state model checking to reachability analysis

By Schuppan Viktor   Biere Armin  

International Journal on Software Tools for Technology Transfer, Vol. 5, Iss. 2-3, 2004-03 ,pp. : 185-204

Springer Publishing Company

Access to resources Recommend Favorite

A distributed energy efficient multicast routing algorithm for WANETs

By Zhao Sufen   Tan Liansheng   Li Jie  

International Journal of Sensor Networks, Vol. 2, Iss. 1-2, 2007-04 ,pp. : 62-67

Inderscience Publishers

Access to resources Recommend Favorite

An Efficient Server Minimization Algorithm for Internet Distributed Systems

By  

International Journal of Rough Sets and Data Analysis (IJRSDA), Vol. 4, Iss. 4, 2017-10 ,pp. : 17-30

IGI Global_journal

Access to resources Recommend Favorite