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

Fernando García-Vallés

dblp:73/1511 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

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

Systems, architecture and hardware · 2Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1

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
3 papers
Electronic design automation · 56% Cloud and datacenter computing · 22% Embedded and real-time systems · 19%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis › asynchronous circuit synthesis
asynchronous controller synthesis
0.112006
Synthesis of asynchronous controllers using integer linear programming · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2006
Electronic design automation
logic synthesis
0.112006
Synthesis of asynchronous controllers using integer linear programming · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2006
Electronic design automation › design representation
petri net specification
0.112006
Synthesis of asynchronous controllers using integer linear programming · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2006
Operating systems › resource management
deadlock prevention
0.112005
A Petri Net Structure- Based Deadlock Prevention Solution for Sequential Resource Allocation Systems · ICRA 2005
Embedded and real-time systems › manufacturing systems
flexible manufacturing systems
0.122005
A Banker's solution for deadlock avoidance in FMS with flexible routing and multiresource states · IEEE Trans. Robotics Autom. 2002
A Petri Net Structure- Based Deadlock Prevention Solution for Sequential Resource Allocation Systems · ICRA 2005
Cloud and datacenter computing › resource management
banker's algorithm
0.012002
A Banker's solution for deadlock avoidance in FMS with flexible routing and multiresource states · IEEE Trans. Robotics Autom. 2002
Cloud and datacenter computing › resource management › shared resource management
deadlock avoidance
0.012002
A Banker's solution for deadlock avoidance in FMS with flexible routing and multiresource states · IEEE Trans. Robotics Autom. 2002
Embedded and real-time systems
discrete event systems
0.012002
A Banker's solution for deadlock avoidance in FMS with flexible routing and multiresource states · IEEE Trans. Robotics Autom. 2002
Performance modeling and evaluation
petri net modeling
0.012002
A Banker's solution for deadlock avoidance in FMS with flexible routing and multiresource states · IEEE Trans. Robotics Autom. 2002

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

integer linear programming · 0.2petri nets · 0.1liveness characterization · 0.1petri net structural theory · 0.1petri net modeling · 0.0banker's algorithm · 0.0
YearPublicationVenuePosition
2006 Synthesis of asynchronous controllers using integer linear programming
abstract
A novel strategy for the logic synthesis of asynchronous control circuits is presented. It is based on the structural theory of Petri nets and integer linear programming. Techniques that are capable of checking implementability conditions, such as complete state coding, and deriving a gate netlist to implement the specified behavior are presented. These techniques can handle Petri net specifications consisting of several thousands of transitions and provide a significant speed-up compared with techniques that have previously been proposed
Josep Carmona 0001, José Manuel Colom, Jordi Cortadella, Fernando García-Vallés
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.4
2005 A Petri Net Structure- Based Deadlock Prevention Solution for Sequential Resource Allocation Systems
abstract
A new method for the deadlock prevention problem in concurrent systems where a set of processes share a set of common resources in a conservative way is proposed. It can be applied to flexible manufacturing systems, modeled with Petri nets. In this paper, we present a set of important results related to the deadlock prevention problem in S4PR nets. First, a liveness characterization is introduced, establishing how deadlocks can be studied in terms of circular waits. Second, we show how a circular wait situation corresponds to a particular marking related to a siphon of the Petri net model. Finally, this last characterization is used to obtain an iterative method that successively forbids deadlock related states, synthesizing the control necessary to ensure a final live behavior. The method can be implemented by means of the solutions of a set of integer linear programming problems.
Fernando Tricas García, Fernando García-Vallés, José Manuel Colom, Joaquín Ezpeleta
ICRA2
2002 A Banker's solution for deadlock avoidance in FMS with flexible routing and multiresource states
abstract
Banker's-like approaches to deadlock avoidance are based on a decision procedure to grant active processes resources using information about the maximum needs of resources that a process can request in order to ensure termination. The paper presents an extension of the classical Banker's algorithm to a class of flexible manufacturing systems modeled by means of Petri nets. These systems have two interesting characteristics from the application point of view. First, flexible routing of parts is allowed, and second, a multiset of resources is allowed to be used at each processing step. The decision procedure introduced is polynomial in the Petri net model size.
Joaquín Ezpeleta, Fernando Tricas García, Fernando García-Vallés, José Manuel Colom
IEEE Trans. Robotics Autom.3