Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ali Yalcin

dblp:36/685 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2000
0000-0002-9543-0681ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Embedded and real-time systems · 82% Cloud and datacenter computing · 18%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems
discrete event systems
0.122000
Deadlock avoidance in flexible manufacturing systems using finite automata · IEEE Trans. Robotics Autom. 2000
An architecture for flexible manufacturing cells with alternate machining and alternate sequencing · IEEE Trans. Robotics Autom. 1999
Embedded and real-time systems › discrete event systems
supervisory control
0.122000
Deadlock avoidance in flexible manufacturing systems using finite automata · IEEE Trans. Robotics Autom. 2000
An architecture for flexible manufacturing cells with alternate machining and alternate sequencing · IEEE Trans. Robotics Autom. 1999
Cloud and datacenter computing › resource management › shared resource management
deadlock avoidance
0.012000
Deadlock avoidance in flexible manufacturing systems using finite automata · IEEE Trans. Robotics Autom. 2000
Embedded and real-time systems › discrete event systems
colored petri nets
0.011999
An architecture for flexible manufacturing cells with alternate machining and alternate sequencing · IEEE Trans. Robotics Autom. 1999

Methods — techniques the papers use, named apart from their topics

supervisory control theory · 0.0finite automata · 0.0colored petri nets · 0.0
YearPublicationVenuePosition
2000 Deadlock avoidance in flexible manufacturing systems using finite automata
abstract
A distinguishing feature of a flexible manufacturing system (FMS) is the ability to perform multiple tasks in one machine or workstation (alternative machining) and the ability to process parts according to more than one sequence of operations (alternative sequencing). In this paper, we address the issue of deadlock avoidance in systems having these characteristics. A deadlock-free and maximally permissive control policy that incorporates this flexibility is developed based on finite automata models of part process plans and the FMS. The resulting supervisory controller is used for dynamic evaluation of deadlock avoidance based on the remaining processing requirements of the parts.
Ali Yalcin, Thomas O. Boucher
IEEE Trans. Robotics Autom.1
1999 An architecture for flexible manufacturing cells with alternate machining and alternate sequencing
abstract
One of the characteristics of flexible manufacturing systems (FMSs) is that they can consider multiple part routing due to alternate machining and alternate sequencing in the processing of parts. This paper presents a new architecture based on colored Petri nets (CPNs) that allows the supervisory controller of a flexible manufacturing cell to consider alternate machining and alternate sequencing in real time control of the cell. This capability for real time alternate routing is an extension of prior research on the application of CPN to modeling FMSs.
Ali Yalcin, Thomas O. Boucher
IEEE Trans. Robotics Autom.1