Sciweavers

1355 search results - page 112 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
FSTTCS
2005
Springer
14 years 2 months ago
Reachability Analysis of Multithreaded Software with Asynchronous Communication
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, J...
CONCUR
2001
Springer
14 years 1 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
TCS
2002
13 years 8 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
SIGGRAPH
2010
ACM
14 years 1 months ago
Filament-based smoke with vortex shedding and variational reconnection
Simulating fluids based on vortex filaments is highly attractive for the creation of special effects because it gives artists full control over the simulation using familiar too...
Steffen Weißmann, Ulrich Pinkall
ICDCS
2007
IEEE
14 years 28 days ago
Communication-Efficient Tracking of Distributed Cumulative Triggers
In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amo...
Ling Huang, Minos N. Garofalakis, Anthony D. Josep...