Spyros A. Reveliotis

Orcid: 0000-0001-6176-0925

Affiliations:
  • Georgia Institute of Technology, Atlanta, USA


According to our database1, Spyros A. Reveliotis authored at least 113 papers between 1991 and 2024.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2015, "For contributions to discrete event systems for resource allocation".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Strong Combinatorial Relaxation for the Problem of Min-Time Coverage in Constricted Environments.
IEEE Trans. Autom. Control., May, 2024

2023
A streamlined heuristic for the problem of Min-Time Coverage in Constricted Environments (Extended Abstract).
Proceedings of the 28th IEEE International Conference on Emerging Technologies and Factory Automation, 2023

Min-Time Coverage in Constricted Environments with Arbitrary Guidepath Networks.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022
Min-Time Coverage in Constricted Environments: Problem Formulations and Complexity Analysis.
IEEE Trans. Control. Netw. Syst., 2022

Assessing and Restoring "Traffic-State Order" in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems.
IEEE Trans Autom. Sci. Eng., 2022

2021
Maximal Linear Deadlock Avoidance Policies for Sequential Resource Allocation Systems: Characterization, Computation, and Approximation.
IEEE Trans. Autom. Control., 2021

2020
An MPC Scheme for Traffic Coordination in Open and Irreversible, Zone-Controlled, Guidepath-Based Transport Systems.
IEEE Trans Autom. Sci. Eng., 2020

Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems.
IEEE Trans. Autom. Control., 2020

On the state liveness of some classes of guidepath-based transport systems and its computational complexity.
Autom., 2020

2019
A Correction and Some Comments on the Article "Polynomially Complex Synthesis of Distributed Supervisors for Large-Scale AMSs Using Petri Nets".
IEEE Trans. Control. Syst. Technol., 2019

Throughput Maximization of Capacitated Re-Entrant Lines Through Fluid Relaxation.
IEEE Trans Autom. Sci. Eng., 2019

Optimized Multiagent Routing for a Class of Guidepath-Based Transport Systems.
IEEE Trans Autom. Sci. Eng., 2019

Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling.
Discret. Event Dyn. Syst., 2019

Efficient generation of performance bounds for a class of traffic scheduling problems.
Discret. Event Dyn. Syst., 2019

Some new results on the state liveness of open guidepath-based traffic systems.
Proceedings of the 27th Mediterranean Conference on Control and Automation, 2019

Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling (Extended Abstract).
Proceedings of the 24th IEEE International Conference on Emerging Technologies and Factory Automation, 2019

2018
Maximal Linear Deadlock Avoidance Policies for Complex Resource Allocation Systems.
Proceedings of the 57th IEEE Conference on Decision and Control, 2018

Preservation of Traffic Liveness in MPC Schemes for Guidepath-based Transport Systems.
Proceedings of the 14th IEEE International Conference on Automation Science and Engineering, 2018

2017
Robust Deadlock Avoidance for Sequential Resource Allocation Systems With Resource Outages.
IEEE Trans Autom. Sci. Eng., 2017

Invariant-Based Supervisory Control of Switched Discrete Event Systems.
IEEE Trans. Autom. Control., 2017

Logical Control of Complex Resource Allocation Systems.
Found. Trends Syst. Control., 2017

Optimized multi-agent routing in shared guidepath networks.
Proceedings of the 2017 IEEE International Conference on Service Operations and Logistics, 2017

Solving the Lagrangian dual problem for some traffic coordination problems through linear programming.
Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017

2016
On the "Counter-Example" in the Article "Max'-Controlled Siphons for Liveness of S<sup>3</sup>PGR<sup>2</sup>" Regarding the Results in "Deadlock Avoidance in Sequential Resource Allocation Systems With Multiple Resource Acquisitions and Flexible Routings".
IEEE Trans. Autom. Control., 2016

Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory.
Discret. Event Dyn. Syst., 2016

