A Scalable, Sound, Eventually-Complete Algorithm for Deadlock Immunity
Related publications (42)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We present a framework for distributed combinatorial optimization. The framework is implemented in Java, and simulates a multiagent environment in a single Java virtual machine. Each agent in the environment is executed asynchronously in a separate executi ...
When interfacing Java with other systems such as databases, programmers must often program in special interface languages like SQL. Code written in these languages often needs to be embedded in strings where they cannot be error-checked at compile-time, or ...
This book provides the conceptual foundation for the design and development of complex distributed and real-time applications. It summarizes a large spectrum of concepts; but by concentrating on Java and presenting mainly the programmatic aspects and basic ...
In this paper we present a toolset aimed at the analysis of programs written in Java and a new kind of active objects. The toolset detects if the program contains deadlocks and may provide a CCS description along with a labeled transition system of the pro ...
The execution of formal specifications is important for verification, validation and animation purposes. This thesis describes transformation of CO-OPN specifications in executable code. The original goal of this transformation was validation by prototypin ...
An algorithm for convex parametric QPs is studied. The algorithm explores the parameter space by stepping a sufficiently small distance over the facets of each critical region and thereby identifying the neighboring regions. Some conjectures concerning thi ...
Modelling complex concurrent systems is often difficult and error-prone, in particular when new concepts coming from advanced practical applications are considered. These new application domains include dynamicity, mobility, security, and localization depe ...
This paper studies the use of bytecode instruction counting (BIC) to estimate the CPU load due to the execution of Java programs in different environments. BIC is the basis of the J-RAF2 framework to monitor and control the resource consumption of Java cod ...
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security module. The security modules trust each other but can only communicate by exch ...
Modelling complex concurrent systems is often difficult and error-prone, in particular when new concepts coming from advanced practical applications are considered. These new application domains include dynamicity, mobility, security, and localization depe ...
