Turbocharging Boosted Transactions or: How I Learnt to Stop Worrying and Love Longer TransactionsKULKARNI, Chinmay; UNSAL, Osman; CRISTAL, Adrian et al.ACM SIGPLAN notices. 2009, Vol 44, Num 4, pp 307-308, issn 1523-2867, 2 p.Conference Paper

An evaluation of deadlock-handling strategies in semiconductor cluster toolsVENKATESH, Srilakshmi; SMITH, Jeffrey S.IEEE transactions on semiconductor manufacturing. 2005, Vol 18, Num 1, pp 197-201, issn 0894-6507, 5 p.Article

On characterization and correctness of distributed deadlock detectionKSHEMKALYANI, A. D; MUKESH SINGHAL.Journal of parallel and distributed computing (Print). 1994, Vol 22, Num 1, pp 44-59, issn 0743-7315Article

An effective routing algorithm in incomplete hypercubesSHU-HUA HU; HSING-LUNG CHEN.Parallel computing. 1994, Vol 20, Num 12, pp 1721-1738, issn 0167-8191Article

Reverse reachability analysis: a new technique for deadlock detection on communicating finite state machinesYUNG-CHEN HUNG; GEN-HUEY CHEN.Software, practice & experience. 1993, Vol 23, Num 9, pp 965-979, issn 0038-0644Article

False deadlock detection in distributed systemsWUU, G. T; BERNSTEIN, A. J.IEEE transactions on software engineering. 1985, Vol 11, Num 8, pp 820-821, issn 0098-5589Article

Searching for deadlocks while debugging Concurrent Haskell programsCHRISTIANSEN, Jan; HUCH, Frank.ACM SIGPLAN notices. 2004, Vol 39, Num 9, pp 28-39, issn 1523-2867, 12 p.Conference Paper

Deadlocks and dihomotopy in mutual exclusion modelsRAUSSEN, Martin.Theoretical computer science. 2006, Vol 365, Num 3, pp 247-257, issn 0304-3975, 11 p.Conference Paper

Some investigations on deadlock freedom issues of a cyclically connected system using dijkstra's weakest precondition calculusBANERJEE, Jayasri; ANUP KUMAR BANDYOPADHYAY; AJIT KUMAR MANDAL et al.ACM SIGPLAN notices. 2007, Vol 42, Num 5, pp 10-15, issn 1523-2867, 6 p.Article

Deadlock-free multicasting in irregular networks using prefix routingJIE WU; LI SHENG.Journal of supercomputing. 2005, Vol 31, Num 1, pp 63-78, issn 0920-8542, 16 p.Article

Searching strict minimal siphons for SNC-based resource allocation systemsCHAO, Daniel Yuh.Journal of information science and engineering. 2007, Vol 23, Num 3, pp 853-867, issn 1016-2364, 15 p.Article

adaptive deadlock- and livelock-free routing with all minimal paths in torus networksGRAVANO, L; PIFARRE, G. D; BERMAN, P. E et al.IEEE transactions on parallel and distributed systems. 1994, Vol 5, Num 12, pp 1233-1251, issn 1045-9219Article

A New Modified Reachability Tree Approach and Its Applications to Unbounded Petri NetsSHOUGUANG WANG; MENGCHU ZHOU; ZHIWU LI et al.IEEE transactions on systems, man, and cybernetics. Systems (Print). 2013, Vol 43, Num 4, pp 932-940, issn 2168-2216, 9 p.Article

Deadlock-free routing in irregular networks using prefix routingJIE WU; LI SHENG.Parallel processing letters. 2003, Vol 13, Num 4, pp 705-720, issn 0129-6264, 16 p.Article

Reaching more states for control of FMSYUH CHAO, Daniel.International journal of production research. 2010, Vol 48, Num 3-4, pp 1217-1220, issn 0020-7543, 4 p.Article

A graphic-algebraic computation of elementary siphons of BS³PRYUH CHAO, Daniel.Journal of information science and engineering. 2007, Vol 23, Num 6, pp 1817-1831, issn 1016-2364, 15 p.Article

Information structures, causality, and nonsequential stochastic control. I : Design-independent propertiesANDERSLAND, M. S; TENEKETZIS, D.SIAM journal on control and optimization. 1992, Vol 30, Num 6, pp 1447-1475, issn 0363-0129Article

Deadlock Control for Weighted Systems of Simple Sequential Processes with Resources Requirement (WS³PR)CHAO, Daniel Yuh.Journal of information science and engineering. 2009, Vol 25, Num 6, pp 1963-1977, issn 1016-2364, 15 p.Article

Predicting deadlock in store-and-forward networksARBIB, C; ITALIANO, G. F; PANCONESI, A et al.Networks (New York, NY). 1990, Vol 20, Num 7, pp 861-881, issn 0028-3045Article

On buffer-economical store-and-forward deadlock preventionAWERBUCH, B; KUTTEN, S; PELEG, D et al.IEEE transactions on communications. 1994, Vol 42, Num 11, pp 2934-2937, issn 0090-6778Article

Max'-controlled siphons for liveness of S³PGR²CHAO, D. Y.IET control theory & applications (Print). 2007, Vol 1, Num 4, pp 933-936, issn 1751-8644, 4 p.Article

Generalized conditions for liveness enforcement and deadlock prevention in Petri netsIORDACHE, Marian V; ANTSAKLIS, Panos J.Lecture notes in computer science. 2001, pp 184-203, issn 0302-9743, isbn 3-540-42252-8Conference Paper

Parallel discrete event simulation using shared memoryREED, D. A; MALONY, A. D; MCCREDIE, B. D et al.IEEE transactions on software engineering. 1988, Vol 14, Num 4, pp 541-553, issn 0098-5589Article

A distributed scheme for detecting communication deadlocksNATARAJAN, N.IEEE transactions on software engineering. 1986, Vol 12, Num 4, pp 531-537, issn 0098-5589Article

On the equivalence between liveness and deadlock-freeness in petri netsBARKAOUI, Kamel; COUVREUR, Jean-Michel; KLAI, Kais et al.Lecture notes in computer science. 2005, pp 90-107, issn 0302-9743, isbn 3-540-26301-2, 18 p.Conference Paper