Real-time management of complex resource allocation systems: Necessity, achievements and further challenges.
Annu. Rev. Control., 2016

Some novel traffic coordination problems and their analytical study based on Lagrangian Duality theory.
Proceedings of the 55th IEEE Conference on Decision and Control, 2016

2015
Applications of Discrete Event Systems.
Proceedings of the Encyclopedia of Systems and Control, 2015

A BDD-Based Approach for Designing Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems.
IEEE Trans Autom. Sci. Eng., 2015

On the Complexity of Some State-Counting Problems for Bounded Petri Nets.
IEEE Trans. Autom. Control., 2015

Coordinating Autonomy: Sequential Resource Allocation Systems for Automation.
IEEE Robotics Autom. Mag., 2015

Maximally permissive deadlock avoidance for resource allocation systems with R/W-locks.
Discret. Event Dyn. Syst., 2015

Performance optimization for a class of generalized stochastic Petri nets.
Discret. Event Dyn. Syst., 2015

Symbolic computation of boundary unsafe states in complex resource allocation systems using partitioning techniques.
Proceedings of the IEEE International Conference on Automation Science and Engineering, 2015

2014
Efficient Enumeration of Minimal Unsafe States in Complex Resource Allocation Systems.
IEEE Trans Autom. Sci. Eng., 2014

Guest Editorial Special Section on Advances in Discrete-Event Systems for Automation.
IEEE Trans Autom. Sci. Eng., 2014

On the Linear Separability of the Safe and Unsafe State Subsets of Single-Unit Resource Allocation Systems.
IEEE Trans. Autom. Control., 2014

A Symbolic Approach for Maximally Permissive Deadlock Avoidance in Complex Resource Allocation Systems.
Proceedings of the 12th International Workshop on Discrete Event Systems, 2014

Symbolic computation and representation of deadlock avoidance policies for complex resource allocation systems with application to multithreaded software.
Proceedings of the 53rd IEEE Conference on Decision and Control, 2014

2013
Eliminating Concurrency Bugs in Multithreaded Software: A New Approach Based on Discrete-Event Control.
IEEE Trans. Control. Syst. Technol., 2013

Optimal Liveness-Enforcing Control for a Class of Petri Nets Arising in Multithreaded Software.
IEEE Trans. Autom. Control., 2013

Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms.
IEEE Trans. Autom. Control., 2013

Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights.
SIAM J. Control. Optim., 2013

Concurrency bugs in multithreaded software: modeling and analysis using Petri nets.
Discret. Event Dyn. Syst., 2013

A distributed protocol for motion coordination in free-range vehicular systems.
Autom., 2013

Eliminating Concurrency Bugs in Multithreaded Software: An Approach Based on Control of Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

2012
Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Nonlinear Case.
IEEE Trans. Autom. Control., 2012

On atomicity enforcement in concurrent software via Discrete Event Systems theory.
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

Maximally permissive deadlock avoidance for sequential resource allocation systems using disjunctions of linear classifiers.
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

An efficient algorithm for the enumeration of the minimal unsafe states in complex resource allocation systems.
Proceedings of the 2012 IEEE International Conference on Automation Science and Engineering, 2012

2011
Conflict Resolution in Free-Ranging Multivehicle Systems: A Resource Allocation Paradigm.
IEEE Trans. Robotics, 2011

A Practical Approach for Maximally Permissive Liveness-Enforcing Supervision of Complex Resource Allocation Systems.
IEEE Trans Autom. Sci. Eng., 2011

Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case.
IEEE Trans. Autom. Control., 2011

Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints.
Discret. Event Dyn. Syst., 2011

Deadlock-avoidance control of multithreaded software: An efficient siphon-based algorithm for Gadara petri nets.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

Designing maximally permissive deadlock avoidance policies for sequential resource allocation systems through classification theory.
Proceedings of the IEEE Conference on Automation Science and Engineering, 2011

