Javier Campos

Javier Campos

Auto-generated profile, based on publicly available information

Javier Campos

Departamento de Informatica e Ingenieria de Sistemas, Universidad de Zaragoza, Zaragoza, Spain

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 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.<>

1 January 2004
Verified
Conference Paper
Open access
PDF file
JLJuan Pablo López-Grao
Juan Pablo López-Grao
JMJosé Merseguer
José Merseguer
JCJavier Campos
Javier Campos

17 December 2010 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SBSimona Bernardi
Simona Bernardi
JCJavier Campos
Javier Campos
Jose MerseguerJose Merseguer
Jose Merseguer
Software systems that do not meet their timing constraints can cause risks. In this work, we propose a comprehensive method for assessing the risk of timing failure by evaluating the software design. We show how to apply best practises in software engineering and well-known Time Petri Net (TPN) modeling and analysis techniques, and we demonstrate the effectiveness of the method with reference to a case study in the domain of real-time embedded systems. The method customizes the Australian standard risk management process, where the system context is the UML-based software specification, enriched with standard MARTE profile annotations to capture nonfunctional system properties. During the risk analysis, a TPN is derived, via model transformation, from the software design specification and TPN bound techniques are applied to estimate the probability of timing failure. TPN bound techniques are also exploited, within the risk evaluation and treatment steps, to identify the risk causes in the software design.


26 June 2003
Verified
Conference Paper
Closed access
Jose MerseguerJose Merseguer
Jose Merseguer
JCJ. Campos
J. Campos
SBS. Bernardi
S. Bernardi
SDS. Donatelli
S. Donatelli

14 April 2009 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SBSimona Bernardi
Simona Bernardi
JCJavier Campos
Javier Campos
Time Petri nets (TPNs) have been widely used for the verification and validation of real-time systems during the software development process. Their quantitative analysis consists in applying enumerative techniques that suffer the well known state space explosion problem. To overcome this problem, several methods have been proposed in the literature, that either provide rules to obtain equivalent nets with a reduced state space or avoid the construction of the whole state space. In this paper, we propose a method that consists in computing performance bounds to predict the average operational behavior of TPNs by exploiting their structural properties and by applying operational laws. Performance bound computation was first proposed for timed (Timed PNs) and stochastic Petri nets (SPNs). We generalize the results obtained for Timed PNs and SPNs to make the technique applicable to TPNs and their extended stochastic versions: TPN with firing frequency intervals (TPNFs) and extended TPNs (XTPNs). Finally, we apply the proposed bounding techniques on the case study of a robot-control application taken from the literature.