The following pages link to Spyros A. Reveliotis (Q1412281):
Displaying 39 items.
- (Q312652) (redirect page) (← links)
- Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory (Q312653) (← links)
- A distributed protocol for motion coordination in free-range vehicular systems (Q522801) (← links)
- Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints (Q763409) (← links)
- Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements (Q977005) (← links)
- On the optimality of randomized deadlock avoidance policies (Q1412282) (← links)
- Real-time management of resource allocation systems. A discrete event systems approach. (Q1769928) (← links)
- On the state liveness of some classes of guidepath-based transport systems and its computational complexity (Q2173958) (← links)
- Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling (Q2177767) (← links)
- Efficient generation of performance bounds for a class of traffic scheduling problems (Q2286334) (← links)
- Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks (Q2348357) (← links)
- Performance optimization for a class of generalized stochastic Petri nets (Q2348377) (← links)
- Concurrency bugs in multithreaded software: modeling and analysis using Petri nets (Q2393141) (← links)
- Efficient PAC learning for episodic tasks with acyclic state spaces (Q2465672) (← links)
- Polynomial-time optimal liveness enforcement for guidepath-based transport systems (Q2665316) (← links)
- Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights (Q2840155) (← links)
- On the “Counter-Example” in the Article “Max $^{\prime}$-Controlled Siphons for Liveness of $S^{3}PGR^{2}$” Regarding the Results in “Deadlock Avoidance in Sequential Resource Allocation Systems With Multiple Resource Acquisitions and Flexible R (Q2980716) (← links)
- On the Complexity of Some State-Counting Problems for Bounded Petri Nets (Q2982896) (← links)
- On the Linear Separability of the Safe and Unsafe State Subsets of Single-Unit Resource Allocation Systems (Q2983041) (← links)
- Invariant-Based Supervisory Control of Switched Discrete Event Systems (Q2989603) (← links)
- (Q3152841) (← links)
- On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems (Q3550619) (← links)
- Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions (Q3618711) (← links)
- The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks (Q4507079) (← links)
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings (Q4540213) (← links)
- Correction to the RUN DAP for conjunctive RAS presented in "Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems" (Q4540370) (← links)
- (Q4782037) (← links)
- Maximal Linear Deadlock Avoidance Policies for Sequential Resource Allocation Systems: Characterization, Computation, and Approximation (Q4957686) (← links)
- On the Liveness of Guidepath-Based, Zone-Controlled Dynamically Routed, Closed Traffic Systems (Q4974292) (← links)
- Optimal Node Visitation in Stochastic Digraphs (Q4974402) (← links)
- On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems (Q4978874) (← links)
- Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems (Q5125712) (← links)
- Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems (Q5282318) (← links)
- Eliminating Concurrency Bugs in Multithreaded Software: An Approach Based on Control of Petri Nets (Q5300863) (← links)
- Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case (Q5347802) (← links)
- Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Nonlinear Case (Q5352870) (← links)
- Optimal Liveness-Enforcing Control for a Class of Petri Nets Arising in Multithreaded Software (Q5353204) (← links)
- Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms (Q5353394) (← links)
- A strong combinatorial relaxation for the problem of min-time coverage in constricted environments (Q6588574) (← links)
