On the public citation graph
Logical Control of Complex Resource Allocation Systems
0 signed · 122 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9780470182963openalex-snapshot
Approximate Dynamic Programming
inferredcites →https://doi.org/10.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/3-540-44919-1_17openalex-snapshot
On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems
inferredcites →https://doi.org/10.1007/978-0-387-68612-7openalex-snapshot
Introduction to Discrete Event Systems
inferredcites →https://doi.org/10.1007/978-1-4471-4276-8openalex-snapshot
Control of Discrete-Event Systems : Automata and Petri Net Perspectives
inferredcites →https://doi.org/10.1007/978-1-4612-2670-3_8openalex-snapshot
Scheduling Manufacturing Systems of Re-Entrant Lines
inferredcites →https://doi.org/10.1007/978-1-4615-5711-1openalex-snapshot
Supervisory Control of Discrete Event Systems Using Petri Nets
inferredcites →https://doi.org/10.1007/978-3-642-29072-5_8openalex-snapshot
A Petri Net Perspective on the Resource Allocation Problem in Software Engineering
inferredcites →https://doi.org/10.1007/bfb0013862openalex-snapshot
Queueing networks with finite capacities
inferredcites →https://doi.org/10.1007/s10626-012-0132-4openalex-snapshot
An algorithm to compute the minimal siphons in S 4 PR nets
inferredcites →https://doi.org/10.1007/s10626-012-0139-xopenalex-snapshot
Concurrency bugs in multithreaded software: modeling and analysis using Petri nets
inferredcites →https://doi.org/10.1007/s10626-014-0189-3openalex-snapshot
Performance optimization for a class of generalized stochastic Petri nets
inferredcites →https://doi.org/10.1007/s10626-014-0202-xopenalex-snapshot
Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks
inferredcites →https://doi.org/10.1007/s10626-015-0219-9openalex-snapshot
Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory
inferredcites →https://doi.org/10.1016/0005-1098(95)00103-4openalex-snapshot
Feedback control of petri nets based on place invariants
inferredcites →https://doi.org/10.1016/0278-6125(94)90028-0openalex-snapshot
Resolution of deadlocks in flexible manufacturing systems: Avoidance and recovery approaches
inferredcites →https://doi.org/10.1016/j.arcontrol.2016.04.009openalex-snapshot
Real-time management of complex resource allocation systems: Necessity, achievements and further challenges
inferredcites →https://doi.org/10.1016/j.automatica.2011.01.070openalex-snapshot
Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
inferredcites →https://doi.org/10.1016/j.automatica.2013.02.036openalex-snapshot
A distributed protocol for motion coordination in free-range vehicular systems
inferredcites →https://doi.org/10.1016/j.conengprac.2006.02.013openalex-snapshot
Efficient supervisory synthesis of large systems
inferredcites →https://doi.org/10.1016/s0005-1098(03)00176-6openalex-snapshot
Robustness of deadlock avoidance algorithms for sequential processes
inferredcites →https://doi.org/10.1023/a:1007937925728openalex-snapshot
Design Guidelines for Deadlock-Handling Strategies in Flexible Manufacturing Systems
inferredcites →https://doi.org/10.1023/a:1007969601583openalex-snapshot
The Application and Evaluation of Banker's Algorithm for Deadlock-Free Buffer Space Allocation in Flexible Manufacturing Systems
inferredcites →https://doi.org/10.1080/00207540010002405openalex-snapshot
Deadlock prevention policy based on Petri nets and siphons
inferredcites →https://doi.org/10.1080/00207540110118073openalex-snapshot
Event-based controller to avoid deadlock and collisions in zone-control AGVS
inferredcites →https://doi.org/10.1080/00207543.2013.807375openalex-snapshot
Robust supervisory control policy for avoiding deadlock in automated manufacturing systems with unreliable resources
inferredcites →https://doi.org/10.1080/07408170008967423openalex-snapshot
Conflict resolution in AGV systems
inferredcites →https://doi.org/10.1109/3477.875452openalex-snapshot
Comparing digraph and Petri net approaches to deadlock avoidance in FMS
inferredcites →https://doi.org/10.1109/5.21072openalex-snapshot
The control of discrete event systems
inferredcites →https://doi.org/10.1109/5.24143openalex-snapshot
Petri nets: Properties, analysis and applications
inferredcites →https://doi.org/10.1109/70.105378openalex-snapshot
Detection of deadlocks in flexible manufacturing cells
inferredcites →https://doi.org/10.1109/70.544768openalex-snapshot
Deadlock avoidance policies for automated manufacturing cells
inferredcites →https://doi.org/10.1109/70.585898openalex-snapshot
Event-based feedback control for deadlock avoidance in flexible production systems
inferredcites →https://doi.org/10.1109/70.63257openalex-snapshot
Deadlock prevention and deadlock avoidance in flexible manufacturing systems using Petri net models
inferredcites →https://doi.org/10.1109/70.63273openalex-snapshot
Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows
inferredcites →https://doi.org/10.1109/70.720355openalex-snapshot
A correct and scalable deadlock avoidance policy for flexible manufacturing systems
inferredcites →https://doi.org/10.1109/70.768182openalex-snapshot
Deadlock avoidance for production systems with flexible routing
inferredcites →https://doi.org/10.1109/9.481550openalex-snapshot
Deadlock avoidance policy for Petri-net modeling of flexible manufacturing systems with shared resources
inferredcites →https://doi.org/10.1109/9.481604openalex-snapshot
Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies
inferredcites →https://doi.org/10.1109/9.633824openalex-snapshot
Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
inferredcites →https://doi.org/10.1109/9.956052openalex-snapshot
Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
inferredcites →https://doi.org/10.1109/cdc.2012.6427075openalex-snapshot
Maximally permissive deadlock avoidance for sequential resource allocation systems using disjunctions of linear classifiers
inferredcites →https://doi.org/10.1109/cdc.2014.7040318openalex-snapshot
Symbolic computation and representation of deadlock avoidance policies for complex resource allocation systems with application to multithreaded software
inferredcites →https://doi.org/10.1109/coase.2016.7743492openalex-snapshot
Robust deadlock avoidance for sequential resource allocation systems with resource outages
inferredcites →https://doi.org/10.1109/mc.2009.391openalex-snapshot
Eliminating Concurrency Bugs with Control Engineering
inferredcites →https://doi.org/10.1109/mra.2015.2401295openalex-snapshot
Coordinating Autonomy: Sequential Resource Allocation Systems for Automation
inferredcites →https://doi.org/10.1109/tac.2006.875030openalex-snapshot
Nonblocking Supervisory Control of State Tree Structures
inferredcites →https://doi.org/10.1109/tac.2007.910701openalex-snapshot
Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems
inferredcites →https://doi.org/10.1109/tac.2008.929375openalex-snapshot
On the Liveness of Guidepath-Based, Zone-Controlled Dynamically Routed, Closed Traffic Systems
inferredcites →https://doi.org/10.1109/tac.2010.2046111openalex-snapshot
On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems
inferredcites →https://doi.org/10.1109/tac.2010.2095612openalex-snapshot
Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case
inferredcites →https://doi.org/10.1109/tac.2011.2179422openalex-snapshot
Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Nonlinear Case
inferredcites →https://doi.org/10.1109/tac.2012.2230814openalex-snapshot
Optimal Liveness-Enforcing Control for a Class of Petri Nets Arising in Multithreaded Software
inferredcites →https://doi.org/10.1109/tac.2013.2266952openalex-snapshot
Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms
inferredcites →https://doi.org/10.1109/tac.2014.2322991openalex-snapshot
On the Complexity of Some State-Counting Problems for Bounded Petri Nets
inferredcites →https://doi.org/10.1109/tac.2015.2389313openalex-snapshot
Design of Optimal Petri Net Controllers for Disjunctive Generalized Mutual Exclusion Constraints
inferredcites →https://doi.org/10.1109/tac.2015.2426232openalex-snapshot
SAT-Based Control of Concurrent Software for Deadlock Avoidance
inferredcites →https://doi.org/10.1109/tac.2016.2560536openalex-snapshot
Invariant-Based Supervisory Control of Switched Discrete Event Systems
inferredcites →https://doi.org/10.1109/tase.2005.849085openalex-snapshot
Relative Value Function Approximation for the Capacitated Re-Entrant Line Scheduling Problem
inferredcites →https://doi.org/10.1109/tase.2005.861397openalex-snapshot
Robust supervisory control for Production Systems with multiple resource failures
inferredcites →https://doi.org/10.1109/tase.2006.872106openalex-snapshot
A Necessary and Sufficient Condition for the Liveness and Reversibility of Process-Resource Nets With Acyclic, Quasi-live, Serializable, and Reversible Process Subnets
inferredcites →https://doi.org/10.1109/tase.2009.2022985openalex-snapshot
Correctness Verification of Generalized Algebraic Deadlock Avoidance Policies Through Mathematical Programming
inferredcites →https://doi.org/10.1109/tase.2011.2159112openalex-snapshot
A Practical Approach for Maximally Permissive Liveness-Enforcing Supervision of Complex Resource Allocation Systems
inferredcites →https://doi.org/10.1109/tase.2013.2266793openalex-snapshot
Efficient Enumeration of Minimal Unsafe States in Complex Resource Allocation Systems
inferredcites →https://doi.org/10.1109/tase.2014.2369858openalex-snapshot
A BDD-Based Approach for Designing Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1109/tcst.2011.2167150openalex-snapshot
A BDD-Based Approach for Modeling Plant and Supervisor by Extended Finite Automata
inferredcites →https://doi.org/10.1109/tcst.2012.2226034openalex-snapshot
Eliminating Concurrency Bugs in Multithreaded Software: A New Approach Based on Discrete-Event Control
inferredcites →https://doi.org/10.1109/tra.2002.805655openalex-snapshot
Process nets with resources for manufacturing modeling and their analysis
inferredcites →https://doi.org/10.1109/tra.2002.807555openalex-snapshot
Design of a live and maximally permissive petri net controller using the theory of regions
inferredcites →https://doi.org/10.1109/tra.2003.810577openalex-snapshot
A generalized stochastic petri net model for performance analysis and control of capacitated reentrant lines
inferredcites →https://doi.org/10.1109/tro.2010.2098270openalex-snapshot
Conflict Resolution in Free-Ranging Multivehicle Systems: A Resource Allocation Paradigm
inferredcites →https://doi.org/10.1109/tsmca.2003.820571openalex-snapshot
A Deadlock and Livelock Free Protocol for Decentralized Internet Resource Coallocation
inferredcites →https://doi.org/10.1109/tsmca.2011.2159590openalex-snapshot
A Method to Compute Strict Minimal Siphons in a Class of Petri Nets Based on Loop Resource Subsets
inferredcites →https://doi.org/10.1109/tsmca.2011.2162502openalex-snapshot
Liveness and Ratio-Enforcing Supervision of Automated Manufacturing Systems Using Petri Nets
inferredcites →https://doi.org/10.1109/tsmcc.2007.913920openalex-snapshot
A Survey and Comparison of Petri Net-Based Deadlock Prevention Policies for Flexible Manufacturing Systems
inferredcites →https://doi.org/10.1137/0207027openalex-snapshot
Deadlock Prediction: Easy and Difficult Cases
inferredcites →https://doi.org/10.1137/120866427openalex-snapshot
Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/356603.356607openalex-snapshot
Some Deadlock Properties of Computer Systems
inferredcites →https://doi.org/10.1147/sj.72.0074openalex-snapshot
Avoiding deadlock in multitasking systems
inferredcites →https://doi.org/10.1201/b16529-10openalex-snapshot
Structural Deadlock Prevention Policies for Flexible Manufacturing Systems
inferredcites →https://doi.org/10.1201/b16529-11openalex-snapshot
Deadlock Avoidance Policies in Production Systems by a Digraph Approach
inferredcites →https://doi.org/10.1214/aoap/1019487513openalex-snapshot
Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality
inferredcites →https://doi.org/10.1214/aoap/1019737665openalex-snapshot
Brownian models of open processing networks: canonical representation of workload
inferredcites →https://doi.org/10.1214/aoap/1177004828openalex-snapshot
On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models
inferredcites →https://doi.org/10.1287/opre.1040.0170openalex-snapshot
Maximum Pressure Policies in Stochastic Processing Networks
inferredcites →https://doi.org/10.2307/2370405openalex-snapshot
Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4471-5102-9_59-2openalex-snapshot
Applications of Discrete Event Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-25972-3_2openalex-snapshot
Different Types of Discrete-Time and Discrete-Space Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-30821-6_1openalex-snapshot
Introduction to Estimation and Inference in Discrete Event Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-44184-5_59openalex-snapshot
Applications of Discrete Event Systems
inferred← citeshttps://doi.org/10.1007/s10626-019-00289-7openalex-snapshot
Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling
inferred← citeshttps://doi.org/10.1007/s13198-023-01994-1openalex-snapshot
Simulation of Chinese language and literature online education based on dynamic heterogeneous scheduling algorithm
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.108777openalex-snapshot
On the state liveness of some classes of guidepath-based transport systems and its computational complexity
inferred← citeshttps://doi.org/10.1016/j.automatica.2024.111625openalex-snapshot
Liveness and deadlock-freeness verification and enforcement in bounded Petri nets using basis reachability graphs
inferred← citeshttps://doi.org/10.1016/j.chaos.2026.118744openalex-snapshot
Sequential Signal Masking: A nonlinear dynamical control model for parental resource allocation validated by longitudinal cohort data
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.09.001openalex-snapshot
Logical Control of Complex Resource Allocation Systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.04.075openalex-snapshot
Efficient Assessment of State Liveness in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-based Transport Systems: The General Case
inferred← citeshttps://doi.org/10.1016/j.ins.2024.121623openalex-snapshot
Configuration of liveness-enforcing initial marking with the minimum resources for resource allocation systems
inferred← citeshttps://doi.org/10.1109/access.2018.2866710openalex-snapshot
A Resource Allocation Approach for Enforcing Liveness on a Class of Petri Nets
inferred← citeshttps://doi.org/10.1109/access.2019.2948986openalex-snapshot
Maximal Good Step Graph Methods for Reducing the Generation of the State Space
inferred← citeshttps://doi.org/10.1109/access.2019.2960435openalex-snapshot
Enforcing the Liveness of S4PR by Using the Approach of Allocating Resources
inferred← citeshttps://doi.org/10.1109/cdc.2017.8264513openalex-snapshot
Solving the Lagrangian dual problem for some traffic coordination problems through linear programming
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619766openalex-snapshot
Maximal Linear Deadlock Avoidance Policies for Complex Resource Allocation Systems
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383816openalex-snapshot
Min-Time Coverage in Constricted Environments with Arbitrary Guidepath Networks
inferred← citeshttps://doi.org/10.1109/etfa.2019.8869229openalex-snapshot
Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/soli.2017.8120972openalex-snapshot
Optimized multi-agent routing in shared guidepath networks
inferred← citeshttps://doi.org/10.1109/tac.2020.3024480openalex-snapshot
Maximal Linear Deadlock Avoidance Policies for Sequential Resource Allocation Systems: Characterization, Computation, and Approximation
inferred← citeshttps://doi.org/10.1109/tase.2018.2798630openalex-snapshot
Optimized Multiagent Routing for a Class of Guidepath-Based Transport Systems
inferred← citeshttps://doi.org/10.1109/tase.2018.2859741openalex-snapshot
Throughput Maximization of Capacitated Re-Entrant Lines Through Fluid Relaxation
inferred← citeshttps://doi.org/10.1109/tase.2019.2905277openalex-snapshot
Structural Liveness Analysis of Automated Manufacturing Systems Modeled by S 4 PRs
inferred← citeshttps://doi.org/10.1109/tsmc.2020.2971455openalex-snapshot
Deadlock Prevention Controller for Automated Manufacturing Systems Modeled by S4PR
inferred← citeshttps://doi.org/10.1109/wodes69290.2026.11598208openalex-snapshot
Forbidden-State Supervisory Control of Safe Petri Nets
inferred← citeshttps://doi.org/10.23919/acc.2018.8431645openalex-snapshot
Throughput maximization of capacitated re-entrant lines through fluid relaxation
inferred← citeshttps://doi.org/10.31577/cai_2021_3_648openalex-snapshot
Modelling and Control of Resource Allocation Systems within Discrete Event Systems by Means of Petri Nets -- Part 1: Invariants, Siphons and Traps in Deadlock Avoidance
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.