2010
Correctness Verification of Generalized Algebraic Deadlock Avoidance Policies Through Mathematical Programming.
IEEE Trans Autom. Sci. Eng., 2010

On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems.
IEEE Trans. Autom. Control., 2010

Supervisory control of software execution for failure avoidance: Experience from the Gadara project.
Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

Optimal deadlock avoidance for complex resource allocation systems through classification theory.
Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

Establishing the NP-hardness of maximally permissive RAS-based approaches to multi-vehicle system safety.
Proceedings of the IEEE International Conference on Robotics and Automation, 2010

Synthesis of maximally-permissive liveness-enforcing control policies for Gadara petri nets.
Proceedings of the 49th IEEE Conference on Decision and Control, 2010

A practical approach to the design of maximally permissive liveness-enforcing supervisors for complex resource allocation systems.
Proceedings of the IEEE Conference on Automation Science and Engineering, 2010

2009
Optimal Node Visitation in Acyclic Stochastic Digraphs with Multi-threaded Traversals and Internal Visitation Requirements.
Discret. Event Dyn. Syst., 2009

Gadara nets: Modeling and analyzing lock allocation for deadlock avoidance in multithreaded software.
Proceedings of the 48th IEEE Conference on Decision and Control, 2009

Maximally permissive deadlock avoidance for multithreaded computer programs (Extended abstract).
Proceedings of the IEEE Conference on Automation Science and Engineering, 2009

Customized learning algorithms for episodic tasks with acyclic state spaces.
Proceedings of the IEEE Conference on Automation Science and Engineering, 2009

2008
On the Liveness of Guidepath-Based, Zone-Controlled Dynamically Routed, Closed Traffic Systems.
IEEE Trans. Autom. Control., 2008

Optimal Node Visitation in Stochastic Digraphs.
IEEE Trans. Autom. Control., 2008

Conflict resolution in multi-vehicle systems: A resource allocation paradigm.
Proceedings of the 2008 IEEE International Conference on Automation Science and Engineering, 2008

2007
Implicit Siphon Control and Its Role in the Liveness-Enforcing Supervision of Sequential Resource Allocation Systems.
IEEE Trans. Syst. Man Cybern. Part A, 2007

Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems.
IEEE Trans. Autom. Control., 2007

Efficient PAC Learning for Episodic Tasks with Acyclic State Spaces.
Discret. Event Dyn. Syst., 2007

2006
A Necessary and Sufficient Condition for the Liveness and Reversibility of Process-Resource Nets With Acyclic, Quasi-live, Serializable, and Reversible Process Subnets.
IEEE Trans Autom. Sci. Eng., 2006

Efficient learning algorithms for episodic tasks with acyclic state spaces.
Proceedings of the 2006 IEEE International Conference on Automation Science and Engineering, 2006

Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions.
Proceedings of the Petri Nets and Other Models of Concurrency, 2006

2005
Relative value function approximation for the capacitated re-entrant line scheduling problem.
IEEE Trans Autom. Sci. Eng., 2005

A linear characterization of the Petri net reachability space corresponding to bounded-length fireable transition sequences and its implications for the structural analysis of process-resource nets with acyclic, quasi-live and strongly reversible process subnets.
Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

2004
Modelling and Controlling Uncertainty in Optimal Disassembly Planning through Reinforcement Learning.
Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

Relative value function approximation for the capacitated re-entrant line scheduling problem: an experimental investigation.
Proceedings of the 43rd IEEE Conference on Decision and Control, 2004

2003
A generalized stochastic Petri net model for performance analysis and control of capacitated reentrant lines.
IEEE Trans. Robotics Autom., 2003

On the Optimality of Randomized Deadlock Avoidance Policies.
Discret. Event Dyn. Syst., 2003

Structural analysis of resource allocation systems with synchronization constraints.
Proceedings of the 2003 IEEE International Conference on Robotics and Automation, 2003

