scientific article; zbMATH DE number 3359777
From MaRDI portal
Publication:5633643
Cited in
(40)- Resource Allocation Systems: Some Complexity Results on the S4PR Class
- Probabilistic models of computer deadlock
- Analysis of multi-stage open shop processing systems
- Algorithmic type checking for a pi-calculus with name matching and session types
- Reduzierung von Prozeßstauungen vor kritischen Abschnitten mittels Teillistensperrung
- The geometry of conservative programs
- A minimal property for characterizing deadlock-free programs
- Maximally permissive Petri net supervisors for flexible manufacturing systems with uncontrollable and unobservable transitions
- Real-time deadlock-free scheduling for semiconductor track systems based on colored timed Petri nets
- Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
- Secure and conditional resource coordination for successful collaborations
- A multistep look-ahead deadlock avoidance policy for automated manufacturing systems
- Dispatching and coordination in multi-area railway traffic management
- Unique decomposition of homogeneous languages and application to isothetic regions
- A Class of Well Structured Petri Nets for Flexible Manufacturing Systems
- A characterization of database graphs admitting a simple locking protocol
- Topological rewriting and the geometrization of programming
- Time efficient deadlock resolution algorithms
- The Banker's problem with precedences
- And/or-convexity: a graph convexity based on processes and deadlock models
- Modelling deadlock in open restricted queueing networks
- Design of optimal Petri net supervisors for flexible manufacturing systems via weighted inhibitor arcs
- Stochastic modelling of flexible manufacturing systems
- Effective deadlock resolution with self-interested partially-rational agents
- A model for deadlock detection based on automata and languages theory
- Liveness of an extended S\(^{3}\)PR
- Methods and means of parallel processing of information
- Deadlock resolution in wait-for graphs by vertex/arc deletion
- Structure reduction of liveness-enforcing Petri nets using mixed integer programming
- Deadlock checking by data race detection
- Causing communication closure: safe program composition with reliable non-FIFO channels
- Effect-polymorphic behaviour inference for deadlock checking
- Deadlock checking by a behavioral effect system for lock handling
- Natural Homology
- On structural minimality of optimal supervisors for flexible manufacturing systems
- Fast decentralized algorithms for resolving conflicts and deadlocks in resource allocation in data processing and control systems
- Maximally permissive liveness-enforcing supervisor with lowest implementation cost for flexible manufacturing systems
- Deadlock handling for real-time control of AGVs at automated container terminals
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
- Directed homology theories and Eilenberg-Steenrod axioms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5633643)
