Results 1  10
of
15
Algorithmic Verification of Asynchronous Programs
"... Asynchronous programming is a ubiquitous systems programming idiom to manage concurrent interactions with the environment. In this style, instead of waiting for timeconsuming operations to complete, the programmer makes a nonblocking call to the operation and posts a callback task to a task buffer ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
Asynchronous programming is a ubiquitous systems programming idiom to manage concurrent interactions with the environment. In this style, instead of waiting for timeconsuming operations to complete, the programmer makes a nonblocking call to the operation and posts a callback task to a task buffer that is executed later when the timeconsuming operation completes. A cooperative scheduler mediates the interaction by picking and executing callback tasks from the task buffer to completion (and these callbacks can post further callbacks to be executed later). Writing correct asynchronous programs is hard because the use of callbacks, while efficient, obscures program control flow. We provide a formal model underlying asynchronous programs and study verification problems for this model. We show that the safety verification problem for finitedata asynchronous programs is expspacecomplete. We show that liveness verification for finitedata asynchronous programs is decidable and polynomialtime equivalent to Petri Net reachability. Decidability is not obvious, since even if the data is finitestate, asynchronous programs constitute infinitestate transition systems: both the program stack and the task buffer of pending asynchronous calls can be potentially unbounded. Our main technical construction is a polynomialtime semanticspreserving reduction from asynchronous programs to Petri Nets and conversely. The reduction allows the use of algorithmic techniques on Petri Nets
The reachability problem for Vector Addition System with one zerotest
, 2011
"... We consider here a variation of Vector Addition Systems where one counter can be tested for zero. We extend the reachability proof for Vector Addition System recently published by Leroux to this model. This provides an alternate, more conceptual proof of the reachability problem that was originally ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We consider here a variation of Vector Addition Systems where one counter can be tested for zero. We extend the reachability proof for Vector Addition System recently published by Leroux to this model. This provides an alternate, more conceptual proof of the reachability problem that was originally proved by Reinhardt.
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
 In: Proceedings of the 6th International Conference on Language and Automata Theory and Applications (LATA’12). Volume 7183 of Lecture Notes in Computer Science., SpringerVerlag
, 2012
"... Abstract. This paper introduces the model of priced timed pushdown systems as an extension of discretetimed pushdown systems with a cost model that assigns multidimensional costs to both transitions and stack symbols. For this model, we consider the minimal cost reachability problem: i.e., given a ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
Abstract. This paper introduces the model of priced timed pushdown systems as an extension of discretetimed pushdown systems with a cost model that assigns multidimensional costs to both transitions and stack symbols. For this model, we consider the minimal cost reachability problem: i.e., given a priced timed pushdown system and a target set of configurations, determine the minimal possible cost of any run from the initial to a target configuration. We solve the problem by reducing it to the reachability problem in standard pushdown systems.
Mixing coverability and reachability to analyze VASS with one zerotest
, 2009
"... ..."
(Show Context)
PlaceBoundedness for Vector Addition Systems with one zerotest
, 2010
"... Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zerotest. Surprisingly, placeboundedness remained open. We provide here a variation of the KarpMiller algorithm to compute a basis of the downward closure of the reachability set which allows to d ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zerotest. Surprisingly, placeboundedness remained open. We provide here a variation of the KarpMiller algorithm to compute a basis of the downward closure of the reachability set which allows to decide placeboundedness. This forward algorithm is able to pass the zerotests thanks to a finer cover, hybrid between the reachability and cover sets, reclaiming accuracy on one component. We show that this filtered cover is still recursive, but that equality of two such filtered covers, even for usual Vector Addition Systems (with no zerotest), is undecidable.
Theory of Well Structured Transition Systems and Extended Vector Addition Systems
"... ..."
(Show Context)
MODEL CHECKING VECTOR ADDITION SYSTEMS WITH ONE ZEROTEST
 VOL. 8 (2:11) 2012, PP. 1–25
, 2012
"... ..."
Dynamic soundness in ResourceConstrained Workflow Nets
"... Workflow Petri nets (wfnets) are an important formalism for the modeling of business processes. For them we are typically interested in the soundness problem, that intuitively consists in deciding whether several concurrent executions can always terminate properly. ResourceConstrained Workflow Net ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Workflow Petri nets (wfnets) are an important formalism for the modeling of business processes. For them we are typically interested in the soundness problem, that intuitively consists in deciding whether several concurrent executions can always terminate properly. ResourceConstrained Workflow Nets (rcfwnets) are wfnets enriched with static places, that model global resources. In this paper we prove the undecidability of soundness for rcwfnets when there may be several static places and in which instances are allowed to terminate having created or consumed resources. In order to have a clearer presentation of the proof, we define an asynchronous version of a class of Petri nets with dynamic name creation. Then, we prove that reachability is undecidable for them, and reduce it to dynamic soundness in rcwfnets. Finally, we prove that if we restrict our class of rcwfnets, assuming in particular that a single instance is sound when it is given infinitely many global resources, then dynamic soundness is decidable by reducing it to the home space problem in P/T nets for a linear set of markings.
How to Tackle Integer Weighted Automata Positivity
"... This paper is dedicated to candidate abstractions to capture relevant aspects of the integer weighted automata. The expected effect of applying these abstractions is studied to build the deterministic reachability graphs allowing us to semidecide the positivity problem on these automata. Moreover, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper is dedicated to candidate abstractions to capture relevant aspects of the integer weighted automata. The expected effect of applying these abstractions is studied to build the deterministic reachability graphs allowing us to semidecide the positivity problem on these automata. Moreover, the papers reports on the implementations and experimental results, and discusses other encodings.
Context Petri Nets, Vector Addition Systems (VAS) and Vector Addition
"... Abstract. We consider here a variation of Vector Addition Systems where one counter can be tested for zero, extending the reachability proof by Leroux for Vector Addition System to our model. This provides an alternate, and hopefully simpler to understand, proof of the reachability problem that was ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We consider here a variation of Vector Addition Systems where one counter can be tested for zero, extending the reachability proof by Leroux for Vector Addition System to our model. This provides an alternate, and hopefully simpler to understand, proof of the reachability problem that was originally proved by Reinhardt.