Queue-Dispatch Asynchronous Systems

Geeraerts, Gilles; Heußner, Alexander; Raskin, Jean-François

doi:10.1109/acsd.2013.18

Cited by 8 publications

(12 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This extension has practical applications in the parametric reasoning on concurrent programs, see for instance our recent work [14], where ωPN are used to the model and verify of concurrent programs written using libraries for multi-core platforms such as the Grand Central Dispatch technology.…”

Section: Discussionmentioning

confidence: 99%

“…An ω-labeled input arc consumes, non-deterministically, any number of tokens in its input place while an ω-labeled output arc produces non-deterministically any number of tokens in its output place. We claim that ωPN are particularly well suited for modeling parametric concurrent systems -see for instance our recent work on the Grand Central Dispatch (GCD) technology [14] -, and to perform parametric verification [18] on those systems, as we illustrate now by means of the example in Fig. 1.…”

Section: Introductionmentioning

confidence: 96%

See 1 more Smart Citation

ω-Petri Nets: Algorithms and Complexity

Geeraerts

Heußner

Praveen

et al. 2015

Fundamenta Informaticae

Self Cite

View full text Add to dashboard Cite

We introduce ω-Petri nets (ωPN), an extension of plain Petri nets with ω-labeled input and output arcs, that is well-suited to analyse parametric concurrent systems with dynamic thread creation. Most techniques (such as the Karp and Miller tree or the Rackoff technique) that have been proposed in the setting of plain Petri nets do not apply directly to ωPN because ωPN define transition systems that have infinite branching. This motivates a thorough analysis of the computational aspects of ωPN. We show that an ωPN can be turned into a plain Petri net that allows us to recover the reachability set of the ωPN, but that does not preserve termination (an ωPN terminates iff it admits no infinitely long execution). This yields complexity bounds for the reachability, boundedness, place boundedness and coverability problems on ωPN. We provide a practical algorithm to compute a coverability set of the ωPN and to decide termination by adapting the classical Karp and Miller tree construction. We also adapt the Rackoff technique to ωPN, to obtain the exact complexity of the termination problem. Finally, we consider the extension of ωPN with reset and transfer arcs, and show how this extension impacts the decidability and complexity of the aforementioned problems.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 96%

ω-Petri Nets: Algorithms and Complexity

Geeraerts

Heußner

Praveen

et al. 2015

Fundamenta Informaticae

Self Cite

View full text Add to dashboard Cite

show abstract

“…Various extensions of Sen and Viswanathan's model [6] and applications to realworld asynchronous task scheduling systems [19] have been investigated. From the standpoint of message-passing concurrency, a key restriction of many of the models considered is that messages may only be retrieved by a communicating pushdown process when its stack is empty.…”

Section: Related Work and Discussionmentioning

confidence: 99%

Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks

Kochems

Ong

2013

CONCUR 2013 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. In this paper, we study the program-point reachability problem of concurrent pushdown systems that communicate via unbounded and unordered message buffers. Our goal is to relax the common restriction that messages can only be retrieved by a pushdown process when its stack is empty. We use the notion of partially commutative context-free grammars to describe a new class of asynchronously communicating pushdown systems with a mild shape constraint on the stacks for which the program-point coverability problem remains decidable. Stacks that fit the shape constraint may reach arbitrary heights; further a process may execute any communication action (be it process creation, message send or retrieval) whether or not its stack is empty. This class extends previous computational models studied in the context of asynchronous programs, and enables the safety verification of a large class of message passing programs.

show abstract

“…Existing approaches to tackle this theoretical challenge fall mainly into two categories: verification algorithms working on restrictions to simple approximations, e.g. by extended automata models or Petri nets [12,2], or semi-algorithmic approaches on models that try to cover the original features as faithfully as possible, e.g. by bounded model checking [7].…”

Section: Introductionmentioning

confidence: 99%

Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model

Heußner¹,

Poskitt²,

Corrodi³

et al. 2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

To harness the power of multi-core and distributed platforms, and to make the development of concurrent software more accessible to software engineers, different object-oriented concurrency models such as SCOOP have been proposed. Despite the practical importance of analysing SCOOP programs, there are currently no general verification approaches that operate directly on program code without additional annotations. One reason for this is the multitude of partially conflicting semantic formalisations for SCOOP (either in theory or by-implementation). Here, we propose a simple graph transformation system (GTS) based run-time semantics for SCOOP that grasps the most common features of all known semantics of the language. This run-time model is implemented in the stateof-the-art GTS tool GROOVE, which allows us to simulate, analyse, and verify a subset of SCOOP programs with respect to deadlocks and other behavioural properties. Besides proposing the first approach to verify SCOOP programs by automatic translation to GTS, we also highlight our experiences of applying GTS (and especially GROOVE) for specifying semantics in the form of a run-time model, which should be transferable to GTS models for other concurrent languages and libraries.

show abstract

Queue-Dispatch Asynchronous Systems

Cited by 8 publications

References 18 publications

ω-Petri Nets: Algorithms and Complexity

ω-Petri Nets: Algorithms and Complexity

Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks

Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model

Contact Info

Product

Resources

About