Sciweavers

369 search results - page 51 / 74
» Canonical finite state machines for distributed systems
Sort
View
CONCUR
2009
Springer
14 years 2 months ago
Reachability in Succinct and Parametric One-Counter Automata
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this paper we consider one-counter automata with counter updates encoded in binary—...
Christoph Haase, Stephan Kreutzer, Joël Ouakn...
PDP
2007
IEEE
14 years 1 months ago
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
Andreas Beckmann, Jorg Keller
IPPS
1999
IEEE
13 years 12 months ago
Developing Parallel Applications Using the JAVAPORTS Environment
The JavaPorts system is an environment that facilitates the rapid development of modular, reusable, Java-based parallel and distributed applications for networked machines with het...
Demetris G. Galatopoullos, Elias S. Manolakos
ICPADS
2006
IEEE
14 years 1 months ago
Flexible, Low-overhead Event Logging to Support Resource Scheduling
Flexible resource management and scheduling policies require detailed system-state information. Traditional, monolithic operating systems with a centralized kernel derive the requ...
Jan Stoess, Volkmar Uhlig
IPPS
2006
IEEE
14 years 1 months ago
Fault tolerance with real-time Java
After having drawn up a state of the art on the theoretical feasibility of a system of periodic tasks scheduled by a preemptive algorithm at fixed priorities, we show in this art...
Damien Masson, Serge Midonnet