Keyword : deadlock


The Liveness of WS3PR: Complexity and Decision
GuanJun LIU ChangJun JIANG MengChu ZHOU Atsushi OHTA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/08/01
Vol. E96-A  No. 8 ; pp. 1783-1793
Type of Manuscript:  PAPER
Category: Concurrent Systems
Keyword: 
concurrent systemsPetri netslivenessdeadlockresource allocation
 Summary | Full Text:PDF

Decomposition Approach of Banker's Algorithm: Design and Concurrency Analysis
Hoon OH 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2004/01/01
Vol. E87-D  No. 1 ; pp. 183-195
Type of Manuscript:  PAPER
Category: Software Systems
Keyword: 
deadlockconcurrencyheuristic algorithmdecomposition
 Summary | Full Text:PDF

Symbolic Model Checking of Deadlock Free Property of Task Control Architecture
Hiromi HIRAISHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2002/10/01
Vol. E85-D  No. 10 ; pp. 1579-1586
Type of Manuscript:  Special Section PAPER (Special Issue on Test and Verification of VLSI)
Category: Verification
Keyword: 
verificationsymbolic model checkingdeadlockrobot control programconcurrent process
 Summary | Full Text:PDF

Fair and Stable Resource Allocation Methods for Guaranteed Service
Kazumasa OIDA 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 2001/01/01
Vol. E84-B  No. 1 ; pp. 71-80
Type of Manuscript:  PAPER
Category: Internet
Keyword: 
guaranteed servicefairnessdeadlockRSVPadmission control
 Summary | Full Text:PDF

A New Approach for Protocol Synthesis Based on LOTOS
Bhed Bahadur BISTA Zixue CHENG Atsushi TOGASHI Norio SHIRATORI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1994/10/25
Vol. E77-A  No. 10 ; pp. 1646-1655
Type of Manuscript:  Special Section PAPER (Special Section on Net Theory and Its Applications)
Category: 
Keyword: 
protocolprotocol synthesisdeadlockFDTLOTOS
 Summary | Full Text:PDF

On the Complexity of Protocol Validation Problems for Protocols with Bounded Capacity Channels
Yoshiaki KAKUDA Yoshihiro TAKADA Tohru KIKUNO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1994/04/25
Vol. E77-A  No. 4 ; pp. 658-667
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
computational complexitydeadlockNP-completeprotocolprotocol validation
 Summary | Full Text:PDF