scientific article; zbMATH DE number 3359777

zbMath0226.68015MaRDI QIDQ5633643

M. J. Elphick, Arie Shoshani, Edward G. jun. Coffman

Publication date: 1971

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of operating systems (68N25)

Related Items

A model for deadlock detection based on automata and languages theory ⋮ Natural Homology ⋮ Causing communication closure: safe program composition with reliable non-FIFO channels ⋮ And/or-convexity: a graph convexity based on processes and deadlock models ⋮ Real-time deadlock-free scheduling for semiconductor track systems based on colored timed Petri nets ⋮ Effect-polymorphic behaviour inference for deadlock checking ⋮ On structural minimality of optimal supervisors for flexible manufacturing systems ⋮ Design of Optimal Petri Net Supervisors for Flexible Manufacturing Systems via Weighted Inhibitor Arcs ⋮ Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving ⋮ Deadlock resolution in wait-for graphs by vertex/arc deletion ⋮ A characterization of database graphs admitting a simple locking protocol ⋮ Directed homology theories and Eilenberg-Steenrod axioms ⋮ Deadlock handling for real-time control of AGVs at automated container terminals ⋮ Methods and means of parallel processing of information ⋮ Analysis of multi-stage open shop processing systems ⋮ Algorithmic type checking for a pi-calculus with name matching and session types ⋮ Deadlock checking by a behavioral effect system for lock handling ⋮ Fast decentralized algorithms for resolving conflicts and deadlocks in resource allocation in data processing and control systems ⋮ Deadlock checking by data race detection ⋮ Unique decomposition of homogeneous languages and application to isothetic regions ⋮ Topological rewriting and the geometrization of programming ⋮ Maximally permissive liveness-enforcing supervisor with lowest implementation cost for flexible manufacturing systems ⋮ Stochastic modelling of flexible manufacturing systems ⋮ Modelling deadlock in open restricted queueing networks ⋮ Structure reduction of liveness‐enforcing Petri nets using mixed integer programming ⋮ Effective deadlock resolution with self-interested partially-rational agents ⋮ Dispatching and coordination in multi-area railway traffic management ⋮ Maximally Permissive Petri Net Supervisors for Flexible Manufacturing Systems with Uncontrollable and Unobservable Transitions ⋮ Liveness of an extended S\(^{3}\)PR ⋮ The Banker's problem with precedences ⋮ Probabilistic models of computer deadlock ⋮ Reduzierung von Prozeßstauungen vor kritischen Abschnitten mittels Teillistensperrung ⋮ Resource Allocation Systems: Some Complexity Results on the S4PR Class ⋮ The geometry of conservative programs ⋮ A multistep look-ahead deadlock avoidance policy for automated manufacturing systems ⋮ Secure and Conditional Resource Coordination for Successful Collaborations ⋮ Time efficient deadlock resolution algorithms ⋮ Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks ⋮ A minimal property for characterizing deadlock-free programs

This page was built for publication: