Reachability Analysis of Communicating Pushdown Systems

Heußner, Alexander; Leroux, Jérôme; Muscholl, Anca; Sutre, Grégoire

doi:10.2168/lmcs-8(3:23)2012

Cited by 24 publications

(18 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Proof: It is known that the following problem is EXPTIME-complete [19]: Given a labeled pushdown automaton P recognizing a language L, and n finite state automata…”

Section: Complexity Of the Reachability Problemmentioning

confidence: 99%

Dense-Timed Pushdown Automata

Abdulla

Atig

Stenman

2012

2012 27th Annual IEEE Symposium on Logic in Computer Science

View full text Add to dashboard Cite

Abstract-We propose a model that captures the behavior of real-time recursive systems. To that end, we introduce dense-timed pushdown automata that extend the classical models of pushdown automata and timed automata, in the sense that the automaton operates on a finite set of real-valued clocks, and each symbol in the stack is equipped with a real-valued clock representing its "age". The model induces a transition system that is infinite in two dimensions, namely it gives rise to a stack with an unbounded number of symbols each of which with a real-valued clock. The main contribution of the paper is an EXPTIME-complete algorithm for solving the reachability problem for dense-timed pushdown automata.

show abstract

“…Proof: It is known that the following problem is EXPTIME-complete [19]: Given a labeled pushdown automaton P recognizing a language L, and n finite state automata…”

Section: Complexity Of the Reachability Problemmentioning

confidence: 99%

Dense-Timed Pushdown Automata

Abdulla

Atig

Stenman

2012

2012 27th Annual IEEE Symposium on Logic in Computer Science

View full text Add to dashboard Cite

show abstract

“…In [25,13], the authors discuss the type of communication topologies (e.g., trees) that leads to decidability of reachability analysis in communicating systems, including communicating push-down systems. Our results hold for any communication topology.…”

Section: Related Workmentioning

confidence: 99%

Synchronizability for Verification of Asynchronously Communicating Systems

Basu

Bultan

Ouederni

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Message-based communication is an increasingly common interaction mechanism used in concurrent and distributed systems where components interact with each other by sending and receiving messages. It is well-known that verification of systems that use asynchronous message-based communication with unbounded FIFO queues is undecidable even when the component behaviors are expressed using finite state machines. In this paper we show that there is a sub-class of such systems, called synchronizable systems, for which certain reachability properties (over send actions and over states with no pending receives) remain unchanged when asynchronous communication is replaced with synchronous communication. Hence, if a system is synchronizable, then the verification of these reachability properties can be done on the synchronous version of the system and the results hold for the asynchronous case. We present a technique for deciding if a given system is synchronizable. Our results are applicable to a variety of domains including verification and analysis of interactions among processes at the OS level, coordination in service-oriented computing and interactions among distributed programs. In this paper we focus on analysis of channel contracts in the Singularity OS. Our experimental results show that almost all channel contracts in the Singularity OS are synchronizable, and, hence, their properties can be analyzed using synchronous communication semantics.

show abstract

“…Notice that b e is obtained from b e − via the computation of B p in the definition of the labelling ρ and this conforms to the transitions of C k p (7)(8)(9)(10)(11)(12). If e is an internal event, then we can easily check that ρ(e) = ρ(e − ) (even if e − = ⊥ p ), and hence conforms to the internal transitions which are self-loops.…”

Section: Proof Of Correctness Of the Distributed Controllermentioning

confidence: 71%

“…For the restrictions studied in literature, bounded-context [17], bounded-phase [12], bounded-scope [15] and ordered stacks [2,3], it is quite easy to construct deterministic controllers, though this question has not been addressed before. The context bounding technique is extended to pushdown systems communicating via queues under the restriction that queues may be read only when the stacks are empty (well-queuing) in [13], and under a dual restriction (on writes instead of reads) in [11]. Controllability is however not studied there.…”

Section: Introductionmentioning

confidence: 99%

Controllers for the Verification of Communicating Multi-pushdown Systems

Aiswarya

Gastin

Kumar

2014

CONCUR 2014 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. Multi-pushdowns communicating via queues are formal models of multi-threaded programs communicating via channels. They are turing powerful and much of the work on their verification has focussed on under-approximation techniques. Any error detected in the underapproximation implies an error in the system. However the successful verification of the under-approximation is not as useful if the system exhibits unverified behaviours. Our aim is to design controllers that observe/restrict the system so that it stays within the verified underapproximation. We identify some important properties that a good controller should satisfy. We consider an extensive under-approximation class, construct a distributed controller with the desired properties and also establish the decidability of verification problems for this class.

show abstract

Reachability Analysis of Communicating Pushdown Systems

Cited by 24 publications

References 31 publications

Dense-Timed Pushdown Automata

Dense-Timed Pushdown Automata

Synchronizability for Verification of Asynchronously Communicating Systems

Controllers for the Verification of Communicating Multi-pushdown Systems

Contact Info

Product

Resources

About