Sciweavers

Share
POPL
2012
ACM
8 years 3 months ago
Analysis of recursively parallel programs
We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programm...
Ahmed Bouajjani, Michael Emmi
RP
2010
Springer
150views Control Systems» more  RP 2010»
9 years 6 months ago
Rewriting Systems for Reachability in Vector Addition Systems with Pairs
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
Paulin Jacobé de Naurois, Virgile Mogbil
FSTTCS
2010
Springer
9 years 6 months ago
Place-Boundedness for Vector Addition Systems with one zero-test
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
Rémi Bonnet, Alain Finkel, Jérô...
IPL
2010
80views more  IPL 2010»
9 years 6 months ago
The reachability problem for branching vector addition systems requires doubly-exponential space
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by summing two reachable vectors and adding an integral v...
Ranko Lazic
IJFCS
2008
102views more  IJFCS 2008»
9 years 8 months ago
On Stateless Automata and P Systems
We introduce the notion of stateless multihead two-way (respectively, oneway) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In ...
Linmin Yang, Zhe Dang, Oscar H. Ibarra
ICALP
2010
Springer
10 years 28 days ago
Reachability Games on Extended Vector Addition Systems with States
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of decidin...
Tomás Brázdil, Petr Jancar, Anton&ia...
FSTTCS
2009
Springer
10 years 2 months ago
The Covering and Boundedness Problems for Branching Vector Addition Systems
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
Stéphane Demri, Marcin Jurdzinski, Oded Lac...
SOFSEM
2010
Springer
10 years 5 months ago
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
Alain Finkel, Arnaud Sangnier
books