José Manuel Colom

José Manuel Colom

Auto-generated profile, based on publicly available information

José Manuel Colom

Universidad de Zaragoza

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 1995 in IEEE Transactions on Robotics and Automation
Verified
Journal Article
Closed access
JEJ. Ezpeleta
J. Ezpeleta
JCJ.M. Colom
J.M. Colom
JMJ. Martinez
J. Martinez

18 January 2006
Verified
Conference Paper
Closed access
FTF. Tricas
F. Tricas
FGF. Garcia-Valles
F. Garcia-Valles
JCJ.M. Colom
J.M. Colom
JEJ. Ezpeleta
J. Ezpeleta

1 January 2000
Verified
Book Chapter
Closed access
PDF file
FTF. Tricas
F. Tricas
FGF. García-Vallés
F. García-Vallés
JCJ. M. Colom
J. M. Colom
JEJ. Ezpeleta
J. Ezpeleta

1 May 1992 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
JCJ. Campos
J. Campos
GCG. Chiola
G. Chiola
JCJ.M. Colom
J.M. Colom
MSManuel Silva
Manuel Silva
A class of synchronized queueing networks with deterministic routing is identified to be equivalent to a subclass of timed Petri nets called marked graphs. Some structural and behavioral properties of marked graphs are used to show interesting properties of this class of performance models. In particular, ergodicity is derived from the boundedness and liveness of the underlying Petri net representation. In the case of unbounded (i.e., nonstrongly connected) marked graphs, ergodicity is computed as a function of the average transition firing delays. For steady-state performance, linear programming problems defined on the incidence matrix of the underlying Petri nets are used to compute tight (i.e., attainable) bounds for the throughput of transitions for marked graphs with deterministic or stochastic time associated with transitions. These bounds depend on the initial marking and the mean values of the delays but not on the probability distortion functions. The benefits of interleaving qualitative and quantitative analysis of marked graph models are shown.<>

26 February 2012 in Discrete Event Dynamic Systems
Verified
Journal Article
Closed access
PDF file
ECElia Esther Cano
Elia Esther Cano
Carlos RovettoCarlos Rovetto
Carlos Rovetto
JCJosé-Manuel Colom
José-Manuel Colom

1 September 2013
Verified
Conference Paper
Closed access
MKMarius Kloetzer
Marius Kloetzer
CMCristian Mahulea
Cristian Mahulea
JCJose-Manuel Colom
Jose-Manuel Colom
This paper provides a strategy for supervising the motion of some mobile robots that evolve in the same environment. Some regions of the environment are assumed to have a limited capacity in terms of the number of robots that can simultaneously occupy them, and a set of possible trajectories is available for each robot. The solution comprises the construction of a specific Petri net model for the available trajectories, and the use of resource-allocation techniques based on restricted-capacity regions and on deadlock-free execution.