Sciweavers

505 search results - page 26 / 101
» Global Model Checking of Ordered Multi-Pushdown Systems
Sort
View
77
Voted
LICS
2009
IEEE
15 years 6 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
LATIN
2004
Springer
15 years 5 months ago
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces
The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively com...
Volker Diekert, Paul Gastin
HASE
2007
IEEE
15 years 6 months ago
Pattern-Based Modeling and Analysis of Failsafe Fault-Tolerance in UML
In order to facilitate incremental modeling and analysis of fault-tolerant embedded systems, we introduce an object analysis pattern, called the detector pattern, that provides a ...
Ali Ebnenasir, Betty H. C. Cheng
IFIP
1998
Springer
15 years 4 months ago
Mobile agent technology in support of sales order processing in the virtual enterprise
The flexible integration of a range of disparate IT applications is a key requirement for today's global enterprises. The virtual enterprise, formed by a collection of collab...
Todd Papaioannou, John Edwards
ICS
2007
Tsinghua U.
15 years 6 months ago
Automatic nonblocking communication for partitioned global address space programs
Overlapping communication with computation is an important optimization on current cluster architectures; its importance is likely to increase as the doubling of processing power ...
Wei-Yu Chen, Dan Bonachea, Costin Iancu, Katherine...