Sciweavers

314 search results - page 37 / 63
» Concurrently Decomposable Constraint Systems
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Modeling task allocation using a decision theoretic model
Mediation is the process of decomposing a task into subtasks, finding agents suitable for these subtasks and negotiating with agents to obtain commitments to execute these subtas...
Sherief Abdallah, Victor R. Lesser
INFOCOM
2006
IEEE
14 years 1 months ago
Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems
We consider a class of queueing networks referred to as “generalized constrained queueing networks” which form the basis of several different communication networks and inform...
Prasanna Chaporkar, Saswati Sarkar
RISE
2004
Springer
14 years 1 months ago
A Symbolic Model Checker for tccp Programs
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
María Alpuente, Moreno Falaschi, Alicia Vil...
SRDS
1999
IEEE
13 years 12 months ago
Formal Hazard Analysis of Hybrid Systems in cTLA
Hybrid systems like computer-controlled chemical plants are typical safety critical distributed systems. In present practice, the safety of hybrid systems is guaranteed by hazard ...
Peter Herrmann, Heiko Krumm
ICFEM
2000
Springer
13 years 11 months ago
Using Use Cases in Executable Z
Use Cases are a wide-spread informal method for specifying the requirements of a technical system in the early development phase. Z is a formal notation which aims to support, bes...
Wolfgang Grieskamp, Markus Lepper