Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,175,506 papers from all fields of science
Search
Sign In
Create Free Account
Deadlock
Known as:
Deadlocks
, Live-locks
, Coffman conditions
Expand
In concurrent computing, a deadlock occurs when two competing actions wait for the other to finish, and thus neither ever does. Deadlock is a common…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Absolute probability judgement
Abstract Window Toolkit
Banker's algorithm
Barrel processor
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
An ASM-based Model for Grid Job Management
A. Bianchi
,
Luciano Manelli
,
S. Pizzutilo
Informatica
2013
Corpus ID: 9266311
State Machine, ASM for short, is a powerful computational model [34], which has been successfully applied in several cases for…
Expand
2011
2011
D ESIGN AND S IMULATION OF AN I NTELLIGENT T RAFFIC C ONTROL S YSTEM
Osigwe Uchenna Chinyere
,
Oladipo Onaolapo Francisca
,
Onibere Emmanuel Amano
2011
Corpus ID: 212453110
This paper described our research experiences of building an intelligent system to monitor and control road traffic in a Nigerian…
Expand
2003
2003
Synthesizing SDL from Use Case Maps: An Experiment
Yong He
,
Daniel Amyot
,
A. Williams
SDL Forum
2003
Corpus ID: 18062020
The Use Case Map (UCM) notation is part of the User Requirements Notation (URN), the most recent addition to ITU-T's family of…
Expand
2002
2002
Dynamic end-to-end QoS management middleware for distributed multimedia systems
D. Ecklund
,
Vera Goebel
,
T. Plagemann
,
E. Ecklund
Multimedia Systems
2002
Corpus ID: 10396703
Abstract. In this paper, we present a separable, reusable middleware solution that provides coordinated, end-to-end QoS…
Expand
2002
2002
Software Tools for the Supervisory Control of Petri Nets Based on Place Invariants
M. V. Iordache
,
P. Antsaklis
2002
Corpus ID: 6701505
A computationally efficient method for constructing Petri net controllers is presented. The method is derived using place…
Expand
1998
1998
Control Laws, Tasks and Procedures with Orccad: Application to the Control of an Underwater Arm
Daniel Simon
,
K. Kapellos
,
B. Espiau
International Journal of Systems Science
1998
Corpus ID: 11389430
Software reliability is a major issue in the design of control architecture for robots operating in hostile or poorly known…
Expand
1997
1997
Distributed Wireless Channel Allocation in Cellular Systems with Mobile Base Stations
R. Prakash
1997
Corpus ID: 14306350
Most existing models describe a mobile computing system as a network of mobile nodes and stationary nodes [3]. The geographical…
Expand
1994
1994
Maintaining Global Assertions on Distributed Systems
Alexander I. Tomlinson
,
V. Garg
1994
Corpus ID: 971781
This paper develops a method for maintaining global assertions on a network of distributed processes. The global assertion has…
Expand
1992
1992
Mesh and Torus Chaotic Routing
K. Bolding
,
L. Snyder
1992
Corpus ID: 15303473
The chaos router is an adaptive nonminimal message router for multicomputers that is simple enough to compete with the fast…
Expand
1985
1985
Splicing Plans to Achieve Misordered Goals
S. Vere
International Joint Conference on Artificial…
1985
Corpus ID: 42468789
Most parallel planners are sensitive to the order in which goals and activity preconditions are specified. A "wrong" ordering can…
Expand