REACHABILITY ANALYSIS OF COMMUNICATING PUSHDOWN SYSTEMS

Alexander Heussner (1) , Jérôme Leroux (1) , Anca Muscholl (1) , Grégoire Sutre (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

The reachability analysis of recursive programs that communicate asynchro- nously over reliable Fifo channels calls for restrictions to ensure decidability. Our first result characterizes communication topologies with a decidable reachability problem re- stricted to eager runs (i.e., runs where messages are either received immediately after being sent, or never received). The problem is ExpTime-complete in the decidable case. The second result is a doubly exponential time algorithm for bounded context analysis in this setting, together with a matching lower bound.

Domaines: Mathématique discrète [cs.DM]

Alexander Heussner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre. REACHABILITY ANALYSIS OF COMMUNICATING PUSHDOWN SYSTEMS. Logical Methods in Computer Science, 2012, 8 (3:23), pp.1--20. ⟨10.2168/LMCS-8(3:23)2012⟩. ⟨hal-00760287⟩