Liveness enforcing supervision for resource allocation systems with process synchronizations.
Proceedings of the 42nd IEEE Conference on Decision and Control, 2003

On the Siphon-Based Characterization of Liveness in Sequential Resource Allocation Systems.
Proceedings of the Applications and Theory of Petri Nets 2003, 2003

2002
Policy mixtures: a novel approach for enhancing the operational flexibility of resource allocation systems with alternate routings.
IEEE Trans. Robotics Autom., 2002

Liveness-enforcing supervision for resource allocation systems with uncontrollable behavior and forbidden states.
IEEE Trans. Robotics Autom., 2002

A distributed, event-driven control architecture for flexibly automated manufacturing systems.
Int. J. Comput. Integr. Manuf., 2002

Liveness Enforcing Supervision for Resource Allocation Systems with Forbidden States and Uncontrollable Events.
Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

An Analytical Investigation of the Scheduling Problem for Capacitated Re-Entrant Lines.
Proceedings of the 2002 IEEE International Conference on Robotics and Automation, 2002

2001
Correction to the RUN DAP for conjunctive RAS presented in "Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems".
IEEE Trans. Autom. Control., 2001

Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings.
IEEE Trans. Autom. Control., 2001

High-fidelity rapid prototyping of 300 mm fabs through discrete event system modeling.
Comput. Ind., 2001

A high-fidelity, web-based simulator for 300 mm wafer fabs.
Proceedings of the IEEE International Conference on Systems, 2001

A Colored Petri Net-based Approach to the Design of 300mm Wafer Fab Controllers.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

Algebraic Deadlock Avoidance Policies for Conjunctive / Disjunctive resource Allocation Systems.
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, 2001

2000
Avoidance versus detection and recovery problem in buffer-space allocation of flexibly automated production systems.
IEEE Trans. Syst. Man Cybern. Part B, 2000

Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems.
IEEE Trans. Robotics Autom., 2000

The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks.
IEEE Trans. Autom. Control., 2000

Enhancing the Flexibility of Algebraic Deadlock Avoidance Policies through Petri Net Structural Analysis.
Proceedings of the 2000 IEEE International Conference on Robotics and Automation, 2000

A polynomial-complexity deadlock avoidance policy for sequential resource allocation systems with multiple resource acquisitions and flexible routings.
Proceedings of the 39th IEEE Conference on Decision and Control, 2000

1999
Accommodating FMS operational contingencies through routing flexibility.
IEEE Trans. Robotics Autom., 1999

Production Planning and Control in Flexibly Automated Manufacturing Systems: Current Status and Future Requirements.
Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999

1998
A correct and scalable deadlock avoidance policy for flexible manufacturing systems.
IEEE Trans. Robotics Autom., 1998

Variations of Banker's algorithm for highly flexible resource allocation systems.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

1997
Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems.
IEEE Trans. Autom. Control., 1997

A polynomial-complexity tool for evaluating the performance of structurally controlled FMS.
Proceedings of the 1997 IEEE International Conference on Robotics and Automation, 1997

1996
Deadlock avoidance policies for automated manufacturing cells.
IEEE Trans. Robotics Autom., 1996

An analytical framework for evaluating and optimizing the performance of structurally controlled flexible manufacturing systems.
Proceedings of the 1996 IEEE International Conference on Robotics and Automation, 1996

Deadlock avoidance policies for flexible manufacturing systems: the conjunctive case.
Proceedings of the 1996 IEEE International Conference on Robotics and Automation, 1996

1995
A framework for on-line learning of plant models and control policies for restructurable control.
IEEE Trans. Syst. Man Cybern., 1995

1993
Reinforcement learning: Architectures and algorithms.
Int. J. Intell. Syst., 1993

1991
Learning to Select a Model in a Changing World.
Proceedings of the Eighth International Workshop (ML91), 1991


  Loading...