Sciweavers

1724 search results - page 154 / 345
» Models for Concurrency
Sort
View
169
Voted
IDEAS
1999
IEEE
166views Database» more  IDEAS 1999»
15 years 7 months ago
Recovery Protocols in Multi-Agent Probabilistic Reasoning Systems
In this paper, we introduce a probabilistic relational data model as the basis for developing multi-agent probabilistic reasoning systems. Since our model subsumes the traditional...
Cory J. Butz, S. K. Michael Wong

Book
301views
17 years 1 months ago
Simulating Humans: Computer Graphics, Animation, and Control
"This book is intended for human factors engineers requiring current knowledge of how a computer graphics surrogate human can augment their analyses of designed environments. ...
Norman I. Badler, Cary B. Phillips, Bonnie L. Webb...
125
Voted
SPIN
2009
Springer
15 years 10 months ago
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks
Abstract. We present a new decision procedure for detecting property violations in pushdown models for concurrent programs that use lock-based synchronization, where each thread’...
Nicholas Kidd, Peter Lammich, Tayssir Touili, Thom...
PROCOMET
1998
15 years 4 months ago
Bisimulations in the join-calculus
We develop a theory of bisimulations in the join-calculus. We introduce a refined operational model that makes interactions with the environment explicit, and discuss the impact o...
Michele Boreale, Cédric Fournet, Cosimo Lan...
TAAS
2008
70views more  TAAS 2008»
15 years 3 months ago
A general characterization of indulgence
characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several result...
Rachid Guerraoui, Nancy A. Lynch