> Publicaciones – Grupo de I+D en Computación Distribuida (DisCo)

Home » Publicaciones

Publicaciones

2017

  • P. Álvarez and S. Baldassarri, “M-eRoDes: una plataforma de servicios para la creación y evaluación automática de actividades de aprendizaje colaborativo,” in XIII Jornadas de Ciencia e Ingeniería de Servicios, JCIS 2017, La Laguna, Tenerife, Spain, 2017.
    [Bibtex]
    @InProceedings{Alvarez2017,
    Title = {M-eRoDes: una plataforma de servicios para la creaci\'on y evaluaci\'on autom\'atica de actividades de aprendizaje colaborativo},
    Author = {P. \'Alvarez and S. Baldassarri},
    Booktitle = {XIII Jornadas de Ciencia e Ingenier\'ia de Servicios, JCIS 2017, La Laguna, Tenerife, Spain},
    Year = {2017},
    __markedentry = {[jcampos:]}
    }
  • S. Baldassarri and P. Álvarez, “Collaborative learning based on semantic technologies. An experience in computer science engineering,” in 9th annual International Conference on Education and New Learning Technologies, EDULEARN 2017, Barcelona, Spain, 2017.
    [Bibtex]
    @InProceedings{Baldassarri2017,
    Title = {Collaborative learning based on semantic technologies. An experience in computer science engineering},
    Author = {S. Baldassarri and P. \'Alvarez},
    Booktitle = {9th annual International Conference on Education and New Learning Technologies, {EDULEARN} 2017, Barcelona, Spain},
    Year = {2017},
    __markedentry = {[jcampos:]}
    }
  • S. Bernardi, R. Piracés-Alastuey, and R. Trillo-Lado, “Using Process Mining and Model-driven Engineering to Enhance Security of Web Information Systems,” in Proceedings of the 2nd International Workshop on Safety & Security aSSurance for Critical Infrastructures Protection (S4CIP), 29th April, Paris (France), 2017.
    [Bibtex]
    @InProceedings{Bernardi2017,
    Title = {{Using Process Mining and Model-driven Engineering to Enhance Security of Web Information Systems}},
    Author = {Simona Bernardi and Ra\'ul Pirac\'es-Alastuey and Raquel Trillo-Lado},
    Booktitle = {Proceedings of the 2nd International Workshop on Safety \& Security aSSurance for Critical Infrastructures Protection (S4CIP), 29th April, Paris (France)},
    Year = {2017}
    }
  • S. Cadegnani, F. Guerra, S. Ilarri, M. C. del Rodríguez-Hernández, R. Trillo-Lado, Y. Velegrakis, and R. Amaro, “Exploiting Linguistic Analysis on URLs for Recommending Web Pages: A Comparative Study,” Trans. Computational Collective Intelligence, vol. 26, pp. 26-45, 2017.
    [Bibtex]
    @Article{Cadegnani2017,
    Title = {Exploiting Linguistic Analysis on URLs for Recommending Web Pages:
    {A} Comparative Study},
    Author = {Sara Cadegnani and
    Francesco Guerra and
    Sergio Ilarri and
    Mar{\'{\i}}a del Carmen Rodr{\'{\i}}guez-Hern{\'{a}}ndez and
    Raquel Trillo-Lado and
    Yannis Velegrakis and
    Raquel Amaro},
    Journal = {Trans. Computational Collective Intelligence},
    Year = {2017},
    Pages = {26--45},
    Volume = {26},
    __markedentry = {[jcampos:6]}
    }
  • M. C. del Rodríguez-Hernández, S. Ilarri, R. Hermoso, and R. Trillo-Lado, “DataGenCARS: A generator of synthetic data for the evaluation of context-aware recommendation systems,” Pervasive and Mobile Computing, vol. 38, pp. 516-541, 2017.
    [Bibtex]
    @Article{CarmenRodriguez-Hernandez2017,
    Title = {DataGenCARS: {A} generator of synthetic data for the evaluation of
    context-aware recommendation systems},
    Author = {Mar{\'{\i}}a del Carmen Rodr{\'{\i}}guez-Hern{\'{a}}ndez and
    Sergio Ilarri and
    Ram{\'{o}}n Hermoso and
    Raquel Trillo-Lado},
    Journal = {Pervasive and Mobile Computing},
    Year = {2017},
    Pages = {516--541},
    Volume = {38},
    __markedentry = {[jcampos:6]}
    }
  • M. C. del Rodríguez-Hernández, S. Ilarri, R. Hermoso, and R. Trillo-Lado, “Towards Trajectory-Based Recommendations in Museums: Evaluation of Strategies Using Mixed Synthetic and Real Data,” in EUSPN/ICTH, 2017, pp. 234-239.
    [Bibtex]
    @InProceedings{CarmenRodriguez-Hernandez2017a,
    Title = {Towards Trajectory-Based Recommendations in Museums: Evaluation of
    Strategies Using Mixed Synthetic and Real Data},
    Author = {Mar{\'{\i}}a del Carmen Rodr{\'{\i}}guez-Hern{\'{a}}ndez and
    Sergio Ilarri and
    Ram{\'{o}}n Hermoso and
    Raquel Trillo-Lado},
    Booktitle = {{EUSPN/ICTH}},
    Year = {2017},
    Pages = {234--239},
    Publisher = {Elsevier},
    Series = {Procedia Computer Science},
    Volume = {113},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] U. Gentile, S. Bernardi, S. Marrone, J. Merseguer, and V. Vittorini, “A model driven approach for assessing survivability requirements of critical infrastructures,” J. High Speed Networks, vol. 23, iss. 2, pp. 175-186, 2017.
    [Bibtex]
    @Article{Gentile2017,
    Title = {A model driven approach for assessing survivability requirements of critical infrastructures},
    Author = {Ugo Gentile and Simona Bernardi and Stefano Marrone and Jos{\'e} Merseguer and Valeria Vittorini},
    Journal = {J. High Speed Networks},
    Year = {2017},
    Number = {2},
    Pages = {175--186},
    Volume = {23},
    Doi = {10.3233/JHS-170564}
    }
  • [DOI] S. Hernández, P. Álvarez, J. Fabra, and J. Ezpeleta, “Analysis of users’ behaviour in structured e-commerce websites,” IEEE Access, vol. 5, pp. 11941-11958, 2017.
    [Bibtex]
    @Article{Hernandez2017,
    Title = {Analysis of users' behaviour in structured e-commerce websites},
    Author = {Sergio Hern\'{a}ndez and Pedro {\'{A}}lvarez and Javier Fabra and Joaqu{\'{\i}}n Ezpeleta},
    Journal = {IEEE Access},
    Year = {2017},
    Pages = {11941--11958},
    Volume = {5},
    __markedentry = {[jcampos:]},
    Doi = {10.1109/ACCESS.2017.2707600},
    Url = {http://ieeexplore.ieee.org/document/7933069/}
    }
  • S. Hernández, P. Álvarez, J. Fabra, and J. Ezpeleta, “Using model checking to identify customers’ purchasing behaviour in an e-commerce,” in Proceedings of the Algorithms & Theories for the Analysis of Event Data, ATAED 2017, Zaragoza, Spain, 2017, pp. 158-164.
    [Bibtex]
    @InProceedings{Hernandez2017a,
    Title = {Using model checking to identify customers' purchasing behaviour in an e-commerce},
    Author = {Sergio Hern\'{a}ndez and Pedro {\'{A}}lvarez and Javier Fabra and Joaqu{\'{\i}}n Ezpeleta},
    Booktitle = {Proceedings of the Algorithms \& Theories for the Analysis of Event Data, {ATAED} 2017, Zaragoza, Spain},
    Year = {2017},
    Pages = {158--164},
    Volume = {Volume 1847 at CEUR},
    __markedentry = {[jcampos:]},
    Numpages = {7}
    }
  • [DOI] J. Merseguer, W. Binder, and J. Murphy, “Guest Editorial: Automation in Software Performance Engineering,” Autom. Softw. Eng., vol. 24, iss. 1, pp. 71-72, 2017.
    [Bibtex]
    @Article{Merseguer2017,
    Title = {Guest Editorial: Automation in Software Performance Engineering},
    Author = {Jos{\'{e}} Merseguer and Walter Binder and John Murphy},
    Journal = {Autom. Softw. Eng.},
    Year = {2017},
    Number = {1},
    Pages = {71--72},
    Volume = {24},
    Doi = {10.1007/s10515-016-0201-2},
    Url = {http://dx.doi.org/10.1007/s10515-016-0201-2}
    }
  • [DOI] E. G. L. de Murillas, J. Fabra, P. Álvarez, and J. Ezpeleta, “Parallel computation of the reachability graph of petri net models with semantic information,” Softw., Pract. Exper., vol. 47, iss. 5, pp. 647-668, 2017.
    [Bibtex]
    @Article{Murillas2017,
    Title = {Parallel computation of the reachability graph of petri net models with semantic information},
    Author = {Eduardo Gonz{\'{a}}lez L{\'{o}}pez de Murillas and Javier Fabra and Pedro {\'{A}}lvarez and Joaqu{\'{\i}}n Ezpeleta},
    Journal = {Softw., Pract. Exper.},
    Year = {2017},
    Number = {5},
    Pages = {647--668},
    Volume = {47},
    Doi = {10.1002/spe.2438},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1002/spe.2438}
    }
  • [DOI] D. Perez-Palacin, R. Mirandola, and J. Merseguer, “Accurate modeling and efficient QoS analysis of scalable adaptive systems under bursty workload,” Journal of Systems and Software, vol. 130, pp. 24-41, 2017.
    [Bibtex]
    @Article{Perez-Palacin2017,
    Title = {Accurate modeling and efficient QoS analysis of scalable adaptive systems under bursty workload},
    Author = {Diego Perez-Palacin and Raffaela Mirandola and Jos{\'e} Merseguer},
    Journal = {Journal of Systems and Software},
    Year = {2017},
    Pages = {24 - 41},
    Volume = {130},
    Doi = {10.1016/j.jss.2017.05.022},
    ISSN = {0164-1212},
    Keywords = {Adaptability, Quality of service, Stochastic petri nets, Markov models, Workload modeling },
    Url = {http://www.sciencedirect.com/science/article/pii/S0164121217300833}
    }
  • [DOI] D. Perez-Palacin, Y. Ridene, and J. Merseguer, “Quality Assessment in DevOps: Automated Analysis of a Tax Fraud Detection System,” in Companion Proceedings of the 8th ACM/SPEC on International Conference on Performance Engineering, ICPE 2017, L’Aquila, Italy, April 22-26, 2017, 2017, pp. 133-138.
    [Bibtex]
    @InProceedings{Perez-Palacin2017a,
    Title = {Quality Assessment in DevOps: Automated Analysis of a Tax Fraud Detection System},
    Author = {Diego Perez-Palacin and Youssef Ridene and Jos{\'{e}} Merseguer},
    Booktitle = {Companion Proceedings of the 8th {ACM/SPEC} on International Conference on Performance Engineering, {ICPE} 2017, L'Aquila, Italy, April 22-26, 2017},
    Year = {2017},
    Pages = {133--138},
    Doi = {10.1145/3053600.3053632},
    Url = {http://doi.acm.org/10.1145/3053600.3053632}
    }
  • O. Urra, S. Ilarri, and R. Trillo-Lado, “An approach driven by mobile agents for data management in vehicular networks,” Inf. Sci., vol. 381, pp. 55-77, 2017.
    [Bibtex]
    @Article{Urra2017,
    Title = {An approach driven by mobile agents for data management in vehicular
    networks},
    Author = {Oscar Urra and
    Sergio Ilarri and
    Raquel Trillo-Lado},
    Journal = {Inf. Sci.},
    Year = {2017},
    Pages = {55--77},
    Volume = {381},
    __markedentry = {[jcampos:6]}
    }

2016

  • [DOI] P. Álvarez, J. Fabra, S. Hernández, and J. Ezpeleta, “Alignment of teacher’s plan and students’ use of LMS resources. Analysis of Moodle logs,” in 15th International Conference on Information Technology Based Higher Education and Training, ITHET 2016, Istanbul, Turkey, September 8-10, 2016, 2016, pp. 1-8.
    [Bibtex]
    @InProceedings{Alvarez2016,
    Title = {Alignment of teacher's plan and students' use of {LMS} resources. Analysis of Moodle logs},
    Author = {Pedro {\'{A}}lvarez and Javier Fabra and Sergio Hern{\'{a}}ndez and Joaqu{\'{\i}}n Ezpeleta},
    Booktitle = {15th International Conference on Information Technology Based Higher Education and Training, {ITHET} 2016, Istanbul, Turkey, September 8-10, 2016},
    Year = {2016},
    Pages = {1--8},
    Crossref = {DBLP:conf/ithet/2016},
    Doi = {10.1109/ITHET.2016.7760720},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1109/ITHET.2016.7760720}
    }
  • [DOI] P. Álvarez, S. Hernández, J. Fabra, and J. Ezpeleta, “Cost Estimation for the Provisioning of Computing Resources to Execute Bag-of-Tasks Applications in the Amazon Cloud” in Economics of Grids, Clouds, Systems, and Services: 12th International Conference, GECON 2015, Cluj-Napoca, Romania, September 15-17, 2015, Revised Selected Papers, J. Altmann, G. C. Silaghi, and O. F. Rana, Eds., Cham: Springer International Publishing, 2016, pp. 65-77.
    [Bibtex]
    @InBook{Alvarez2016a,
    Title = {Cost Estimation for the Provisioning of Computing Resources to Execute Bag-of-Tasks Applications in the Amazon Cloud},
    Author = {{\'A}lvarez, Pedro and Hern{\'a}ndez, Sergio and Fabra, Javier and Ezpeleta, Joaqu{\'i}n},
    Editor = {Altmann, J{\"o}rn and Silaghi, Gheorghe Cosmin and Rana, Omer F.},
    Pages = {65--77},
    Publisher = {Springer International Publishing},
    Year = {2016},
    Address = {Cham},
    __markedentry = {[jcampos:]},
    Booktitle = {Economics of Grids, Clouds, Systems, and Services: 12th International Conference, GECON 2015, Cluj-Napoca, Romania, September 15-17, 2015, Revised Selected Papers},
    Doi = {10.1007/978-3-319-43177-2_5},
    ISBN = {978-3-319-43177-2},
    Url = {http://dx.doi.org/10.1007/978-3-319-43177-2_5}
    }
  • P. Álvarez and S. Baldassarri, “Aprendizaje basado en la creación, uso y evaluación de una red semántica de recursos docentes,” TICs Aplicadas para el aprendizaje de la Ingeniería (TICAI 2015), vol. 2015, pp. 45-52, 2016.
    [Bibtex]
    @Article{Alvarez2016d,
    Title = {Aprendizaje basado en la creaci\'on, uso y evaluaci\'on de una red sem\'antica de recursos docentes},
    Author = {P. \'Alvarez and S. Baldassarri},
    Journal = {TICs Aplicadas para el aprendizaje de la Ingeniería (TICAI 2015)},
    Year = {2016},
    Pages = {45-52},
    Volume = {2015},
    __markedentry = {[jcampos:]},
    Publisher = {Capítulo Español de la Sociedad de Educación del IEEE}
    }
  • P. Álvarez and S. Baldassarri, “eRoDes: a Web-based framework for the development of semantic-enhanced learning objects,” in The Eleventh International Conference on Internet and Web Applications and Services (ICIW 2016), 2016, pp. 1-6.
    [Bibtex]
    @InProceedings{Alvarez2016c,
    Title = {eRoDes: a Web-based framework for the development of semantic-enhanced learning objects},
    Author = {P. \'Alvarez and S. Baldassarri},
    Booktitle = {The Eleventh International Conference on Internet and Web Applications and Services (ICIW 2016)},
    Year = {2016},
    Pages = {1-6},
    __markedentry = {[jcampos:]}
    }
  • [DOI] D. Ardagna, S. Bernardi, E. Gianniti, S. K. Aliabadi, D. P. -, and J. I. Requeno, “Modeling Performance of Hadoop Applications: A Journey from Queueing Networks to Stochastic Well Formed Nets,” in Algorithms and Architectures for Parallel Processing – 16th International Conference, ICA3PP 2016, Granada, Spain, December 14-16, 2016, Proceedings, 2016, pp. 599-613.
    [Bibtex]
    @InProceedings{Ardagna2016,
    Title = {Modeling Performance of Hadoop Applications: {A} Journey from Queueing Networks to Stochastic Well Formed Nets},
    Author = {Danilo Ardagna and Simona Bernardi and Eugenio Gianniti and Soroush Karimian Aliabadi and Diego Perez{-}Palacin and Jos{\'{e}} Ignacio Requeno},
    Booktitle = {Algorithms and Architectures for Parallel Processing - 16th International Conference, {ICA3PP} 2016, Granada, Spain, December 14-16, 2016, Proceedings},
    Year = {2016},
    Pages = {599--613},
    Doi = {10.1007/978-3-319-49583-5_47}
    }
  • S. Baldassarri and P. Álvarez, “M-eRoDes: involucrando a los estudiantes en la creación y evaluación colaborativa de objetos de aprendizaje,” in XXII Jornadas sobre la Enseñanza Universitaria de la Informática (JENUI 2016), 2016, pp. 195-202.
    [Bibtex]
    @InProceedings{Baldassarri2016,
    Title = {M-eRoDes: involucrando a los estudiantes en la creaci\'on y evaluaci\'on colaborativa de objetos de aprendizaje},
    Author = {S. Baldassarri and P. \'Alvarez},
    Booktitle = {XXII Jornadas sobre la Enseñanza Universitaria de la Informática (JENUI 2016)},
    Year = {2016},
    Pages = {195-202},
    __markedentry = {[jcampos:]}
    }
  • S. Bergamaschi, F. Guerra, M. Interlandi, R. Trillo-Lado, and Y. Velegrakis, “Combining user and database perspective for solving keyword queries over relational databases,” Inf. Syst., vol. 55, pp. 1-19, 2016.
    [Bibtex]
    @Article{Bergamaschi2016,
    Title = {Combining user and database perspective for solving keyword queries
    over relational databases},
    Author = {Sonia Bergamaschi and
    Francesco Guerra and
    Matteo Interlandi and
    Raquel Trillo-Lado and
    Yannis Velegrakis},
    Journal = {Inf. Syst.},
    Year = {2016},
    Pages = {1--19},
    Volume = {55},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] S. Bernardi, L. Dranca, and J. Merseguer, “A model-driven approach to survivability requirement assessment for critical systems,” Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability, vol. 230, iss. 5, pp. 485-501, 2016.
    [Bibtex]
    @Article{Bernardi2016,
    Title = {A model-driven approach to survivability requirement assessment for critical systems},
    Author = {Simona Bernardi and Lacramioara Dranca and Jos{\'e} Merseguer},
    Journal = {Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability},
    Year = {2016},
    Number = {5},
    Pages = {485-501},
    Volume = {230},
    Doi = {10.1177/1748006X15626017}
    }
  • [DOI] S. Bernardi, J. I. Requeno, C. Joubert, and A. Romeu, “A systematic approach for performance evaluation using process mining: the POSIDONIA operations case study,” in Proceedings of the 2nd International Workshop on Quality-Aware DevOps, QUDOS@ISSTA 2016, Saarbrücken, Germany, July 21, 2016, 2016, pp. 24-29.
    [Bibtex]
    @InProceedings{Bernardi2016b,
    Title = {A systematic approach for performance evaluation using process mining: the {POSIDONIA} operations case study},
    Author = {Simona Bernardi and Jos{\'{e}} Ignacio Requeno and Christophe Joubert and Alberto Romeu},
    Booktitle = {Proceedings of the 2nd International Workshop on Quality-Aware DevOps, QUDOS@ISSTA 2016, Saarbr{\"{u}}cken, Germany, July 21, 2016},
    Year = {2016},
    Pages = {24--29},
    Doi = {10.1145/2945408.2945413}
    }
  • M. C. Calvo-Yanguas, C. Elvira-Donázar, and R. Trillo-Lado, “A Formal Definition for Configuration,” CoRR, vol. abs/1611.03736, 2016.
    [Bibtex]
    @Article{Calvo-Yanguas2016,
    Title = {A Formal Definition for Configuration},
    Author = {Mar{\'{\i}}a Carmen Calvo-Yanguas and
    Carmen Elvira-Don{\'{a}}zar and
    Raquel Trillo-Lado},
    Journal = {CoRR},
    Year = {2016},
    Volume = {abs/1611.03736},
    __markedentry = {[jcampos:6]}
    }
  • M. C. del Rodríguez-Hernández, S. Ilarri, R. Trillo-Lado, and F. Guerra, “Towards Keyword-based Pull Recommendation Systems,” in ICEIS (1), 2016, pp. 207-214.
    [Bibtex]
    @InProceedings{CarmenRodriguez-Hernandez2016,
    Title = {Towards Keyword-based Pull Recommendation Systems},
    Author = {Mar{\'{\i}}a del Carmen Rodr{\'{\i}}guez-Hern{\'{a}}ndez and
    Sergio Ilarri and
    Raquel Trillo-Lado and
    Francesco Guerra},
    Booktitle = {{ICEIS} {(1)}},
    Year = {2016},
    Pages = {207--214},
    Publisher = {SciTePress},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] A. Gómez, J. Merseguer, E. D. Nitto, and D. A. Tamburri, “Towards a UML profile for data intensive applications,” in Proceedings of the 2nd International Workshop on Quality-Aware DevOps, QUDOS@ISSTA 2016, Saarbrücken, Germany, July 21, 2016, 2016, pp. 18-23.
    [Bibtex]
    @InProceedings{Gomez2016,
    Title = {Towards a {UML} profile for data intensive applications},
    Author = {Abel G{\'{o}}mez and Jos{\'{e}} Merseguer and Elisabetta Di Nitto and Damian Andrew Tamburri},
    Booktitle = {Proceedings of the 2nd International Workshop on Quality-Aware DevOps, QUDOS@ISSTA 2016, Saarbr{\"{u}}cken, Germany, July 21, 2016},
    Year = {2016},
    Pages = {18--23},
    Doi = {10.1145/2945408.2945412},
    Url = {http://doi.acm.org/10.1145/2945408.2945412}
    }
  • [DOI] E. Gómez-Martínez, R. J. Rodríguez, C. B. Earle, L. E. Elorza, and M. I. Rezaba, “A Methodology for Model-based Verification of Safety Contracts and Performance Requirements,” Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability, pp. 1-21, 2016.
    [Bibtex]
    @Article{Gomez-Martinez2016,
    Title = {{A Methodology for Model-based Verification of Safety Contracts and Performance Requirements}},
    Author = {Elena G\'{o}mez-Mart\'{i}nez and Ricardo J. Rodr\'{i}guez and Clara Benac Earle and Leire Etxeberria Elorza and Miren Illarramendi Rezaba},
    Journal = {Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability},
    Year = {2016},
    Note = {To appear.},
    Pages = {1--21},
    Abstract = {The verification of safety requirements becomes crucial in critical systems where human lives depend on their correct functioning. Formal methods have often been advocated as necessary to ensure the reliability of software systems, albeit with a considerable effort. In any case, such an effort is cost-effective when verifying safety-critical systems. Often, safety requirements are expressed using safety contracts, in terms of assumptions and guarantees. To facilitate the adoption of formal methods in the safety-critical software industry, we propose a methodology based on well-known modelling languages such as UML and OCL. UML is used to model the software system while OCL is used to express the system safety contracts within UML. In the proposed methodology a UML model enriched with OCL constraints is transformed to a Petri net model that enables to formally verify such safety contracts. The methodology is evaluated on an industrial case study. The proposed approach allows an early safety verification to be performed, which increases the confidence of software engineers while designing the system.},
    Doi = {10.1177/1748006X16667328},
    Owner = {ricardo},
    Timestamp = {2015.10.16},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/GREIB-JRR-16.pdf}
    }
  • L. García and R. J. Rodríguez, “A Peek Under the Hood of iOS Malware,” in Proceedings of the 1st International Workshop on Malware Analysis, 2016, pp. 1-10.
    [Bibtex]
    @InProceedings{Garcia2016,
    Title = {{A Peek Under the Hood of iOS Malware}},
    Author = {Laura Garc\'{i}a and Ricardo J. Rodr\'{i}guez},
    Booktitle = {Proceedings of the 1st International Workshop on Malware Analysis},
    Year = {2016},
    Note = {Accepted for publication. To appear.},
    Pages = {1--10},
    Abstract = {Malicious software specially crafted to proliferate in mobile platforms are becoming a serious threat, as reported by numerous software security vendors during last years. Android and iOS are nowadays the leaders of mobile OS market share. While malware targeting Android are largely studied, few attention is paid to iOS malware. In this paper, we fill this gap by studying and characterizing malware targeting iOS devices. To this regard, we study the features of iOS malware and classify samples of 36 iOS malware families discovered between 2009 and 2015. We also show the methodology for iOS malware analysis and provide a detailed analysis of a malware sample. Our findings evidence that most of them are distributed out of official markets, target jailbroken iOS devices, and very few exploit any vulnerability.},
    Keywords = {iOS, malware, attacks, threats, classification},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/GR-WMA-16.pdf}
    }
  • M. Lama, P. Álvarez, M. Ocaña, M. Mucientes, J. Ezpeleta, G. M. A. Garrido, and A. Bugarín, “Análisis inteligente de flujos de trabajo sociales,” in XII Jornadas de Ciencia e Ingeniería de Servicios (JCIS 2016), 2016.
    [Bibtex]
    @InProceedings{Lama2016,
    Title = {An\'alisis inteligente de flujos de trabajo sociales},
    Author = {M. Lama and P. \'Alvarez and M. Oca{\~{n}}a and M. Mucientes and J. Ezpeleta and M. A. Garc\'ia Garrido and A. Bugar\'in},
    Booktitle = {XII Jornadas de Ciencia e Ingeniería de Servicios (JCIS 2016)},
    Year = {2016},
    __markedentry = {[jcampos:]}
    }
  • R. Mateescu and J. I. Requeno, “On-the-fly model checking for extended action-based probabilistic operators” in Proceedings of the 23rd International SPIN symposium on Model Checking of Software, D. Bošnacki and A. Wijs, Eds., Cham: Springer, 2016, vol. 9641, pp. 189-207.
    [Bibtex]
    @InCollection{Mateescu2016,
    Title = {{O}n-the-fly model checking for extended action-based probabilistic operators},
    Author = {Mateescu, Radu and Requeno, Jos{\'e} Ignacio},
    Booktitle = {Proceedings of the 23rd International SPIN symposium on Model Checking of Software},
    Publisher = {Springer},
    Year = {2016},
    Address = {Cham},
    Editor = {Dragan Bo{\v{s}}nacki and Anton Wijs},
    Pages = {189--207},
    Series = {Theoretical Computer Science and General Issues},
    Volume = {9641}
    }
  • R. Mateescu and J. I. Requeno, On-the-fly model checking for extended action-based probabilistic operators, 2016.
    [Bibtex]
    @Unpublished{Mateescu2016a,
    Title = {{O}n-the-fly model checking for extended action-based probabilistic operators},
    Author = {Mateescu, Radu and Requeno, Jos{\'e} Ignacio},
    Note = {Submitted},
    Year = {2016},
    Owner = {Ignacio},
    Timestamp = {2017.02.01}
    }
  • R. Nardone, R. J. Rodríguez, and S. Marrone, “Formal Security Assessment of Modbus Protocol,” in Proceedings of the 11th International Conference for Internet Technology and Secured Transactions, 2016, pp. 1-6.
    [Bibtex]
    @InProceedings{Nardone2016,
    Title = {{Formal Security Assessment of Modbus Protocol}},
    Author = {R. Nardone and R. J. Rodr\'{i}guez and S. Marrone},
    Booktitle = {Proceedings of the 11th International Conference for Internet Technology and Secured Transactions},
    Year = {2016},
    Note = {Accepted for publication. To appear.},
    Pages = {1--6},
    Publisher = {IEEE},
    Abstract = {Critical infrastructures as water treatment, power distribution, or telecommunications provide essential services to our day-to-day basis. Any service discontinuity may have a high impact into our society and even our safety. Thus, security of these systems against intentional threats must be guaranteed. However, many of these systems are based on protocols initially designed to operate on closed, unroutable networks, making them an easy target for cybercriminals. In this regard, Modbus is a widely adopted protocol in control systems. Modbus protocol, however, lacks for security properties and is vulnerable to plenty of attacks (as spoofing, flooding, or replay to name a few). In this paper, we propose a formal modeling of Modbus protocol using an extension of hierarchical state-machines that is automatically transformed to a Promela model. This model allows us to find counterexamples of security properties by model-checking. In particular, in this paper we prove the existence of man-in-the-middle attack in Modbus protocol. Our approach also allows to formally evaluate security properties in future extensions of Modbus protocols.},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/NRM-ICITST-16.pdf}
    }
  • [DOI] S. Pérez, J. Campos, H. Facchini, and A. Dantiacq, “Experimental Study of Unicast and Multicast Video Traffic using WAN Test Bed,” in Proceedings of the 2016 IEEE Biennial Congress of Argentina (ARGENCON’16), Buenos Aires, Argentina, 2016, pp. 1-6.
    [Bibtex]
    @InProceedings{PCFD-ARGENCON-16,
    Title = {Experimental Study of Unicast and Multicast Video Traffic using {WAN} Test Bed},
    Author = {S. P{\'e}rez and J. Campos and H. Facchini and A. Dantiacq},
    Booktitle = {Proceedings of the 2016 IEEE Biennial Congress of Argentina {(ARGENCON'16)}},
    Year = {2016},
    Address = {Buenos Aires, Argentina},
    Month = {June},
    Pages = {1-6},
    Publisher = {IEEE Computer Society},
    Abstract = {The deployment of IP multicast protocols in each
    router in the path is needed to access the benefits of the
    multicast. IP multicast exists today mainly in LAN networks
    and in small areas of highly controlled interconnected
    networks. In fact, some companies started to offer tailored
    solutions to try to overcome these limitations. On the other
    hand, over the last decade, the multimedia applications have
    expanded rapidly, and in particular in video applications.
    There are Internet sites that offer movies on-line; and it is
    common for users to upload and download videos with sites
    like YouTube (\copyright Google Inc.). The video call via the Internet is
    common with applications, such as Skype (\copyright Microsoft). The
    growth of video traffic should be taken into account when
    designing a network. Understanding the behavior of the video
    traffic and the requirements for the network helps network
    administrators to improve the traffic planning. In this work, a
    quantitative analysis is performed by experimentation, in
    order to evaluate the behavior and impact of video traffic on
    WAN networks. We propose a WAN test bed composed by a
    video traffic server and several client stations that allows
    injecting unicast and multicast video traffic, compressed with
    several codecs. From capturing video traffic, we identified
    several interesting unicast and multicast performance metrics,
    such as: throughput, number of frames, delays, jitter, and
    interframe spaces and frame sizes distributions. Several
    factors have been taken into account: the video resolution
    configuration, the type of video, and restrictions on the
    bandwidth, as in a corporate real WAN link of some few
    Mbps. This study facilitates the comparison of the results with
    those obtained from analytical and modelling studies for
    different contexts.},
    Doi = {10.1109/ARGENCON.2016.7585260},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pcfd-argencon-16.pdf}
    }
  • R. Piracés-Alastuey, S. Bernardi, and R. Trillo-Lado, “Minería de procesos para la mejora de la seguridad de sistemas de información Web,” in Actas del IV Congreso Nacional de I+D en Defensa y Seguridad (DESEi+d), 16-18 Noviembre, San Javier (Murcia), 2016, pp. 1045-1052.
    [Bibtex]
    @InProceedings{Piraces-Alastuey2016,
    Title = {Miner\'{\i}a de procesos para la mejora de la seguridad de sistemas de información {W}eb},
    Author = {Ra\'ul Pirac\'es-Alastuey and Simona Bernardi and Raquel Trillo-Lado},
    Booktitle = {{Actas del IV Congreso Nacional de I+D en Defensa y Seguridad (DESEi+d), 16-18 Noviembre, San Javier (Murcia)}},
    Year = {2016},
    Pages = {1045--1052},
    ISBN = {978-84-946021-3-9}
    }
  • L. Po, F. Rollo, and R. Trillo-Lado, “Topic Detection in Multichannel Italian Newspapers,” in International KEYSTONE Conference, 2016, pp. 62-75.
    [Bibtex]
    @InProceedings{Po2016,
    Title = {Topic Detection in Multichannel Italian Newspapers},
    Author = {Laura Po and
    Federica Rollo and
    Raquel Trillo-Lado},
    Booktitle = {International {KEYSTONE} Conference},
    Year = {2016},
    Pages = {62--75},
    Series = {Lecture Notes in Computer Science},
    Volume = {10151},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] J. I. Requeno and J. M. Colom, “Evaluation of properties over phylogenetic trees using stochastic logics,” BMC Bioinformatics, vol. 17, iss. 1, pp. 1-14, 2016.
    [Bibtex]
    @Article{Requeno2016,
    Title = {Evaluation of properties over phylogenetic trees using stochastic logics},
    Author = {Requeno, Jos{\'e} Ignacio and Colom, Jos{\'e} Manuel},
    Journal = {BMC Bioinformatics},
    Year = {2016},
    Number = {1},
    Pages = {1--14},
    Volume = {17},
    Abstract = {Model checking has been recently introduced as an integrated framework for extracting information of the phylogenetic trees using temporal logics as a querying language, an extension of modal logics that imposes restrictions of a boolean formula along a path of events. The phylogenetic tree is considered a transition system modeling the evolution as a sequence of genomic mutations (we understand mutation as different ways that DNA can be changed), while this kind of logics are suitable for traversing it in a strict and exhaustive way. Given a biological property that we desire to inspect over the phylogeny, the verifier returns true if the specification is satisfied or a counterexample that falsifies it. However, this approach has been only considered over qualitative aspects of the phylogeny.},
    Doi = {10.1186/s12859-016-1077-7},
    ISSN = {1471-2105},
    Url = {http://dx.doi.org/10.1186/s12859-016-1077-7}
    }
  • [DOI] R. J. Rodríguez, “Evolution and Characterization of Point-of-Sale RAM Scraping Malware,” Journal in Computer Virology and Hacking Techniques, pp. 1-14, 2016.
    [Bibtex]
    @Article{Rodriguez2016a,
    Title = {{Evolution and Characterization of Point-of-Sale RAM Scraping Malware}},
    Author = {Ricardo J. Rodr\'{i}guez},
    Journal = {Journal in Computer Virology and Hacking Techniques},
    Year = {2016},
    Pages = {1--14},
    Abstract = {Credit and debit cards are becoming the primary payment method for purchases. These payments are normally performed in merchant's in-store systems as known as Point-of-Sale (POS) systems. Since these systems handle payment card data while processing the customer transactions, they are becoming a primary target for cybercriminals. These data, when remain at memory, are scraped and exfiltrated by specially crafted malicious software named POS RAM scraping malware. In recent years, large data breaches occurred in well-known US retail companies were caused by this kind of malware. In this paper, we study the features of these malware based on their behavior on different stages: infection and persistence, process and data of interest search, and exfiltration. Then, we classify samples of 22 known POS RAM scraping malware families from 2009 to 2015 according to these features. Our findings show these malware are still immature and use well-defined behavioral patterns for data acquirement and exfiltration, which may make their malicious activity easily detectable by process and network monitoring tools.},
    Doi = {10.1007/s11416-016-0280-4},
    ISSN = {2263-8733},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/R-CVHT-16.pdf}
    }
  • [DOI] R. J. Rodríguez, “On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets,” IEEE Transactions on Systems, Man and Cybernetics: Systems, vol. 46, iss. 2, pp. 282-293, 2016.
    [Bibtex]
    @Article{Rodriguez2016d,
    Title = {{On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets}},
    Author = {Ricardo J. Rodr\'{i}guez},
    Journal = {IEEE Transactions on Systems, Man and Cybernetics: Systems},
    Year = {2016},
    Month = {Feb},
    Number = {2},
    Pages = {282--293},
    Volume = {46},
    Abstract = {A Fault Tree (FT) defines an undesired top event, characterizing it using logic combinations of lower-level undesired events. In this paper, we focus on coherent FTs, i.e., the logic is restricted to AND/OR formulae. Fault Tree analysis is used to identify and assess the Minimal Cut Sets (MCS) of an FT, which define the minimal set of events leading to the undesired state. The dual of MCS is Minimal Path Set (MPS). MCS and MPS are commonly used for qualitative evaluation of FTs in safety and reliability engineering. This paper explores computation of the MCS/MPS of an FT by means of structural analysis (namely, computation of minimal p-semiflows) of a Petri net that represents the FT. To this end, we propose a formal definition of a coherent FT and a transformation from this model to a Petri net subclass (namely, structurally persistent nets). We also prove the relationship between minimal p-semiflows and MCS/MPS in an FT. In addition, we propose an algorithm that uses linear programming techniques to compute the MCS/MPS in an FT. Finally, we put our findings into practice by qualitatively evaluating the FT of a pressure tank system.},
    Doi = {10.1109/TSMC.2015.2437360},
    ISSN = {2168-2216},
    Keywords = {Fault Trees, Petri nets, Linear Programming, qualitative evaluation, cut sets},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/R-SMC-Sys-16.pdf}
    }
  • [DOI] R. J. Rodríguez, X. Chang, X. Li, and K. S. Trivedi, “Survivability Analysis of a Computer System under an Advanced Persistent Threat Attack,” in Proceedings of the 3rd International Workshop on Graphical Models for Security, 2016, pp. 134-149.
    [Bibtex]
    @InProceedings{Rodriguez2016,
    Title = {{Survivability Analysis of a Computer System under an Advanced Persistent Threat Attack}},
    Author = {Ricardo J. Rodr\'{i}guez and Xiaolin Chang and Xiaodan Li and Kishor S. Trivedi},
    Booktitle = {Proceedings of the 3rd International Workshop on Graphical Models for Security},
    Year = {2016},
    Editor = {Kordy, Barbara and Ekstedt, Mathias and Kim, Seong Dong},
    Pages = {134--149},
    Abstract = {Computer systems are potentially targeted by cybercriminals by means of specially crafted malicious software called Advanced Persistent Threats (APTs). As a consequence, any security attribute of the computer system may be compromised: disruption of service (availability), unauthorized data modification (integrity), or exfiltration of sensitive data (confidentiality). An APT starts with the exploitation of software vulnerability within the system. Thus, vulnerability mitigation strategies must be designed and deployed in a timely manner to reduce the window of exposure of vulnerable systems. In this paper, we evaluate the survivability of a computer system under an APT attack using a Markov model. Generation and solution of the Markov model are facilitated by means of a high-level formalism based on stochastic Petri nets. Survivability metrics are defined to quantify security attributes of the system from the public announcement of a software vulnerability and during the system recovery. The proposed model and metrics not only enable us to quantitatively assess the system survivability in terms of security attributes but also provide insights on the cost/revenue trade-offs of investment efforts in system recovery such as vulnerability mitigation strategies. Sensitivity analysis through numerical experiments is carried out to study the impact of key parameters on system secure survivability.},
    Doi = {10.1007/978-3-319-46263-9_9},
    Keywords = {APT, Cyberattacks, Markov chains, Stochastic reward nets, Security metrics, Survivability, Transient analysis},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RCLT-GraMSec-16.pdf}
    }
  • [DOI] R. J. Rodríguez and S. Marrone, “Model-Based Vulnerability Assessment of Self-Adaptive Protection Systems” in Intelligent Distributed Computing IX, P. Novais, D. Camacho, C. Analide, A. El Fallah Seghrouchni, and C. Badica, Eds., Springer International Publishing, 2016, vol. 616, pp. 439-449.
    [Bibtex]
    @InCollection{Rodriguez2016b,
    Title = {{Model-Based Vulnerability Assessment of Self-Adaptive Protection Systems}},
    Author = {Ricardo J. Rodr\'{i}guez and Stefano Marrone},
    Booktitle = {Intelligent Distributed Computing IX},
    Publisher = {Springer International Publishing},
    Year = {2016},
    Editor = {Novais, Paulo and Camacho, David and Analide, Cesar and El Fallah Seghrouchni, Amal and Badica, Costin},
    Pages = {439--449},
    Series = {Studies in Computational Intelligence},
    Volume = {616},
    Abstract = {Security mechanisms are at the base of modern computer systems, demanded to be more and more reactive to changing environments and malicious intentions. Security policies unable to change in time are destined to be exploited and thus, system security compromised. However, the ability to properly change security policies is only possible once the most effective mechanism to adopt under specific conditions is known. This paper proposes a model-based approach to accomplish this goal: a vulnerability model of the system is built by means of a model-based, layered security approach, and used to quantitatively evaluate the best protection mechanism at a given time and hence, to adapt the system to changing environments. The evaluation relies on the use of a powerful, flexible formalism such as Dynamic Bayesian Networks.},
    Doi = {10.1007/978-3-319-25017-5_41},
    ISBN = {978-3-319-25015-1},
    Language = {English},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RM-WSRL-16.pdf}
    }
  • [DOI] R. J. Rodríguez, I. Rodríguez-Gastón, and J. Alonso, “Towards the Detection of Isolation-Aware Malware,” IEEE Latin America Transactions (Revista IEEE America Latina), vol. 14, iss. 2, pp. 1024-1036, 2016.
    [Bibtex]
    @Article{Rodriguez2016c,
    Title = {{Towards the Detection of Isolation-Aware Malware}},
    Author = {Ricardo J. Rodr\'{i}guez and I\~{n}aki Rodr\'{i}guez-Gast\'{o}n and Javier Alonso},
    Journal = {IEEE Latin America Transactions (Revista IEEE America Latina)},
    Year = {2016},
    Month = feb,
    Number = {2},
    Pages = {1024--1036},
    Volume = {14},
    Abstract = {Malware analysis tools have evolved in the last years providing tightly controlled sandbox and virtualised environments where malware is analysed minimising potential harmful consequences. Unfortunately, malware has advanced in parallel, being currently able to recognise when is running in sandbox or virtual environments and then, behaving as a non-harmful application or even not executing at all. This kind of malware is usually called analysis-aware malware. In this paper, we propose a tool to detect the evasion techniques used by analysis-aware malware within sandbox or virtualised environments. Our tool uses Dynamic Binary Instrumentation to maintain the binary functionality while executing arbitrary code. We evaluate the tool under a set of well-known analysis-aware malware showing its current effectiveness. Finally, we discuss limitations of our proposal and future directions.},
    Doi = {10.1109/TLA.2016.7437254},
    ISSN = {1548-0992},
    Keywords = {Instruments;Malware;Proposals;Silicon compounds;Software;Virtual environments;analysis-aware malware;binary analysis;dynamic binary instrumentation},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RRA-LATAM-16.pdf}
    }

2015

  • [DOI] P. Álvarez, S. Hernández, J. Fabra, and J. Ezpeleta, “Cost Estimation for the Provisioning of Computing Resources to Execute Bag-of-Tasks Applications in the Amazon Cloud,” in Economics of Grids, Clouds, Systems, and Services – 12th International Conference, GECON 2015, Cluj-Napoca, Romania, September 15-17, 2015, Revised Selected Papers, 2015, pp. 65-77.
    [Bibtex]
    @InProceedings{Alvarez2015,
    Title = {Cost Estimation for the Provisioning of Computing Resources to Execute Bag-of-Tasks Applications in the Amazon Cloud},
    Author = {Pedro {\'{A}}lvarez and Sergio Hern{\'{a}}ndez and Javier Fabra and Joaqu{\'{\i}}n Ezpeleta},
    Booktitle = {Economics of Grids, Clouds, Systems, and Services - 12th International Conference, {GECON} 2015, Cluj-Napoca, Romania, September 15-17, 2015, Revised Selected Papers},
    Year = {2015},
    Pages = {65--77},
    Crossref = {DBLP:conf/gecon/2015},
    Doi = {10.1007/978-3-319-43177-2_5},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1007/978-3-319-43177-2_5}
    }
  • P. Álvarez and S. Baldassarri, “Creación participativa de una red semántica de material docente a partir de la descripción de los contenidos de una asignatura,” in XXI Jornadas sobre la Enseñanza Universitaria de la Informática (JENUI 2015), 2015, pp. 51-57.
    [Bibtex]
    @InProceedings{Alvarez2015b,
    Title = {Creaci\'on participativa de una red sem\'antica de material docente a partir de la descripci\'on de los contenidos de una asignatura},
    Author = {P. \'Alvarez and S. Baldassarri},
    Booktitle = {XXI Jornadas sobre la Enseñanza Universitaria de la Informática (JENUI 2015)},
    Year = {2015},
    Pages = {51-57},
    __markedentry = {[jcampos:]}
    }
  • P. Álvarez, S. Hernández, J. Fabra, and J. Ezpeleta, “Estimación del coste de aprovisionar instancias de cómputo para ejecutar aplicaciones bag-of-task en el cloud de Amazon,” in XI Jornadas de Ciencia e Ingeniería de Servicios (JCIS’15), 2015.
    [Bibtex]
    @InProceedings{Alvarez2015a,
    Title = {Estimaci\'on del coste de aprovisionar instancias de c\'omputo para ejecutar aplicaciones bag-of-task en el cloud de Amazon},
    Author = {\'Alvarez, Pedro and Hern\'andez, Sergio and Fabra, Javier and Ezpeleta, Joaqu\'in},
    Booktitle = {XI Jornadas de Ciencia e Ingenier\'ia de Servicios (JCIS'15)},
    Year = {2015},
    __markedentry = {[jcampos:]},
    Owner = {shernandez},
    Timestamp = {2015.09.29}
    }
  • C. Bernabei, F. Guerra, and R. Trillo-Lado, “Keyword search in structured data and network analysis: A preliminary experiment over DBLP,” in SMAP, 2015, pp. 1-6.
    [Bibtex]
    @InProceedings{Bernabei2015,
    Title = {Keyword search in structured data and network analysis: {A} preliminary
    experiment over {DBLP}},
    Author = {Chiara Bernabei and
    Francesco Guerra and
    Raquel Trillo-Lado},
    Booktitle = {{SMAP}},
    Year = {2015},
    Pages = {1--6},
    Publisher = {{IEEE} Computer Society},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] S. Bernardi, L. Dranca, and J. Merseguer, “Modelling and Verification of Survivability Requirements for Critical Systems” in Software Engineering and Formal Methods: SEFM 2014 Collocated Workshops, Grenoble, France, September 1-2, 2014, Revised Selected Papers, Springer International Publishing, 2015, pp. 86-100.
    [Bibtex]
    @InBook{Bernardi2015,
    Title = {Modelling and Verification of Survivability Requirements for Critical Systems},
    Author = {Bernardi, Simona and Dranca, Lacramioara and Merseguer, Jos{\'e}},
    Pages = {86--100},
    Publisher = {Springer International Publishing},
    Year = {2015},
    Booktitle = {Software Engineering and Formal Methods: SEFM 2014 Collocated Workshops, Grenoble, France, September 1-2, 2014, Revised Selected Papers},
    Doi = {10.1007/978-3-319-15201-1_6},
    ISBN = {978-3-319-15201-1}
    }
  • [DOI] A. Botas, R. J. Rodríguez, T. Vaisanen, and P. Zdzichowski, “Counterfeiting and Defending the Digital Forensic Process,” in Proceedings of the 2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing (CIT/IUCC/DASC/PICOM), 2015, pp. 1966-1971.
    [Bibtex]
    @InProceedings{Botas2015,
    Title = {{Counterfeiting and Defending the Digital Forensic Process}},
    Author = {Alvaro Botas and Ricardo J. Rodr\'{i}guez and Teemu Vaisanen and Patrycjusz Zdzichowski},
    Booktitle = {Proceedings of the 2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing (CIT/IUCC/DASC/PICOM)},
    Year = {2015},
    Month = {Oct},
    Pages = {1966--1971},
    Publisher = {IEEE},
    Abstract = {During the last years, criminals have become aware of how digital evidences that lead them to courts and jail are collected and analyzed. Hence, they have started to develop anti-forensic techniques to evade, hamper, or nullify their evidences. Nowadays, these techniques are broadly used by criminals, causing the forensic analysis to be in a state of decay. To defeat against these techniques, forensic analyst need to first identify
    them, and then to mitigate somehow their effects. In this paper, we review the anti-forensic techniques and propose a new taxonomy that relates them to the initial phase of a forensic process mainly affected by each technique. Furthermore, we introduce mitigation techniques for these anti-forensic techniques, considering the chance to overcome the anti-forensic techniques and the difficulty to apply them.},
    Doi = {10.1109/CIT/IUCC/DASC/PICOM.2015.291},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/BRVZ-CEWE-15.pdf}
    }
  • S. Cadegnani, F. Guerra, S. Ilarri, M. C. del Rodríguez-Hernández, R. Trillo-Lado, and Y. Velegrakis, “Recommending Web Pages Using Item-Based Collaborative Filtering Approaches,” in International KEYSTONE Conference, 2015, pp. 17-29.
    [Bibtex]
    @InProceedings{Cadegnani2015,
    Title = {Recommending Web Pages Using Item-Based Collaborative Filtering Approaches},
    Author = {Sara Cadegnani and
    Francesco Guerra and
    Sergio Ilarri and
    Mar{\'{\i}}a del Carmen Rodr{\'{\i}}guez-Hern{\'{a}}ndez and
    Raquel Trillo-Lado and
    Yannis Velegrakis},
    Booktitle = {International {KEYSTONE} Conference},
    Year = {2015},
    Pages = {17--29},
    Publisher = {Springer},
    Series = {Lecture Notes in Computer Science},
    Volume = {9398},
    __markedentry = {[jcampos:6]}
    }
  • M. C. del Rodríguez-Hernández, S. Ilarri, R. Trillo-Lado, and R. Hermoso, “Location-Aware Recommendation Systems: Where We Are and Where We Recommend to Go,” in LocalRec@RecSys, 2015, pp. 1-8.
    [Bibtex]
    @InProceedings{CarmenRodriguez-Hernandez2015,
    Title = {Location-Aware Recommendation Systems: Where We Are and Where We Recommend
    to Go},
    Author = {Mar{\'{\i}}a del Carmen Rodr{\'{\i}}guez-Hern{\'{a}}ndez and
    Sergio Ilarri and
    Raquel Trillo-Lado and
    Ram{\'{o}}n Hermoso},
    Booktitle = {LocalRec@RecSys},
    Year = {2015},
    Pages = {1--8},
    Publisher = {CEUR-WS.org},
    Series = {{CEUR} Workshop Proceedings},
    Volume = {1405},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] G. Casale, D. Ardagna, M. Artac, F. Barbier, E. D. Nitto, A. Henry, G. Iuhasz, C. Joubert, J. Merseguer, V. I. Munteanu, J. F. Pérez, D. Petcu, M. Rossi, C. Sheridan, I. Spais, and D. Vladuic, “DICE: Quality-Driven Development of Data-Intensive Cloud Applications,” in 7th IEEE/ACM International Workshop on Modeling in Software Engineering, MiSE 2015, Florence, Italy, May 16-17, 2015, 2015, pp. 78-83.
    [Bibtex]
    @InProceedings{Casale2015,
    Title = {{DICE:} Quality-Driven Development of Data-Intensive Cloud Applications},
    Author = {Giuliano Casale and Danilo Ardagna and Matej Artac and Franck Barbier and Elisabetta Di Nitto and Alexis Henry and Gabriel Iuhasz and Christophe Joubert and Jos{\'{e}} Merseguer and Victor Ion Munteanu and Juan Fernando P{\'{e}}rez and Dana Petcu and Matteo Rossi and Craig Sheridan and Ilias Spais and Daniel Vladuic},
    Booktitle = {7th {IEEE/ACM} International Workshop on Modeling in Software Engineering, MiSE 2015, Florence, Italy, May 16-17, 2015},
    Year = {2015},
    Pages = {78--83},
    Doi = {10.1109/MiSE.2015.21},
    Url = {http://dx.doi.org/10.1109/MiSE.2015.21}
    }
  • [DOI] J. Fabra, S. Hernández, E. Otero, J. C. Vidal, M. Lama, and P. Álvarez, “Integration of grid, cluster and cloud resources to semantically annotate a large-sized repository of learning objects,” Concurrency and Computation: Practice and Experience, vol. 27, iss. 17, pp. 4603-4629, 2015.
    [Bibtex]
    @Article{Fabra2015,
    Title = {Integration of grid, cluster and cloud resources to semantically annotate a large-sized repository of learning objects},
    Author = {Fabra, Javier and Hern\'{a}ndez, Sergio and Otero, Estefan\'{i}a and Vidal, Juan C. and Lama, Manuel and \'{A}lvarez, Pedro},
    Journal = {Concurrency and Computation: Practice and Experience},
    Year = {2015},
    Number = {17},
    Pages = {4603--4629},
    Volume = {27},
    __markedentry = {[jcampos:]},
    Doi = {10.1002/cpe.3427},
    ISSN = {1532-0634},
    Keywords = {grid and cloud computing, workflow technologies, semantic annotation, linked lata, learning objects, DBpedia},
    Url = {http://dx.doi.org/10.1002/cpe.3427}
    }
  • [DOI] E. Gómez-Martínez, M. L. Trigueros, F. Sánchez-Figueroa, A. Iglesias-Pérez, J. C. Preciado, R. González-Cabero, and J. Merseguer, “A semantic approach for designing Assistive Software Recommender systems,” Journal of Systems and Software, vol. 104, pp. 166-178, 2015.
    [Bibtex]
    @Article{Gomez-Martinez2015a,
    Title = {A semantic approach for designing Assistive Software Recommender systems},
    Author = {Elena G{\'{o}}mez-Mart{\'{\i}}nez and Marino Linaje Trigueros and Fernando S{\'{a}}nchez-Figueroa and Andr{\'{e}}s Iglesias-P{\'{e}}rez and Juan Carlos Preciado and Rafael Gonz{\'{a}}lez-Cabero and Jos{\'{e}} Merseguer},
    Journal = {Journal of Systems and Software},
    Year = {2015},
    Pages = {166--178},
    Volume = {104},
    Doi = {10.1016/j.jss.2015.03.009},
    Url = {http://dx.doi.org/10.1016/j.jss.2015.03.009}
    }
  • [DOI] E. Gómez-Martínez, R. J. Rodríguez, L. Etxeberria, M. Illarramendi, and C. Benac, “Model-Based Verification of Safety Contracts,” in Proceedings of the 1st International Workshop on Safety and Formal Methods (SaFoMe), 2015, pp. 101-115.
    [Bibtex]
    @InProceedings{Gomez-Martinez2015,
    Title = {{Model-Based Verification of Safety Contracts}},
    Author = {Elena G\'{o}mez-Mart\'{i}nez and Ricardo J. Rodr\'{i}guez and Leire Etxeberria and Miren Illarramendi and Clara Benac},
    Booktitle = {Proceedings of the 1st International Workshop on Safety and Formal Methods (SaFoMe)},
    Year = {2015},
    Pages = {101--115},
    Publisher = {Springer International Publishing},
    Series = {Lecture Notes in Computer Science},
    Volume = {8938},
    Abstract = {The verification of safety becomes crucial in critical systems where human lives depend on the correct functioning of such systems. Formal methods have often been advocated as necessary to ensure the reliability of software systems, albeit with a considerable effort. In any case, such an effort is cost-effective when verifying safety-critical systems. Safety requirements are usually expressed using safety contracts, in terms of assumptions and guarantees. To facilitate the adoption of formal methods in the safety-critical software industry, we propose the use of well-known modelling languages, such as UML, to model a software system, and the use of OCL to express the system safety contracts within UML. A UML model enriched with OCL constraints is then transformed to a Petri net model that enables to formally verify such safety contracts. We apply our approach to an industrial case study that models a train doors controller in charge of the opening and closing of train doors. Our approach allows to perform an early safety verification, which increases the confidence of software engineers while designing the system.},
    Doi = {10.1007/978-3-319-15201-1_7},
    ISBN = {978-3-319-15200-4},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/GREIB-SAFOME-15.pdf}
    }
  • R. Hermoso, S. Ilarri, R. Trillo-Lado, and M. C. del Rodríguez-Hernández, “Push-Based Recommendations in Mobile Computing Using a Multi-Layer Contextual Approach,” in MoMM, 2015, pp. 149-158.
    [Bibtex]
    @InProceedings{Hermoso2015,
    Title = {Push-Based Recommendations in Mobile Computing Using a Multi-Layer
    Contextual Approach},
    Author = {Ram{\'{o}}n Hermoso and
    Sergio Ilarri and
    Raquel Trillo-Lado and
    Mar{\'{\i}}a del Carmen Rodr{\'{\i}}guez-Hern{\'{a}}ndez},
    Booktitle = {MoMM},
    Year = {2015},
    Pages = {149--158},
    Publisher = {{ACM}},
    __markedentry = {[jcampos:6]}
    }
  • S. Ilarri, T. Delot, and R. Trillo-Lado, “A Data Management Perspective on Vehicular Networks,” IEEE Communications Surveys and Tutorials, vol. 17, iss. 4, pp. 2420-2460, 2015.
    [Bibtex]
    @Article{Ilarri2015,
    Title = {A Data Management Perspective on Vehicular Networks},
    Author = {Sergio Ilarri and
    Thierry Delot and
    Raquel Trillo-Lado},
    Journal = {{IEEE} Communications Surveys and Tutorials},
    Year = {2015},
    Number = {4},
    Pages = {2420--2460},
    Volume = {17},
    __markedentry = {[jcampos:6]}
    }
  • S. Ilarri, R. Hermoso, R. Trillo-Lado, and M. C. del Rodríguez-Hernández, “A Review of the Role of Sensors in Mobile Context-Aware Recommendation Systems,” IJDSN, vol. 11, p. 489264:1–489264:30, 2015.
    [Bibtex]
    @Article{Ilarri2015a,
    Title = {A Review of the Role of Sensors in Mobile Context-Aware Recommendation
    Systems},
    Author = {Sergio Ilarri and
    Ram{\'{o}}n Hermoso and
    Raquel Trillo-Lado and
    Mar{\'{\i}}a del Carmen Rodr{\'{\i}}guez-Hern{\'{a}}ndez},
    Journal = {{IJDSN}},
    Year = {2015},
    Pages = {489264:1--489264:30},
    Volume = {11},
    __markedentry = {[jcampos:6]}
    }
  • M. T. Lozano-Albalate, R. Trillo-Lado, M. V. -, A. Allueva, and E. Cerezo, “An ICT experience in Computer Women Role promotion: WikinformáticA! in Aragón: Promoting the use of Wiki tools and visualizing the role of women in ICT,” in Interacción, 2015, p. 33:1–33:4.
    [Bibtex]
    @InProceedings{Lozano-Albalate2015,
    Title = {An {ICT} experience in Computer Women Role promotion: Wikinform{\'{a}}ticA!
    in Arag{\'{o}}n: Promoting the use of Wiki tools and visualizing the
    role of women in {ICT}},
    Author = {Mar{\'{\i}}a Teresa Lozano-Albalate and
    Raquel Trillo-Lado and
    Mar{\'{\i}}a Villarroya{-}Gaud{\'{o}} and
    Ana Allueva and
    Eva Cerezo},
    Booktitle = {Interacci{\'{o}}n},
    Year = {2015},
    Pages = {33:1--33:4},
    Publisher = {{ACM}},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] S. Marrone, R. J. Rodríguez, R. Nardone, F. Flammini, and V. Vittorini, “On Synergies of Cyber and Physical Security Modelling in Vulnerability Assessment of Railway Systems,” Computers and Electrical Engineering, vol. 47, pp. 275-285, 2015.
    [Bibtex]
    @Article{Marrone2015,
    Title = {{On Synergies of Cyber and Physical Security Modelling in Vulnerability Assessment of Railway Systems}},
    Author = {Stefano Marrone and Ricardo J. Rodr\'{i}guez and Roberto Nardone and Francesco Flammini and Valeria Vittorini},
    Journal = {Computers and Electrical Engineering},
    Year = {2015},
    Pages = {275--285},
    Volume = {47},
    Abstract = {The multifaceted nature of cyber-physical systems needs holistic study methods to detect essential aspects and interrelations among physical and cyber components. Like the systems themselves, security threats feature both cyber and physical elements. Although to apply divide et impera approaches helps handling system complexity, to consider just one aspect at a time does not provide adequate risk awareness and hence does not allow to design the most appropriate countermeasures. To support this claim, in this paper we provide a joint application of two model-driven techniques for physical and cyber-security evaluation. We apply two UML profiles, namely SecAM (for cyber-security) and CIP\_VAM (for physical security), in combination. In such a way, we demonstrate the synergy between both profiles and the need for their tighter integration in the context of a reference case study from the railway domain.},
    Doi = {10.1016/j.compeleceng.2015.07.011},
    ISSN = {0045-7906},
    Keywords = {Cyber-physical systems, Vulnerability assessment, UML profile, Bayesian networks, Generalized stochastic Petri nets},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/MRNFV-CAEE-15.pdf}
    }
  • [DOI] S. Pérez, H. Facchini, J. Campos, C. Taffernaberry, F. Hidalgo, and S. Méndez, “Behavior of Codecs for Multicast Video Traffic using WAN Test Bed,” in Proceedings of the 2015 Chilean Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON’15), Santiago, Chile, 2015, pp. 269-274.
    [Bibtex]
    @InProceedings{PFCTHM-CHILECON-15,
    Title = {Behavior of Codecs for Multicast Video Traffic using {WAN} Test Bed},
    Author = {S. P{\'e}rez and H. Facchini and J. Campos and C. Taffernaberry and F. Hidalgo and S. M{\'e}ndez},
    Booktitle = {Proceedings of the 2015 Chilean Conference on Electrical, Electronics Engineering, Information and Communication Technologies {(CHILECON'15)}},
    Year = {2015},
    Address = {Santiago, Chile},
    Month = {October},
    Pages = {269-274},
    Publisher = {IEEE Computer Society},
    Abstract = {In recent years there has been an exponential
    increase in the growth in multimedia applications, and in
    particular in video applications. Understanding the behavior of
    the video traffic and the requirements for the network helps
    network administrators to improve the traffic. In this work, a
    quantitative analysis is performed by experimentation, in order
    to evaluate the behavior and impact of video traffic on WAN
    networks. We propose a WAN test bed composed by a video
    traffic server and several client stations. This article introduces a
    scenario that allows to inject multicast video traffic, compressed
    with several codecs. From capturing video traffic, we identified
    several interesting performance metrics, such as multicast
    throughput, interframe space and frame size distributions, and
    the number of frames. We include detailed contributions on the
    impact produced by several factors, such as the configuration of
    the resolution of the video, the video class, the codec used for the
    compression, and the use of multicast traffic when there are
    restrictions on the bandwidth, as in a corporate real WAN link of
    some few Mbps. This study facilitates the comparison of the
    results with those obtained from analytical studies and modelling
    for different contexts.},
    Doi = {10.1109/Chilecon.2015.7400387},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pfcthm-chilecon-15.pdf}
    }
  • [DOI] S. Pérez, H. Facchini, A. Dantiacq, G. Cangemi, and J. Campos, “An Evaluation of QoS for intensive video traffic over 802.11e WLANs,” in Proceedings of the 25th International Conference on Electronics, Communications and Computers (CONIELECOMP’15), Puebla, Mexico, 2015, pp. 8-15.
    [Bibtex]
    @InProceedings{PFDCC-CONIELECOMP-15,
    Title = {An Evaluation of {QoS} for intensive video traffic over 802.11e {WLANs}},
    Author = {S. P{\'e}rez and H. Facchini and A. Dantiacq and G. Cangemi and J. Campos},
    Booktitle = {Proceedings of the 25th International Conference on Electronics, Communications and Computers {(CONIELECOMP'15)}},
    Year = {2015},
    Address = {Puebla, Mexico},
    Month = {February},
    Pages = {8-15},
    Publisher = {IEEE Computer Society},
    Abstract = {With the continuing development of the wireless
    technologies (Wi-Fi, 3G, 4G, WiMax and Bluethooth), the study
    of wireless multimedia transmissions has gained lately more
    attention. For example, the expectations of the company leaders
    on the growth of Wi-Fi video traffic has updated the lines of
    research on the standard IEEE 802.11e introduced to provide
    QoS (Quality of Service) to WLAN (Wireless LAN ) networks. A
    quantitative analysis has been performed by simulation. We use a
    node model EDCA (Enhanced Distributed Channel Access)
    802.11e with the tool M{\"o}bius of the University of Illinois, which
    supports an extension of SPN (Stochastic Petri Networks), known
    as HSAN (Hierarchical Stochastic Activity Networks). This
    formalism favors the comparison of the results with those
    obtained from other tools, based mainly on simulation languages,
    for Wi-Fi stations with the capacity to transmit voice, video or
    best effort traffic in presence of error. This article introduces
    novel scenario that varies the load by increasing the number of
    active stations from 5 to 45 but maintaining their relative traffic
    proportion. The proportion of traffic injected by stations is 65\%
    video, 2\% voice, and 33\% best effort. Measured performance
    metrics were absolute or direct performance, relative
    performance, average delay of queue, and average queue size.},
    Doi = {10.1109/CONIELECOMP.2015.7086933},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pfdcc-conielecomp-15.pdf}
    }
  • S. Pérez, H. Facchini, A. Dantiacq, G. Cangemi, and J. Campos, “Analysis of Impact in the Wi-Fi QoS of the EDCA Parameters,” Journal of Computer Science & Technology, vol. 15, iss. 1, pp. 8-14, 2015.
    [Bibtex]
    @Article{PFDCC-JCST-15,
    Title = {Analysis of Impact in the {Wi-Fi QoS} of the {EDCA} Parameters},
    Author = {S. P{\'e}rez and H. Facchini and A. Dantiacq and G. Cangemi and J. Campos},
    Journal = {Journal of Computer Science \& Technology},
    Year = {2015},
    Month = {April},
    Number = {1},
    Pages = {8-14},
    Volume = {15},
    Abstract = {With the continuing development of the wireless technologies
    (Wi-Fi, 3G, 4G, WiMax and Bluethooth), the study of wireless multimedia
    transmissions has gained lately more attention. For example, the expectations
    of the company leaders on the growth of Wi-Fi video traffic has updated the
    lines of research on the standard IEEE 802.11e introduced to provide QoS
    (Quality of Service) to WLAN (Wireless LAN ) networks. In this paper we
    updated with greater accuracy, using other resources and the experience
    gained since the emergence of the standard, the work carried out previously
    on the quantitative impact of each EDCA (Enhanced Distributed Channel Access)
    parameter on the overall performance of the mechanisms MAC. A quantitative
    analysis of the optimizations that can be achieved has been performed by
    simulation. We use a node model EDCA 802.11e with the tool M{\"o}bius of the
    University of Illinois, which supports an extension of SPN (Stochastic Petri
    Networks), known as HSAN (Hierarchical Stochastic Activity Networks), what
    favors the contrast with other tools or mathematical resources. We use a
    realistic scenario formed by Wi-Fi stations with the capacity to transmit
    voice, video and best effort traffic. The results show that the default
    setting of EDCA parameters is not optimal, and that with an appropriate
    selection, very significant improvements can be obtained.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pfdcc-jcst-15.pdf}
    }
  • [DOI] R. J. Rodríguez, “A Petri Net Tool for Software Performance Estimation Based on Upper Throughput Bounds,” Automated Software Engineering, vol. PP, iss. PP, p. PP, 2015.
    [Bibtex]
    @Article{Rodriguez2015,
    Title = {{A Petri Net Tool for Software Performance Estimation Based on Upper Throughput Bounds}},
    Author = {Ricardo J. Rodr\'{i}guez},
    Journal = {Automated Software Engineering},
    Year = {2015},
    Note = {Special Issue on Automation in Software Performance Engineering. To appear.},
    Number = {PP},
    Pages = {PP},
    Volume = {PP},
    Abstract = {Functional and non-functional properties analysis (i.e., dependability, security, or performance) ensures that requirements are fulfilled during the design phase of software systems. However, the Unified Modelling Language (UML), standard de facto in industry for software systems modelling, is unsuitable for any kind of analysis but can be tailored for specific analysis purposes through profiling. For instance, the MARTE profile enables to annotate performance data within UML models that can be later transformed to formal models (e.g., Petri nets or Timed Automatas) for performance evaluation. A performance (or throughput) estimation in such models normally relies on a whole exploration of the state space, which becomes unfeasible for large systems. To overcome this issue upper throughput bounds are computed, which provide an approximation to the real system throughput with a good
    complexity-accuracy trade-off. This paper introduces a tool, named PeabraiN, that estimates the performance of software systems via their UML models. To do so, UML models are transformed to Petri nets where performance is estimated based on upper throughput bounds computation. PeabraiN also allows to compute other features on Petri nets, such as the computation of upper and lower marking place bounds, and to simulate using an approximate (continuous) method. We show the applicability of PeabraiN by evaluating the performance of a building closed circuit TV system.},
    Doi = {10.1007/s10515-015-0186-2},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/R-AUSE-15.pdf}
    }
  • [DOI] R. J. Rodríguez, J. Merseguer, and S. Bernardi, “Modelling Security of Critical Infrastructures: A Survivability Assessment,” The Computer Journal, vol. 58, iss. 10, pp. 2313-2327, 2015.
    [Bibtex]
    @Article{Rodriguez2015a,
    Title = {{Modelling Security of Critical Infrastructures: A Survivability Assessment}},
    Author = {Ricardo J. Rodr\'{i}guez and Jos\'{e} Merseguer and Simona Bernardi},
    Journal = {The Computer Journal},
    Year = {2015},
    Number = {10},
    Pages = {2313--2327},
    Volume = {58},
    Abstract = {Critical infrastructures, usually designed to handle disruptions caused by human errors or random acts of nature, define assets whose normal operation must be guaranteed to maintain its essential services for human daily living. Malicious intended attacks to these targets need to be considered during system design. To face with these situations, defense plans must be developed in advance. In this paper, we present a UML profile, named SecAM, that enables the modelling and security specification for critical infrastructures during the early phases (requirements, design) of systems development life-cycle. SecAM endows security assessment, through survivability analysis, of different security solutions before system deployment. As a case study, we evaluate the survivability of the Saudi Arabia crude-oil pipeline network under two different attack scenarios. The stochastic analysis, carried out with Generalized Stochastic Petri nets, quantitatively estimates the minimisation of attack damages into the crude-oil network.},
    Doi = {10.1093/comjnl/BXU096},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RMB-COMPJ-15.pdf}
    }
  • [DOI] J. Vila and R. J. Rodríguez, “Practical Experiences on NFC Relay Attacks with Android: Virtual Pickpocketing Revisited,” in Proceedings of the 11th International Workshop on RFID Security (RFIDsec), 2015, pp. 87-103.
    [Bibtex]
    @InProceedings{Vila2015,
    Title = {{Practical Experiences on NFC Relay Attacks with Android: Virtual Pickpocketing Revisited}},
    Author = {Jos\'{e} Vila and Ricardo J. Rodr\'{i}guez},
    Booktitle = {Proceedings of the 11th International Workshop on RFID Security (RFIDsec)},
    Year = {2015},
    Pages = {87--103},
    Publisher = {Springer},
    Series = {Lecture Notes in Computer Science},
    Volume = {9440},
    Abstract = {Near Field Communication (NFC) is a short-range contactless communication standard recently emerging as cashless payment technology. However, NFC has been proved vulnerable to several threats, such as eavesdropping, data modification, and relay attacks. A relay attack forwards the entire wireless communication, thus communicating over larger distances. In this paper, we review and discuss feasibility limitations when performing these attacks in Google's Android OS. We show an experiment proving its feasibility using off-the-shelf NFC-enabled Android devices (i.e., no custom firmware nor root required). Thus, Android NFC-capable malicious software might appear before long to virtually pickpocket contactless payment cards within its proximity.},
    Doi = {10.1007/978-3-319-24837-0_6},
    Keywords = {NFC; security; relay attacks; Android; contactless payment},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/VR-RFIDsec-15.pdf}
    }
  • [DOI] Quantitative Evaluation of Systems, J. Campos and B. Haverkort, Eds., Springer, 2015, vol. 9259. [Publisher URL]
    [Bibtex]
    @Book{QEST2015,
    Title = {Quantitative Evaluation of Systems},
    Editor = {J. Campos and B. Haverkort},
    Publisher = {Springer},
    Year = {2015},
    Note = {Proceedings of the 12th International Conference on Quantitative Evaluation of Systems (QEST 2015), Madrid, Spain, September 1-3, 2015},
    Series = {Lecture Notes in Computer Science},
    Volume = {9259},
    Doi = {10.1007/978-3-319-22264-6},
    Url = {http://www.springer.com/us/book/9783319222639}
    }

2014

  • [DOI] S. Bernardi, J. M. Colom, J. Albareda, and C. Mahulea, “A model-based approach for the specification and verification of clinical guidelines,” in Proceedings of the 2014 IEEE Emerging Technology and Factory Automation, ETFA 2014, Barcelona, Spain, September 16-19, 2014, 2014, pp. 1-8.
    [Bibtex]
    @InProceedings{Bernardi2014a,
    Title = {A model-based approach for the specification and verification of clinical guidelines},
    Author = {Simona Bernardi and Jos{\'{e}} Manuel Colom and Jorge Albareda and Cristian Mahulea},
    Booktitle = {Proceedings of the 2014 {IEEE} Emerging Technology and Factory Automation, {ETFA} 2014, Barcelona, Spain, September 16-19, 2014},
    Year = {2014},
    Pages = {1--8},
    Doi = {10.1109/ETFA.2014.7005058}
    }
  • [DOI] S. Bernardi, L. Dranca, and J. Merseguer, “Modelling and Verification of Survivability Requirements for Critical Systems,” in Software Engineering and Formal Methods – SEFM 2014 Collocated Workshops: HOFM, SAFOME, OpenCert, MoKMaSD, WS-FMDS, Grenoble, France, September 1-2, 2014, Revised Selected Papers, 2014, pp. 86-100.
    [Bibtex]
    @InProceedings{Bernardi2014,
    Title = {Modelling and Verification of Survivability Requirements for Critical Systems},
    Author = {Simona Bernardi and Lacramioara Dranca and Jos{\'{e}} Merseguer},
    Booktitle = {Software Engineering and Formal Methods - {SEFM} 2014 Collocated Workshops: HOFM, SAFOME, OpenCert, MoKMaSD, WS-FMDS, Grenoble, France, September 1-2, 2014, Revised Selected Papers},
    Year = {2014},
    Pages = {86--100},
    Doi = {10.1007/978-3-319-15201-1_6}
    }
  • M. G. Buey, A. L. Garrido, S. Escudero, R. Trillo-Lado, S. Ilarri, and E. Mena, “SQX-Lib: Developing a Semantic Query Expansion System in a Media Group,” in ECIR, 2014, pp. 780-783.
    [Bibtex]
    @InProceedings{Buey2014,
    Title = {SQX-Lib: Developing a Semantic Query Expansion System in a Media Group},
    Author = {Mar{\'{\i}}a Granados Buey and
    Angel Luis Garrido and
    Sandra Escudero and
    Raquel Trillo-Lado and
    Sergio Ilarri and
    Eduardo Mena},
    Booktitle = {{ECIR}},
    Year = {2014},
    Pages = {780--783},
    Publisher = {Springer},
    Series = {Lecture Notes in Computer Science},
    Volume = {8416},
    __markedentry = {[jcampos:6]}
    }
  • J. Fabra, V. De Castro, A. Bollati, P. Álvarez, and E. Marcos, “A model-driven solution for the automatic generation of executable code from business process models” in Handbook of Research on Emerging Advancements and Technologies in Software Engineering, I. Ghani, W. Kadir, and M. Ahmad, Eds., IGI Global, 2014, pp. 213-253.
    [Bibtex]
    @InBook{Fabra2014b,
    Title = {A model-driven solution for the automatic generation of executable code from business process models},
    Author = {Fabra, Javier and De Castro, Valeria and Bollati, Andrea and {\'A}lvarez, Pedro and Marcos, Esperanza},
    Editor = {Ghani, Imran and Kadir, Wan and Ahmad, Mohammad},
    Pages = {213--253},
    Publisher = {IGI Global},
    Year = {2014},
    __markedentry = {[jcampos:]},
    Booktitle = {Handbook of Research on Emerging Advancements and Technologies in Software Engineering},
    ISBN = {1-4666-6026-0}
    }
  • [DOI] J. Fabra, S. Hernández, J. Ezpeleta, and P. Álvarez, “Solving the Interoperability Problem by Means of a Bus – An Experience on the Integration of Grid, Cluster and Cloud Infrastructures,” J. Grid Comput., vol. 12, iss. 1, pp. 41-65, 2014.
    [Bibtex]
    @Article{Fabra2014,
    Title = {Solving the Interoperability Problem by Means of a Bus - An Experience on the Integration of Grid, Cluster and Cloud Infrastructures},
    Author = {Javier Fabra and Sergio Hern{\'{a}}ndez and Joaqu{\'{\i}}n Ezpeleta and Pedro {\'{A}}lvarez},
    Journal = {J. Grid Comput.},
    Year = {2014},
    Number = {1},
    Pages = {41--65},
    Volume = {12},
    Doi = {10.1007/s10723-013-9276-1},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1007/s10723-013-9276-1}
    }
  • [DOI] E. Gómez-Martínez, R. González-Cabero, and J. Merseguer, “Performance assessment of an architecture with adaptative interfaces for people with special needs,” Empirical Software Engineering, vol. 19, iss. 6, pp. 1967-2018, 2014.
    [Bibtex]
    @Article{Gomez-Martinez2014,
    Title = {Performance assessment of an architecture with adaptative interfaces for people with special needs},
    Author = {Elena G{\'{o}}mez-Mart{\'{\i}}nez and Rafael Gonz{\'{a}}lez-Cabero and Jos{\'{e}} Merseguer},
    Journal = {Empirical Software Engineering},
    Year = {2014},
    Number = {6},
    Pages = {1967--2018},
    Volume = {19},
    Doi = {10.1007/s10664-013-9297-1},
    Url = {http://dx.doi.org/10.1007/s10664-013-9297-1}
    }
  • [DOI] S. Hernández, J. Fabra, P. Álvarez, and J. Ezpeleta, “Simulation and Realistic Workloads to Support the Meta-scheduling of Scientific Workflows” in Simulation and Modeling Methodologies, Technologies and Applications: International Conference, SIMULTECH 2012 Rome, Italy, July 28-31, 2012 Revised Selected Papers, M. S. Obaidat, J. Filipe, J. Kacprzyk, and N. Pina, Eds., Cham: Springer International Publishing, 2014, pp. 155-167.
    [Bibtex]
    @InBook{Hernandez2014,
    Title = {Simulation and Realistic Workloads to Support the Meta-scheduling of Scientific Workflows},
    Author = {Hern{\'a}ndez, Sergio and Fabra, Javier and {\'A}lvarez, Pedro and Ezpeleta, Joaqu{\'i}n},
    Editor = {Obaidat, Mohammad S. and Filipe, Joaquim and Kacprzyk, Janusz and Pina, Nuno},
    Pages = {155--167},
    Publisher = {Springer International Publishing},
    Year = {2014},
    Address = {Cham},
    __markedentry = {[jcampos:]},
    Booktitle = {Simulation and Modeling Methodologies, Technologies and Applications: International Conference, SIMULTECH 2012 Rome, Italy, July 28-31, 2012 Revised Selected Papers},
    Doi = {10.1007/978-3-319-03581-9_11},
    ISBN = {978-3-319-03581-9},
    Url = {http://dx.doi.org/10.1007/978-3-319-03581-9_11}
    }
  • S. Hernández, J. Fabra, J. Ezpeleta, and P. Álvarez, “Una solución basada en HTCondor para aprovechar la disponibilidad de recursos efímeros,” in X Jornadas de Ciencia e Ingeniería de Servicios (JCIS’14), 2014, pp. 116-125.
    [Bibtex]
    @InProceedings{Hernandez2014a,
    Title = {Una soluci\'on basada en {HTCondor} para aprovechar la disponibilidad de recursos ef\'imeros},
    Author = {Hern\'andez, Sergio and Fabra, Javier and Ezpeleta, Joaqu\'in and \'Alvarez, Pedro},
    Booktitle = {X Jornadas de Ciencia e Ingenier\'ia de Servicios (JCIS'14)},
    Year = {2014},
    Pages = {116--125},
    __markedentry = {[jcampos:]},
    Owner = {shernandez},
    Timestamp = {2015.09.29}
    }
  • [DOI] D. Perez-Palacin, R. Mirandola, and J. Merseguer, “On the relationships between QoS and software adaptability at the architectural level,” Journal of Systems and Software, vol. 87, pp. 1-17, 2014.
    [Bibtex]
    @Article{Perez-Palacin2014,
    Title = {On the relationships between QoS and software adaptability at the architectural level},
    Author = {Diego Perez-Palacin and Raffaela Mirandola and Jos{\'{e}} Merseguer},
    Journal = {Journal of Systems and Software},
    Year = {2014},
    Pages = {1--17},
    Volume = {87},
    Doi = {10.1016/j.jss.2013.07.053},
    Url = {http://dx.doi.org/10.1016/j.jss.2013.07.053}
    }
  • {. {. {R}equeno and {. {. {C}olom, “Analyzing phylogenetic trees with timed and probabilistic model checking: the lactose persistence case study,” Journal of Integrative Bioinformatics, vol. 11, iss. 3, pp. 248-263, 2014.
    [Bibtex]
    @Article{Requeno2014a,
    Title = {{A}nalyzing phylogenetic trees with timed and probabilistic model checking: the lactose persistence case study},
    Author = {{R}equeno, {J}os{\'e} {I}gnacio and {C}olom, {J}os{\'e} {M}anuel},
    Journal = {Journal of Integrative Bioinformatics},
    Year = {2014},
    Number = {3},
    Pages = {248--263},
    Volume = {11},
    Owner = {Ignacio},
    Timestamp = {2014.08.04}
    }
  • {. {. {R}equeno and {. {. {C}olom, “Timed and probabilistic model checking over phylogenetic trees” in Proceedings 8th International Conference on Practical Applications of Computational Biology and Bioinformatics, J. Saez-Rodriguez, M. P. Rocha, F. Fdez-Riverola, and J. F. De Paz Santana, Eds., Berlin: Springer, 2014, vol. 294, pp. 105-112.
    [Bibtex]
    @InCollection{Requeno2014,
    Title = {{T}imed and probabilistic model checking over phylogenetic trees},
    Author = {{R}equeno, {J}os\'{e} {I}gnacio and {C}olom, {J}os\'{e} {M}anuel},
    Booktitle = {Proceedings 8th International Conference on Practical Applications of Computational Biology and Bioinformatics},
    Publisher = {Springer},
    Year = {2014},
    Address = {Berlin},
    Editor = {Saez-Rodriguez, Julio and Rocha, Miguel P. and Fdez-Riverola, Florentino and De Paz Santana, Juan F.},
    Pages = {105--112},
    Series = {Advances in Intelligent and Soft Computing},
    Volume = {294},
    Owner = {nrequeno},
    Timestamp = {2014.01.19}
    }
  • J. I. Requeno, “Formal methods applied to the analysis of phylogenies: phylogenetic model checking,” PhD Thesis, 2014.
    [Bibtex]
    @PhdThesis{Requeno2014b,
    Title = {{F}ormal methods applied to the analysis of phylogenies: phylogenetic model checking},
    Author = {Jos{\'e} Ignacio Requeno},
    School = {School of Engineering and Architecture, University of Zaragoza},
    Year = {2014},
    Owner = {Ignacio},
    Timestamp = {2014.07.08}
    }
  • [DOI] R. J. Rodríguez, J. A. Artal, and J. Merseguer, “Performance Evaluation of Dynamic Binary Instrumentation Frameworks,” IEEE Latin America Transactions (Revista IEEE America Latina), vol. 12, iss. 8, pp. 1572-1580, 2014.
    [Bibtex]
    @Article{Rodriguez2014,
    Title = {{Performance Evaluation of Dynamic Binary Instrumentation Frameworks}},
    Author = {Ricardo J. Rodr\'{i}guez and Juan Antonio Artal and José Merseguer},
    Journal = {IEEE Latin America Transactions (Revista IEEE America Latina)},
    Year = {2014},
    Month = {December},
    Number = {8},
    Pages = {1572--1580},
    Volume = {12},
    Abstract = {Code analysis, static or dynamic, is a primary mean for improving correctness and performance of software applications. Dynamic binary analysis (DBA) refers the methods to analyse runtime behaviour of binary code. Nowadays, DBA tools are implemented using dynamic binary instrumentation (DBI) frameworks, which can add arbitrary code into the execution flow of the binary. Unfortunately, a DBA tool increases the execution time of the analysed binary dramatically, as extra code is being executed. Experiments got figures with increments of 26x. Therefore, it is crucial for DBA tool construction to know exact figures about such penalties and their roots. Hence, we conduct a performance evaluation of leading DBI frameworks, namely Pin, Valgrind, and DynamoRIO, for which we have built a benchmark selecting a bunch of representative tools. The evaluation that we procure here provides guidance to choose the best DBI framework suited for different needs. Moreover, the benchmark by itself is a tool ready to be eventually used for performance evaluation of future DBI frameworks.},
    Doi = {10.1109/TLA.2014.7014530},
    ISSN = {1548-0992},
    Keywords = {Benchmark testing;Hardware;Instruments;Kernel;Performance evaluation;Silicon compounds;Benchmark;Performance evaluation;Software Tools;Testing},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RAM-LATAM-14.pdf}
    }
  • [DOI] R. J. Rodríguez, L. A, Á. Herranz, and J. Mariño, “Execution and Verification of UML State Machines with Erlang (Tool Paper),” in Proceedings of the 12th International Conference on Software Engineering and Formal Methods (SEFM), 2014, pp. 284-289.
    [Bibtex]
    @InProceedings{Rodriguez2014a,
    Title = {{Execution and Verification of UML State Machines with Erlang (Tool Paper)}},
    Author = {Ricardo J. Rodr\'{i}guez and Lars-\r{A}ke Fredlund and \'{A}ngel Herranz and Julio Mari\~{n}o},
    Booktitle = {Proceedings of the 12th International Conference on Software Engineering and Formal Methods (SEFM)},
    Year = {2014},
    Editor = {Giannakopoulou, Dimitra and Sala{\"u}n, Gwen},
    Pages = {284--289},
    Publisher = {Springer},
    Series = {Lecture Notes in Computer Science},
    Volume = {8702},
    Abstract = {Validation of a system design enables to discover specification errors before it is implemented (or tested), thus hopefully reducing the development cost and time. The Unified Modelling Language (UML) is becoming widely accepted for the early specification and analysis of requirements for safety-critical systems, although a better balance between UML’s undisputed flexibility, and a precise unambiguous semantics, is needed. In this paper we introduce UMerL, a tool that is capable of executing and formally verifying UML diagrams (namely, UML state machine, class and object diagrams) by means of a translation of its behavioural information into Erlang. The use of the tool is illustrated with an example in embedded software design.},
    Doi = {10.1007/978-3-319-10431-7_22},
    ISBN = {978-3-319-10430-0},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RFHM-SEFM-14.pdf}
    }
  • [DOI] R. J. Rodríguez and E. Gómez-Martínez, “Model-based Safety Assessment using OCL and Petri Nets,” in Proceedings of the 40th EUROMICRO Conference on Software Engineering and Advanced Applications (SEAA), 2014, pp. 56-59.
    [Bibtex]
    @InProceedings{Rodriguez2014b,
    Title = {{Model-based Safety Assessment using OCL and Petri Nets}},
    Author = {Rodr\'{i}guez, Ricardo J. and G\'{o}mez-Mart\'{i}nez, Elena},
    Booktitle = {Proceedings of the 40th EUROMICRO Conference on Software Engineering and Advanced Applications (SEAA)},
    Year = {2014},
    Month = {Aug},
    Pages = {56 -- 59},
    Abstract = {Safety becomes a primordial assessment in safety-related systems where human lives can be somehow put in risk, needing to comply with safety requirements defined by industry standards such as IEC 61508, ISO 26262 or DO-178C. Safety contracts are useful to specify these requirements (as assumptions and guarantees), thus assuring an expected level of confidence. To verify the safety requirements is measured to represent more than a half of the overall system development costs. In this paper, we propose a model-based verification that addresses safety verification from the early beginning of system development, thus saving costs. Namely, we use UML for system design and Object Constraint Language (OCL) for specifying safety contracts, while its verification is carried out using Petri nets. As case study, we assess the safety of an embedded system that models a fire prevention system in a hospital building.},
    Doi = {10.1109/SEAA.2014.36},
    Keywords = {Computational modeling;Contracts;Petri nets;Safety;Software;Unified modeling language;OCL;Petri nets;UML;model-based;safety assessment},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RG-SEAA-14.pdf}
    }
  • [DOI] R. J. Rodríguez and S. Punnekkat, “Cost Optimisation in Certification of Software Product Lines,” in Proceedings of the 2014 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW), 2014, pp. 509-514.
    [Bibtex]
    @InProceedings{Rodriguez2014c,
    Title = {{Cost Optimisation in Certification of Software Product Lines}},
    Author = {Ricardo J. Rodr\'{i}guez and Sasikumar Punnekkat},
    Booktitle = {Proceedings of the 2014 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)},
    Year = {2014},
    Month = {November},
    Pages = {509--514},
    Publisher = {IEEE},
    Abstract = {Safety-critical systems (such as those in automotive, avionics, railway domains), where a failure can result in accidents with fatal consequences, need to certify their products as per domain-specific safety standards. Safety certification is not only time consuming but also consumes the project budget. Adopting a reuse oriented development and certification paradigm can be highly beneficial in such systems. Though there had been several research efforts on cost models in the context of software reuse as well as software product lines, none of them have addressed the certification related costs. In this paper, we present a cost model for software product lines, which incorporates certification costs as well. We first propose a mathematical model to represent a Software Product Line and then present an approach to compute, using optimisation theory, the set of artifacts that compose a new product assuring an expected level of confidence (that is, a certain Safety Integrity Level) at an optimised cost level. The proposed approach can help developers and software project managers in making efficient design decisions in relation to the choice of the components for a new product variant development as part of a product line.},
    Doi = {10.1109/ISSREW.2014.103},
    Keywords = {Computational modeling;Linear programming;Mathematical model;Optimization;Safety;Software;Standards;certification costs;cost model;integer programming;safety certification;software product lines},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RP-ISSREW-14.pdf}
    }
  • M. V. -, S. Baldassarri, M. Lozano, R. Trillo-Lado, A. C. Murillo, and P. Garrido, “Girls’ Day experience at the University of Zaragoza: attracting women to technology,” in Interacción, 2014, p. 79:1–79:8.
    [Bibtex]
    @InProceedings{Villarroya-Gaudo2014,
    Title = {Girls' Day experience at the University of Zaragoza: attracting women
    to technology},
    Author = {Mar{\'{\i}}a Villarroya{-}Gaud{\'{o}} and
    Sandra Baldassarri and
    Mayte Lozano and
    Raquel Trillo-Lado and
    Ana C. Murillo and
    Piedad Garrido},
    Booktitle = {Interacci{\'{o}}n},
    Year = {2014},
    Pages = {79:1--79:8},
    Publisher = {{ACM}},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] M. C. Woodside, D. C. Petriu, J. Merseguer, D. B. Petriu, and M. Alhaj, “Transformation challenges: from software models to performance models,” Software and System Modeling, vol. 13, iss. 4, pp. 1529-1552, 2014.
    [Bibtex]
    @Article{Woodside2014,
    Title = {Transformation challenges: from software models to performance models},
    Author = {C. Murray Woodside and Dorina C. Petriu and Jos{\'{e}} Merseguer and Dorin Bogdan Petriu and Mohammad Alhaj},
    Journal = {Software and System Modeling},
    Year = {2014},
    Number = {4},
    Pages = {1529--1552},
    Volume = {13},
    Doi = {10.1007/s10270-013-0385-x},
    Url = {http://dx.doi.org/10.1007/s10270-013-0385-x}
    }
  • ACM/SPEC International Conference on Performance Engineering, ICPE’14, Dublin, Ireland, March 22-26, 2014ACM, 2014.
    [Bibtex]
    @Proceedings{Lange2014,
    Title = {{ACM/SPEC} International Conference on Performance Engineering, ICPE'14, Dublin, Ireland, March 22-26, 2014},
    Year = {2014},
    Editor = {Klaus{-}Dieter Lange and John Murphy and Walter Binder and Jos{\'{e}} Merseguer},
    Publisher = {ACM},
    ISBN = {978-1-4503-2733-6},
    Url = {http://dl.acm.org/citation.cfm?id=2568088}
    }
  • [DOI] Formal Methods in Manufacturing, J. Campos, C. Seatzu, and X. Xie, Eds., CRC Press, 2014. [Publisher URL]
    [Bibtex]
    @Book{CSX-FMM-Book-2014,
    Title = {Formal Methods in Manufacturing},
    Editor = {J. Campos and C. Seatzu and X. Xie},
    Publisher = {CRC Press},
    Year = {2014},
    Abstract = {Design and operation of manufacturing systems and their supply chains is a domain of significant
    research worldwide. The complexity of this domain stems from the large dimension of such systems
    that are highly parallel and distributed, from significant sources of uncertainties and from the degrees
    of flexibility. Formal methods are mathematical techniques, often supported by tools, for developing
    man-made systems. Formal methods and mathematical rigor enable manufacturing engineers to
    handle fundamental design principles, such as abstraction or modular and hierarchical development,
    and to deal with typical engineering problems and quality goals, like reliability, flexibility, and
    maintainability. Formal methods can provide both a deep understanding of the system, thus helping
    to cover holes in the specification, and an improved system reliability, through verification and
    validation of the desired properties. Automata, statecharts, queueing networks, Petri nets, min-max
    algebras, process algebras, and temporal logic-based models are becoming more and more used for
    an integrated view of design specification, validation, performance evaluation, planning, scheduling
    and control of manufacturing systems and their supply chains.
    This book presents some of the most significant works representing the state of the art in the
    area of formal methodologies for manufacturing systems, combining fundamentals and advanced
    issues. It is divided into four main parts, each devoted to a specific issue: modelling and simulation,
    supervisory control (including deadlock prevention), performance evaluation (including scheduling
    and optimization), and fault diagnosis and reconfiguration. Several formalisms are considered,
    including finite state automata, Petri nets (discrete, timed, continuous, and hybrid), process algebra
    and max-plus algebra, exemplifying the advantages of each of them in the solution of a specific
    problem.Within each part, more detailed problems are considered, and themost significant solutions
    are discussed and illustratedwith a series of interesting and significant examples in themanufacturing
    area. Individual chapters are written by leading experts in the field. Each topic is illustrated in detail,
    its significance in manufacturing systems is underlined, and the most important contributions
    in that specific area are surveyed.
    The book is intended for researchers, postgraduate students and engineers interested in problems
    occurring in manufacturing systems. In particular, it provides a comprehensive overview of the most
    important formal model-based solutions to a series of major problems in manufacturing systems and
    their supply chains, which are based on formal and rigorous modelling of the underlying system.
    Each chapter in the book aims at providing a balance mixture of (1) fundamental theory, giving
    the reader a clear introduction to the most important formalisms used for the modelling, analysis
    and control of manufacturing systems; (2) tutorial value, providing the state of the art on a series
    of problems that occur in manufacturing systems, such as deadlock prevention, supervisory control,
    performance evaluation and fault diagnosis; and (3) applicability, presenting a series of case studies
    and applications taken from the industrial world, that make it particularly appealing to practitioners.
    A brief description of the book is as follows. Part I (Chapters 1 through 5) concerns modelling
    and simulation of manufacturing systems. Chapter 1 focuses on Petri nets (untimed and timed) and
    shows how these can be effectively used to represent manufacturing systems in a bottom-up and
    modular fashion. Chapter 2 deals with a particular class of manufacturing systems for which a
    linear representation in an algebraic structure called dioids can be given. Chapters 3 and 4 deal
    with hybrid models of manufacturing systems. In particular, Chapter 3 focuses on hybrid Petri nets
    (HPNs), a formalism that combines fluid and discrete event dynamics. Particular attention is devoted
    to first-order hybrid Petri nets (FOHPNs) whose continuous dynamics are piecewise constant. It is
    shown how FOHPNs can be effectively used to model both manufacturing systems and inventory
    control systems. Chapter 4 focuses on stochastic flow models (SFMs) that preserve the essential
    features needed to design effective controllers and potentially optimize performance without any need
    to estimate the corresponding optimal performance value with accuracy. An overview of recently
    developed general frameworks for infinitesimal perturbation analysis (IPA) is also presented, through
    which unbiased performance sensitivity estimates of typical manufacturing performance measures
    can be obtained in such SFMs with respect to various controllable parameters of interest. Finally,
    Chapter 5 deals with a problem occurring in many real manufacturing systems, namely, freight
    transportation. It reviews the established transportation system modelling, including theory and
    applications of transportation supply models, trip demand models and dynamic traffic assignment
    methods, both for passenger and freight transportation, and also points out the characteristics of
    freight transportation that influence the logistic chain performance.
    Part II (Chapters 6 through 12) is devoted to the supervisory control of manufacturing systems.
    In particular, Chapters 6 through 8 introduce deadlock avoidance/prevention policies; Chapters 9
    through 12 deal with supervisory control problems. Chapter 6 addresses the problem of deadlock
    avoidance in flexibly automated manufacturing systems through the modelling abstraction of the
    (sequential) resource allocation system (RAS). The pursued analysis uses concepts and results from
    the formalmodelling framework of finite state automata (FSA). Chapter 7 investigates the problem of
    deadlock prevention in the Petri net framework. After an overview of the classical approaches based
    on the addition of monitors that prevent siphons to become empty, a novel methodology is presented.
    Chapter 8 also deals with Petri nets. Here the digraph theory is used to effectively derive control
    laws that avoid deadlocks in single unit RAS, that is, systems where each part requires a single unit
    of a single resource for each operation. In Chapter 9, Petri nets are used to solve supervisory control
    problems of manufacturing systems. Different problem statements, depending on the considered
    specifications, and different solutions are considered, in particular based on the theory of monitor
    places and on the theory of regions. Extended finite automata (EFA), that is, automata augmented
    with bounded discrete variables, and updates of these variables on the transitions, are introduced
    in Chapter 10 and effectively used to automatically synthesize a supervisor. Decentralized control
    and modular control problems are discussed in Chapter 11. Finally, Chapter 12 discusses how
    manufacturing systems can often be modeled as max-plus-linear (MPL) systems and controlled via
    model predictive control (MPC).
    Part III (Chapters 13 through 20) addresses the issue of performance evaluation of manufacturing
    systems and supply chains. Chapter 13 discusses approaches based on coloured Petri nets and
    state space analysis. Performance evaluation and control of manufacturing systems using fluid (i.e.,
    continuous) Petri nets are discussed in Chapter 14. Chapter 15, discusses how timed process algebra
    called bounded true concurrency (BTC) can be effectively used for performance evaluation of flexible
    manufacturing systems. The problem of designing the lean, that is, the smallest buffers necessary and
    sufficient to achieve the desired line performance, is addressed in Chapter 16. Chapter 17 deals with
    the issue of inventory allocation and cycle time improvement in manufacturing systems and supply
    chains. Chapter 18 covers timed weighted event graphs, a subclass of Petri nets whose transitions
    are associated with workshops or specific treatments and whose places represent storages between
    the transitions. It deals with the minimization of the overall capacities of places, under throughput constraints.
    Chapter 19 focuses on the application of Petri nets to the scheduling of semiconductor manufacturing systems.
    To this aim, a hierarchical coloured timed Petri net (HCTPN) is proposed and genetic algorithms
    are extended and then embedded into the constructed HCTPN to find optimal/suboptimal schedules.
    Finally, Chapter 20 focuses on organization problems of health-care systems, presenting a Petri
    net-based software for health-care service modelling and simulation called MedPRO. Resource
    planning and scheduling are also in the scope of the tool.
    Finally, Part IV (Chapters 21 through 23) illustrates fault diagnosis approaches for discrete event
    systems that can be successfully applied to manufacturing systems. In particular, in Chapters 21 and
    22 finite state automata and interpreted Petri nets, respectively, are used as reference formalisms.
    In both chapters, diagnosability analysis is also performed. Chapter 21 also discusses the problem
    of sensor selection for diagnosability and the problem of cooperative diagnosis for systems with
    decentralized information. Chapter 23 addresses a problem strictly related to fault diagnosis occurring
    in automated manufacturing systems, namely, that of online control reconfiguration.},
    Doi = {10.1201/b16529},
    Url = {http://www.crcpress.com/product/isbn/9781466561557}
    }

2013

  • [DOI] S. Hernández, J. Fabra, P. Álvarez, and J. Ezpeleta, “A Reliable and Scalable Service Bus Based on Amazon SQS,” in Service-Oriented and Cloud Computing – Second European Conference, ESOCC 2013, Málaga, Spain, September 11-13, 2013. Proceedings, 2013, pp. 196-211.
    [Bibtex]
    @InProceedings{Hernandez2013a,
    Title = {A Reliable and Scalable Service Bus Based on Amazon {SQS}},
    Author = {Sergio Hern{\'{a}}ndez and Javier Fabra and Pedro {\'{A}}lvarez and Joaqu{\'{\i}}n Ezpeleta},
    Booktitle = {Service-Oriented and Cloud Computing - Second European Conference, {ESOCC} 2013, M{\'{a}}laga, Spain, September 11-13, 2013. Proceedings},
    Year = {2013},
    Pages = {196--211},
    Crossref = {DBLP:conf/esocc/2013},
    Doi = {10.1007/978-3-642-40651-5_17},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1007/978-3-642-40651-5_17}
    }
  • [DOI] S. Hernández, J. Fabra, P. Álvarez, and J. Ezpeleta, “Cost Evaluation of Migrating a Computation Intensive Problem from Clusters to Cloud,” in Economics of Grids, Clouds, Systems, and Services – 10th International Conference, GECON 2013, Zaragoza, Spain, September 18-20, 2013. Proceedings, 2013, pp. 90-105.
    [Bibtex]
    @InProceedings{Hernandez2013,
    Title = {Cost Evaluation of Migrating a Computation Intensive Problem from Clusters to Cloud},
    Author = {Sergio Hern{\'{a}}ndez and Javier Fabra and Pedro {\'{A}}lvarez and Joaqu{\'{\i}}n Ezpeleta},
    Booktitle = {Economics of Grids, Clouds, Systems, and Services - 10th International Conference, {GECON} 2013, Zaragoza, Spain, September 18-20, 2013. Proceedings},
    Year = {2013},
    Pages = {90--105},
    Crossref = {DBLP:conf/gecon/2013},
    Doi = {10.1007/978-3-319-02414-1_7},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1007/978-3-319-02414-1_7}
    }
  • S. Bergamaschi, F. Guerra, M. Interlandi, S. Rota, R. Trillo-Lado, and Y. Velegrakis, “Using a HMM based approach for mapping keyword queries into database terms,” in SEBD, 2013, pp. 239-246.
    [Bibtex]
    @InProceedings{Bergamaschi2013a,
    Title = {Using a {HMM} based approach for mapping keyword queries into database
    terms},
    Author = {Sonia Bergamaschi and
    Francesco Guerra and
    Matteo Interlandi and
    Silvia Rota and
    Raquel Trillo-Lado and
    Yannis Velegrakis},
    Booktitle = {{SEBD}},
    Year = {2013},
    Pages = {239--246},
    Publisher = {Curran Associates},
    __markedentry = {[jcampos:6]}
    }
  • S. Bergamaschi, F. Guerra, M. Interlandi, R. Trillo-Lado, and Y. Velegrakis, “QUEST: A Keyword Search System for Relational Data based on Semantic and Machine Learning Techniques,” PVLDB, vol. 6, iss. 12, pp. 1222-1225, 2013.
    [Bibtex]
    @Article{Bergamaschi2013,
    Title = {{QUEST:} {A} Keyword Search System for Relational Data based on Semantic
    and Machine Learning Techniques},
    Author = {Sonia Bergamaschi and
    Francesco Guerra and
    Matteo Interlandi and
    Raquel Trillo-Lado and
    Yannis Velegrakis},
    Journal = {{PVLDB}},
    Year = {2013},
    Number = {12},
    Pages = {1222--1225},
    Volume = {6},
    __markedentry = {[jcampos:6]}
    }
  • S. Bernardi and J. Campos, “A min-max problem for the computation of the cycle time lower bound in interval-based Time Petri Nets,” in Actas de las XXI Jornadas de Concurrencia y Sistemas Distribuidos, San Sebastián, Spain, 2013.
    [Bibtex]
    @InProceedings{BC-JCSD13,
    Title = {A min-max problem for the computation of the cycle time lower bound in interval-based {Time} {Petri} {Nets}},
    Author = {S. Bernardi and J. Campos},
    Booktitle = {Actas de las {XXI} Jornadas de Concurrencia y Sistemas Distribuidos},
    Year = {2013},
    Address = {San Sebasti{\'a}n, Spain},
    Month = {June},
    Note = {See the paper \cite{BC-TSMC-13}},
    Publisher = {Universidad del Pa\'{\i}s Vasco},
    Abstract = {The Time Petri Net with firing frequency intervals (TPNF) is a modeling formalism used
    to specify system behavior under timing and frequency constraints.
    Efficient techniques exist to evaluate the performance of TPNF models based on the
    computation of bounds of performance metrics (e.g., transition throughput, place marking).
    In this paper, we propose a min-max problem to compute the cycle time of a transition
    under optimistic assumptions. That is, we are interested in computing the lower bound.
    We will demonstrate that such a problem is related to a maximization linear programming
    problem (LP-max) previously stated in the literature,
    to compute the throughput upper bound of the transition.
    The main advantage of the min-max problem compared to the LP-max is that, besides the
    optimal value, the optimal solutions provide useful feedback to the analyst
    on the system behavior (e.g., performance bottlenecks).
    We have implemented two solution algorithms, using CPLEX APIs,
    to solve the min-max problem, and have
    compared their performance using a benchmark of TPNF models,
    several of these being case studies.
    Finally, we have applied the min-max technique for the vulnerability
    analysis of a critical infrastructure, i.e., the Saudi Arabian crude-oil distribution network.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/bc-jcsd13.pdf}
    }
  • [DOI] S. Bernardi and J. Campos, “A min-max problem for the computation of the cycle time lower bound in interval-based Time Petri Nets,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 43, iss. 5, pp. 1167-1181, 2013.
    [Bibtex]
    @Article{BC-TSMC-13,
    Title = {A min-max problem for the computation of the cycle time lower bound in interval-based {Time} {Petri} {Nets}},
    Author = {S. Bernardi and J. Campos},
    Journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
    Year = {2013},
    Month = {September},
    Number = {5},
    Pages = {1167-1181},
    Volume = {43},
    Abstract = {The Time Petri Net with firing frequency intervals (TPNF) is a modeling formalism used
    to specify system behavior under timing and frequency constraints.
    Efficient techniques exist to evaluate the performance of TPNF models based on the
    computation of bounds of performance metrics (e.g., transition throughput, place marking).
    In this paper, we propose a min-max problem to compute the cycle time of a transition
    under optimistic assumptions. That is, we are interested in computing the lower bound.
    We will demonstrate that such a problem is related to a maximization linear programming
    problem (LP-max) previously stated in the literature,
    to compute the throughput upper bound of the transition.
    The main advantage of the min-max problem compared to the LP-max is that, besides the
    optimal value, the optimal solutions provide useful feedback to the analyst
    on the system behavior (e.g., performance bottlenecks).
    We have implemented two solution algorithms, using CPLEX APIs,
    to solve the min-max problem, and have
    compared their performance using a benchmark of TPNF models,
    several of these being case studies.
    Finally, we have applied the min-max technique for the vulnerability
    analysis of a critical infrastructure, i.e., the Saudi Arabian crude-oil distribution network.},
    Doi = {10.1109/TSMCA.2012.2226442},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/bc-tsmc-13.pdf}
    }
  • S. Bernardi, L. Dranca, and J. Merseguer, “Un enfoque guiado por el modelado para la obtención y análisis de requisitos de supervivencia de C2IS,” in Actas del Congreso Nacional de I+D en Defensa y Seguridad (DESEi+d), 6-7 Noviembre, Madrid, 2013, pp. 575-582.
    [Bibtex]
    @InProceedings{Bernardi2013d,
    Title = {Un enfoque guiado por el modelado para la obtenci\'on y an\'alisis de requisitos de supervivencia de {C2IS}},
    Author = {Simona Bernardi and Lacramioara Dranca and José Merseguer},
    Booktitle = {{Actas del Congreso Nacional de I+D en Defensa y Seguridad (DESEi+d), 6-7 Noviembre, Madrid}},
    Year = {2013},
    Pages = {575--582},
    ISBN = {978-84-7402-399-2}
    }
  • [DOI] S. Bernardi, F. Flammini, S. Marrone, N. Mazzocca, J. Merseguer, R. Nardone, and V. Vittorini, “Enabling the usage of UML in the verification of railway systems: The DAM-rail approach,” Rel. Eng. & Sys. Safety, vol. 120, pp. 112-126, 2013.
    [Bibtex]
    @Article{Bernardi2013a,
    Title = {Enabling the usage of {UML} in the verification of railway systems: The DAM-rail approach},
    Author = {Simona Bernardi and Francesco Flammini and Stefano Marrone and Nicola Mazzocca and Jos{\'{e}} Merseguer and Roberto Nardone and Valeria Vittorini},
    Journal = {Rel. Eng. {\&} Sys. Safety},
    Year = {2013},
    Pages = {112--126},
    Volume = {120},
    Doi = {10.1016/j.ress.2013.06.032}
    }
  • [DOI] S. Bernardi and J. Merseguer, “A Meta-Model Based Approach to the Definition of the Analysis Results of Petri Net Models” in Theory and Application of Multi-Formalism Modeling, M. Gribaudo and M. Iacono, Eds., IGI Global, 2013.
    [Bibtex]
    @InBook{Bernardi2013b,
    Title = {A Meta-Model Based Approach to the Definition of the Analysis Results of Petri Net Models},
    Author = {Simona Bernardi and Jos{\'e} Merseguer},
    Editor = {Marco Gribaudo and Mauro Iacono},
    Publisher = {IGI Global},
    Year = {2013},
    Series = {Advances in Systems Analysis, Software Engineering, and High Performance Computing (ASASEHPC)},
    Booktitle = {Theory and Application of Multi-Formalism Modeling},
    Doi = {10.4018/978-1-4666-4659-9.ch006},
    ISBN = {978-1-4666-4659-9},
    Organization = {IGI Global}
    }
  • [DOI] S. Bernardi, J. Merseguer, and D. C. Petriu, Model-Driven Dependability Assessment of Software Systems, Springer Berlin Heidelberg, 2013. []
    [Bibtex]
    @Book{Bernardi2013,
    Title = {Model-Driven Dependability Assessment of Software Systems},
    Author = {Simona Bernardi and Jos{\'{e}} Merseguer and Dorina C. Petriu},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2013},
    Doi = {10.1007/978-3-642-39512-3},
    ISBN = {978-3-642-39511-6}
    }
  • J. Fabra, S. Hernández, E. Otero-García, J. C. Vidal, M. Lama, and P. Álvarez, “A practical experience concerning the parallel semantic annotation of a large-scale data collection,” in The 9th International Conference on Semantics Systems, 2013, pp. 65-72.
    [Bibtex]
    @InProceedings{Fabra2013,
    Title = {A practical experience concerning the parallel semantic annotation of a large-scale data collection},
    Author = {Fabra, Javier and Hern\'andez, Sergio and Otero-Garc\'{\i}a, Estefan\'{\i}a and Vidal, Juan Carlos and Lama, Manuel and \'Alvarez, Pedro},
    Booktitle = {The 9th International Conference on Semantics Systems},
    Year = {2013},
    Pages = {65--72},
    Series = {I-SEMANTICS '13},
    __markedentry = {[jcampos:]},
    Numpages = {8},
    Owner = {shernandez},
    Timestamp = {2015.09.29}
    }
  • [DOI] S. Hernández, J. Fabra, P. Álvarez, and J. Ezpeleta, “A Reliable and Scalable Service Bus Based on Amazon SQS” in Service-Oriented and Cloud Computing: Second European Conference, ESOCC 2013, Málaga, Spain, September 11-13, 2013. Proceedings, K. Lau, W. Lamersdorf, and E. Pimentel, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 196-211.
    [Bibtex]
    @InBook{Hernandez2013b,
    Title = {A Reliable and Scalable Service Bus Based on Amazon SQS},
    Author = {Hern{\'a}ndez, Sergio and Fabra, Javier and {\'A}lvarez, Pedro and Ezpeleta, Joaqu{\'i}n},
    Editor = {Lau, Kung-Kiu and Lamersdorf, Winfried and Pimentel, Ernesto},
    Pages = {196--211},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2013},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {Service-Oriented and Cloud Computing: Second European Conference, ESOCC 2013, M{\'a}laga, Spain, September 11-13, 2013. Proceedings},
    Doi = {10.1007/978-3-642-40651-5_17},
    ISBN = {978-3-642-40651-5},
    Url = {http://dx.doi.org/10.1007/978-3-642-40651-5_17}
    }
  • [DOI] S. Hernández, J. Fabra, P. Álvarez, and J. Ezpeleta, “Cost Evaluation of Migrating a Computation Intensive Problem from Clusters to Cloud” in Economics of Grids, Clouds, Systems, and Services: 10th International Conference, GECON 2013, Zaragoza, Spain, September 18-20, 2013. Proceedings, J. Altmann, K. Vanmechelen, and O. F. Rana, Eds., Cham: Springer International Publishing, 2013, pp. 90-105.
    [Bibtex]
    @InBook{Hernandez2013c,
    Title = {Cost Evaluation of Migrating a Computation Intensive Problem from Clusters to Cloud},
    Author = {Hern{\'a}ndez, Sergio and Fabra, Javier and {\'A}lvarez, Pedro and Ezpeleta, Joaqu{\'i}n},
    Editor = {Altmann, J{\"o}rn and Vanmechelen, Kurt and Rana, Omer F.},
    Pages = {90--105},
    Publisher = {Springer International Publishing},
    Year = {2013},
    Address = {Cham},
    __markedentry = {[jcampos:]},
    Booktitle = {Economics of Grids, Clouds, Systems, and Services: 10th International Conference, GECON 2013, Zaragoza, Spain, September 18-20, 2013. Proceedings},
    Doi = {10.1007/978-3-319-02414-1_7},
    ISBN = {978-3-319-02414-1},
    Url = {http://dx.doi.org/10.1007/978-3-319-02414-1_7}
    }
  • S. Hernández, J. Fabra, P. Álvarez, and J. Ezpeleta, “Using Cloud-based Resources to Improve Availability and Reliability in a Scientific Workflow Execution Framework,” in the Fourth International Conference on Cloud Computing, GRIDs, and Virtualization, Valencia, Spain, 2013, pp. 230-237.
    [Bibtex]
    @InProceedings{Hernandez2013d,
    Title = {Using Cloud-based Resources to Improve Availability and Reliability in a Scientific Workflow Execution Framework},
    Author = {Hern\'andez, Sergio and Fabra, Javier and \'Alvarez, Pedro and Ezpeleta, Joaq\'in},
    Booktitle = {the Fourth International Conference on Cloud Computing, GRIDs, and Virtualization},
    Year = {2013},
    Address = {Valencia, Spain},
    Month = {27 May - 1 June},
    Pages = {230--237},
    Publisher = {IARIA, Red Hook, NY, USA},
    __markedentry = {[jcampos:]},
    Numpages = {8},
    Owner = {shernandez},
    Timestamp = {2013.10.17}
    }
  • S. Hernández, E. Otero-García, J. Fabra, J. C. Vidal, M. Lama, and P. Álvarez, “Una experiencia real de anotación semántica a gran escala utilizando recursos de computación heterogéneos,” in IX Jornadas de Ciencia e Ingeniería de Servicios (JCIS’13), 2013, pp. 163-177.
    [Bibtex]
    @InProceedings{Hernandez2013e,
    Title = {Una experiencia real de anotaci\'on sem\'antica a gran escala utilizando recursos de computaci\'on heterog\'eneos},
    Author = {Hern\'andez, Sergio and Otero-Garc\'ia, Estefan\'ia and Fabra, Javier and Vidal, Juan Carlos and Lama, Manuel and \'Alvarez, Pedro},
    Booktitle = {IX Jornadas de Ciencia e Ingenier\'ia de Servicios (JCIS'13)},
    Year = {2013},
    Pages = {163--177},
    __markedentry = {[jcampos:]},
    Owner = {shernandez},
    Timestamp = {2015.09.29}
    }
  • [DOI] S. Pérez, J. Campos, H. Facchini, and L. Bisaro, “Tuning Mechanism for IEEE 802.11e EDCA Optimization,” IEEE Latin America Transactions, vol. 11, iss. 4, pp. 1134-1142, 2013.
    [Bibtex]
    @Article{PCFB-LAT-13,
    Title = {Tuning Mechanism for {IEEE 802.11e EDCA} Optimization},
    Author = {S. P{\'e}rez and J. Campos and H. Facchini and L. Bisaro},
    Journal = {IEEE Latin America Transactions},
    Year = {2013},
    Month = {June},
    Number = {4},
    Pages = {1134-1142},
    Volume = {11},
    Abstract = {The overall performance of a WLAN 802.11e is
    determined, among other things, by the Enhanced Distributed
    Channel Access (EDCA) parameters, typically configured with
    default and static values. The same does not vary according to
    the dynamic requirements of Quality of Service (QoS) of the
    network. To achieve significant improvements in the
    performance of the network, and simultaneously comply with the
    specifications of QoS, a new algorithm of tuning is proposed to
    make the adjustment of these parameters dynamically, which we
    call Algorithm for the Differentiation of Traffic Multiple
    (MTDA). The algorithm has been evaluated in realistic scenarios
    with noise, reaching a initialization effective, rapid convergence,
    and the differentiation of effective multiple wireless traffic (voice,
    video and best effort with Pareto distribution). It adopted a
    model of wireless station implemented in Hierarchical Stochastic
    Activities Networks (HSANs), which runs on the simulator
    M{\"o}bius.},
    Doi = {10.1109/TLA.2013.6601760},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pcfb-lat-13.pdf}
    }
  • [DOI] S. Pérez, H. Facchini, G. Mercado, L. Bisaro, and J. Campos, “EDCA 802.11e performance under different scenarios. Quantitative analysis,” in Proceedings of the 27th International Conference on Advanced Information Networking and Applications (AINA’13), Barcelona, Spain, 2013, pp. 802-807.
    [Bibtex]
    @InProceedings{PFMBC-AINA-13,
    Title = {{EDCA} 802.11e performance under different scenarios. Quantitative analysis},
    Author = {S. P{\'e}rez and H. Facchini and G. Mercado and L. Bisaro and J. Campos},
    Booktitle = {Proceedings of the 27th International Conference on Advanced Information Networking and Applications {(AINA'13)}},
    Year = {2013},
    Address = {Barcelona, Spain},
    Month = {March},
    Pages = {802-807},
    Publisher = {IEEE Computer Society},
    Abstract = {The global throughput of an 802.11e WLAN is determined by EDCA (Enhanced Distributed Channel Access) parameters, among other aspects, that are usually configured with predetermined and static values. This study carefully evaluates the Quality of Service (QoS) of Wi-Fi with EDCA in several realistic scenarios with noise and a blend of wireless traffic (e.g., voice, video, and best effort, with Pareto distribution). The metrics of the benefits obtained in each case are compared, and the differentiated impact of network dynamics on each case is quantified. This study proposes a new experimental scenario based on the relative proportion of traffic present in the network. Stations have been implemented using HSANs (Hierarchical Stochastic Activity Networks) and simulated using the M\"obius tool.},
    Doi = {10.1109/AINA.2013.20},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pfmbc-aina-13.pdf}
    }
  • S. Pérez, H. Facchini, G. Mercado, L. Bisaro, and J. Campos, “Throughput Quantitative Analysis of EDCA 802.11e in Different Scenarios,” Journal of Computer Science & Technology, vol. 13, iss. 1, pp. 16-23, 2013.
    [Bibtex]
    @Article{PFMBC-JCST-13,
    Title = {Throughput Quantitative Analysis of {EDCA} 802.11e in Different Scenarios},
    Author = {S. P{\'e}rez and H. Facchini and G. Mercado and L. Bisaro and J. Campos},
    Journal = {Journal of Computer Science \& Technology},
    Year = {2013},
    Month = {April},
    Number = {1},
    Pages = {16-23},
    Volume = {13},
    Abstract = {This document presents a quantitative analysis of the direct and relative throughput of IEEE 802.11e.
    The global throughput of an 802.11e WLAN is determined by EDCA (Enhanced Distributed Channel Access)
    parameters, among other aspects, that are usually configured with predetermined and static values. This
    study carefully evaluates the Quality of Service (QoS) of Wi-Fi with EDCA in several realistic scenarios with noise
    and a blend of wireless traffic (e.g., voice, video, and best effort, with Pareto distribution). The metrics of the
    benefits obtained in each case are compared, and the differentiated impact of network dynamics on each case is
    quantified. The results obtained show that the default settings are not optimal, and that with an appropriate
    selection, can be achieved improvements of the order of 25%, according to the type of traffic. In addition, it could
    be shown the quantitative impact of each parameter EDCA on the overall performance. This study proposes a new
    experimental scenario based on the relative proportion of traffic present in the network. Stations have been
    simulated using the M{\"o}bius tool, which supports an extension of SPN (Stochastic Petri Networks), known as
    HSAN (Hierarchical Stochastic Activity Networks).},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pfmbc-jcst-13.pdf}
    }
  • [DOI] O. Pastor, E. Insfrán, V. Pelechano, J. Romero, and J. Merseguer, “00-METHOD: An 00 Software Production Environment Combining Conventional and Formal Methods” in Seminal Contributions to Information Systems Engineering, 25 Years of CAiSE, , 2013, pp. 139-152.
    [Bibtex]
    @InCollection{Pastor2013,
    Title = {00-METHOD: An 00 Software Production Environment Combining Conventional and Formal Methods},
    Author = {Oscar Pastor and Emilio Insfr{\'{a}}n and Vicente Pelechano and Jos{\'{e}} Romero and Jos{\'{e}} Merseguer},
    Booktitle = {Seminal Contributions to Information Systems Engineering, 25 Years of CAiSE},
    Year = {2013},
    Pages = {139--152},
    Doi = {10.1007/978-3-642-36926-1_11},
    Url = {https://doi.org/10.1007/978-3-642-36926-1_11}
    }
  • [DOI] D. P. -, R. Calinescu, and J. Merseguer, “log2cloud: log-based prediction of cost-performance trade-offs for cloud deployments,” in Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC ’13, Coimbra, Portugal, March 18-22, 2013, 2013, pp. 397-404.
    [Bibtex]
    @InProceedings{Perez-Palacin2013,
    Title = {log2cloud: log-based prediction of cost-performance trade-offs for cloud deployments},
    Author = {Diego Perez{-}Palacin and Radu Calinescu and Jos{\'{e}} Merseguer},
    Booktitle = {Proceedings of the 28th Annual {ACM} Symposium on Applied Computing, {SAC} '13, Coimbra, Portugal, March 18-22, 2013},
    Year = {2013},
    Pages = {397--404},
    Doi = {10.1145/2480362.2480442},
    Url = {http://doi.acm.org/10.1145/2480362.2480442}
    }
  • {. {. {R}equeno and {. {. {C}olom, “Model checking software for phylogenetic trees using distribution and database methods,” Journal of Integrative Bioinformatics, vol. 10, iss. 3, pp. 229-233, 2013.
    [Bibtex]
    @Article{Requeno2013a,
    Title = {{M}odel checking software for phylogenetic trees using distribution and database methods},
    Author = {{R}equeno, {J}os{\'e} {I}gnacio and {C}olom, {J}os{\'e} {M}anuel},
    Journal = {Journal of Integrative Bioinformatics},
    Year = {2013},
    Number = {3},
    Pages = {229--233},
    Volume = {10}
    }
  • {. {. {R}equeno and {. {. {C}olom, “Speeding up phylogenetic model checking” in Proceedings 7th International Conference on Practical Applications of Computational Biology and Bioinformatics, M. S. Mohamad, L. Nanni, M. P. Rocha, and F. Fdez-Riverola, Eds., Berlin: Springer, 2013, vol. 222, pp. 119-126.
    [Bibtex]
    @InCollection{Requeno2013,
    Title = {{S}peeding up phylogenetic model checking},
    Author = {{R}equeno, {J}os\'{e} {I}gnacio and {C}olom, {J}os\'{e} {M}anuel},
    Booktitle = {Proceedings 7th International Conference on Practical Applications of Computational Biology and Bioinformatics},
    Publisher = {Springer},
    Year = {2013},
    Address = {Berlin},
    Editor = {Mohamad, Mohd Saberi and Nanni, Loris and Rocha, Miguel P. and Fdez-Riverola, Florentino},
    Pages = {119--126},
    Series = {Advances in Intelligent Systems and Computing},
    Volume = {222},
    Organization = {Springer}
    }
  • {. {. {R}equeno, {. de {M}iguel {C}asado, {. {B}lanco, and {. {. {C}olom, “Temporal logics for phylogenetic analysis via model checking,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 10, iss. 4, pp. 1058-1070, 2013.
    [Bibtex]
    @Article{Requeno2013b,
    Title = {{T}emporal logics for phylogenetic analysis via model checking},
    Author = {{R}equeno, {J}os\'{e} {I}gnacio and de {M}iguel {C}asado, {G}regorio and {B}lanco, {R}oberto and {C}olom, {J}os\'{e} {M}anuel},
    Journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
    Year = {2013},
    Number = {4},
    Pages = {1058--1070},
    Volume = {10},
    Publisher = {IEEE Press}
    }
  • R. J. Rodríguez, “Performance Analysis and Resource Optimisation of Critical Systems Modelled by Petri Nets,” PhD Thesis, 2013.
    [Bibtex]
    @PhdThesis{Rodriguez2013c,
    Title = {{Performance Analysis and Resource Optimisation of Critical Systems Modelled by Petri Nets}},
    Author = {Ricardo J. Rodr\'{i}guez},
    School = {Dpto. de Informática e Ingeniería de Sistemas, Universidad de Zaragoza},
    Year = {2013},
    Month = {June},
    Abstract = {A critical system must fulfil its mission despite the presence of security issues. These systems are usually deployed in heterogeneous environments, where they are subject to suffer security issues, such as intrusion attempts, confidential data theft or other type of attacks. Systems usually need to be redesigned after a security disaster, which can lead to severe consequences, such as the huge cost of reimplementing or redeploying all the system, as well as economic losses. Security has to be conceived as an integral part of the development process and as a singular need of what the system should perform (i.e., a non-functional requirement). Thus, when designing critical systems it is fundamental to study the attacks that may occur and plan how to react to them, in order to keep fulfilling the system functional and non-functional requirements. Despite considering security issues, it is also necessary to consider the costs incurred to guarantee a certain security level in critical systems. In fact, security costs can be very relevant and may span along different dimensions, such as budgeting, performance and reliability. Many of these critical systems that incorporate Fault-Tolerant (FT) techniques to deal with security issues are complex systems using resources that are compromised (i.e., they fail) by the activation of faults. These systems can be naturally modelled as Discrete Event Systems (DES) where resources are shared, also called Resource Allocation Systems (RAS). In this dissertation, we focus on FT systems using shared resources modelled as Petri nets (PNs) as formal model language. These systems are usually so large that make the exact computation of their performance a highly complex computational task, due to the well-known state explosion problem. As a result, a task that requires an exhaustive state space exploration becomes unachievable in reasonable time for large systems. The main contribution of this dissertation is threefold. Firstly, we provide different models, expressed by means of the Unified Modelling Language (UML) and Petri nets (PNs), to bring security and FT issues into foreground while designing, then allowing the analysis of security-performance trade-off. Secondly, we provide several algorithms to compute the performance (also performability -- i.e., performance under failure conditions) by means of upper throughput bounds, then avoiding the state space explosion problem. Lastly, we provide algorithms to compensate the throughput degradation produced by an unexpected situation in a FT system.},
    ISSN = {2254-7606},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RJRodriguez-PhD-Thesis.pdf}
    }
  • R. J. Rodríguez, L. A, and Á. Herranz, “From UML State-Machine Diagrams to Erlang,” in Proceedings of the XIII Spanish Conference on Programming and Computer Languages (PROLE 2013), 2013, pp. 288-299.
    [Bibtex]
    @InProceedings{Rodriguez2013,
    Title = {{From UML State-Machine Diagrams to Erlang}},
    Author = {Ricardo J. Rodr\'{i}guez and Lars-\r{A}ke Fredlund and \'{A}ngel Herranz},
    Booktitle = {Proceedings of the XIII Spanish Conference on Programming and Computer Languages (PROLE 2013)},
    Year = {2013},
    Month = {September},
    Pages = {288--299},
    Abstract = {The Unified Modelling Language (UML) is a semi-formal modelling language useful for representing architectural and behavioural aspects of concurrent and distributed systems. In this paper we propose a transformation from UML State-Machine diagrams to Erlang code. Erlang is a functional language, with strict evaluation, single assignment, and dynamic typing, and with good support for concurrency and distribution. The contribution of this transformation is twofold: it can reduce development time, and moreover it permits us to validate UML diagrams at an early development stage through the use of Erlang-based model checking techniques.},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RFH-PROLE-13.pdf}
    }
  • [DOI] R. J. Rodríguez, J. Júlvez, and J. Merseguer, “On the Performance Estimation and Resource Optimisation in Process Petri Nets,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 43, iss. 6, pp. 1385-1398, 2013.
    [Bibtex]
    @Article{Rodriguez2013b,
    Title = {{On the Performance Estimation and Resource Optimisation in Process Petri Nets}},
    Author = {Ricardo J. Rodr\'{i}guez and Jorge J\'{u}lvez and Jos\'{e} Merseguer},
    Journal = {IEEE Transactions on Systems, Man, and Cybernetics: Systems},
    Year = {2013},
    Number = {6},
    Pages = {1385--1398},
    Volume = {43},
    Abstract = {Many artificial systems can be modeled as discrete dynamic systems in which resources are shared among different tasks. The performance of such systems, which is usually a system requirement, heavily relies on the number and distribution of such resources. The goal of this paper is twofold: first, to design a technique to estimate the steady-state performance of a given system with shared resources, and second, to propose a heuristic strategy to distribute shared resources so that the system performance is enhanced as much as possible. The systems under consideration are assumed to be large systems, such as service-oriented architecture (SOA) systems, and modeled by a particular class of Petri nets (PNs) called process PNs. In order to avoid the state explosion problem inherent to discrete models, the proposed techniques make intensive use of linear programming (LP) problems.},
    Doi = {10.1109/TSMC.2013.2245118},
    ISSN = {2168-2216},
    Keywords = {Complexity theory;Computational modeling;Estimation;Optimization;Steady-state;Throughput;Vectors;Discrete event systems (DESs);Petri nets (PNs);performance evaluation;software performance},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RJM-SMC-Sys-13.pdf}
    }
  • [DOI] R. J. Rodríguez, J. Júlvez, and J. Merseguer, “Quantification and Compensation of the Impact of Faults in System Throughput,” Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability, vol. 227, iss. 6, pp. 614-628, 2013.
    [Bibtex]
    @Article{Rodriguez2013a,
    Title = {{Quantification and Compensation of the Impact of Faults in System Throughput}},
    Author = {Ricardo J. Rodr\'{i}guez and Jorge J\'{u}lvez and Jos\'{e} Merseguer},
    Journal = {Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability},
    Year = {2013},
    Month = {December},
    Number = {6},
    Pages = {614--628},
    Volume = {227},
    Abstract = {Performability relates the performance (throughput) and reliability of software systems whose normal behaviour may degrade owing to the existence of faults. These systems, naturally modelled as discrete event systems using shared resources, can incorporate fault-tolerant techniques to mitigate such a degradation. In this article, compositional fault-tolerant models based on Petri nets, which make its sensitive performability analysis easier, are proposed. Besides, two methods to compensate existence of faults are provided: an iterative algorithm to compute the number of extra resources needed, and an integer-linear programming problem that minimises the cost of incrementing resources and/or decrementing fault-tolerant activities. The applicability of the developed methods is shown on a Petri net that models a secure database system.},
    Doi = {10.1177/1748006X13492284},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RJM-JRR-13.pdf}
    }
  • Proceedings of the 5th International Workshop Non-functional Properties in Modeling: Analysis, Languages and Processes co-located with 16th International Conference on Model Driven Engineering Languages and Systems (MODELS 2013), Miami, USA, September 29, 2013CEUR-WS.org, 2013.
    [Bibtex]
    @Proceedings{Bernardi2013c,
    Title = {Proceedings of the 5th International Workshop Non-functional Properties in Modeling: Analysis, Languages and Processes co-located with 16th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2013), Miami, USA, September 29, 2013},
    Year = {2013},
    Editor = {Simona Bernardi and Marko Boskovic and Jos{\'{e}} Merseguer},
    Publisher = {CEUR-WS.org},
    Series = {{CEUR} Workshop Proceedings},
    Volume = {1074},
    Url = {http://ceur-ws.org/Vol-1074}
    }

2012

  • S. Hernández, J. Fabra, P. Álvarez, and J. Ezpeleta, “A Simulation-based Scheduling Strategy for Scientific Workflows,” in SIMULTECH 2012 – Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Rome, Italy, 28 – 31 July, 2012., 2012, pp. 61-70.
    [Bibtex]
    @InProceedings{Hernandez2012a,
    Title = {A Simulation-based Scheduling Strategy for Scientific Workflows},
    Author = {Sergio Hern{\'{a}}ndez and Javier Fabra and Pedro {\'{A}}lvarez and Joaqu{\'{\i}}n Ezpeleta},
    Booktitle = {{SIMULTECH} 2012 - Proceedings of the 2nd International Conference on Simulation and Modeling Methodologies, Technologies and Applications, Rome, Italy, 28 - 31 July, 2012.},
    Year = {2012},
    Pages = {61--70},
    Crossref = {DBLP:conf/simultech/2012},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23}
    }
  • [DOI] S. Hernández, J. Fabra, P. Álvarez, and J. Ezpeleta, “Simulation and Realistic Workloads to Support the Meta-scheduling of Scientific Workflows,” in Simulation and Modeling Methodologies, Technologies and Applications – International Conference, SIMULTECH 2012 Rome, Italy, July 28-31, 2012 Revised Selected Papers, 2012, pp. 155-167.
    [Bibtex]
    @InProceedings{Hernandez2012,
    Title = {Simulation and Realistic Workloads to Support the Meta-scheduling of Scientific Workflows},
    Author = {Sergio Hern{\'{a}}ndez and Javier Fabra and Pedro {\'{A}}lvarez and Joaqu{\'{\i}}n Ezpeleta},
    Booktitle = {Simulation and Modeling Methodologies, Technologies and Applications - International Conference, {SIMULTECH} 2012 Rome, Italy, July 28-31, 2012 Revised Selected Papers},
    Year = {2012},
    Pages = {155--167},
    Crossref = {DBLP:conf/simultech/2012s},
    Doi = {10.1007/978-3-319-03581-9_11},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1007/978-3-319-03581-9_11}
    }
  • S. Bergamaschi, E. Domnori, F. Guerra, S. Rota, R. Trillo-Lado, and Y. Velegrakis, “Understanding the Semantics of Keyword Queries on Relational Data Without Accessing the Instance” in Semantic Search over the Web, Springer, 2012, pp. 131-158.
    [Bibtex]
    @InCollection{Bergamaschi2012,
    Title = {Understanding the Semantics of Keyword Queries on Relational Data
    Without Accessing the Instance},
    Author = {Sonia Bergamaschi and
    Elton Domnori and
    Francesco Guerra and
    Silvia Rota and
    Raquel Trillo-Lado and
    Yannis Velegrakis},
    Booktitle = {Semantic Search over the Web},
    Publisher = {Springer},
    Year = {2012},
    Pages = {131--158},
    Series = {Data-Centric Systems and Applications},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] S. Bernardi, J. Merseguer, and D. C. Petriu, “Dependability Modeling and Assessment in UML-Based Software Development,” The Scientific World Journal, vol. 2012, 2012.
    [Bibtex]
    @Article{Bernardi2012,
    Title = {{Dependability Modeling and Assessment in UML-Based Software Development}},
    Author = {Simona Bernardi and Jos{\'{e}} Merseguer and Dorina C. Petriu},
    Journal = {{The Scientific World Journal}},
    Year = {2012},
    Volume = {2012},
    Doi = {10.1100/2012/614635}
    }
  • [DOI] S. Bernardi, J. Merseguer, and D. C. Petriu, “Dependability modeling and analysis of software systems specified with UML,” ACM Comput. Surv., vol. 45, iss. 1, p. 2:1–2:48, 2012.
    [Bibtex]
    @Article{Bernardi2012a,
    Title = {Dependability modeling and analysis of software systems specified with {UML}},
    Author = {Simona Bernardi and Jos{\'{e}} Merseguer and Dorina C. Petriu},
    Journal = {{ACM} Comput. Surv.},
    Year = {2012},
    Number = {1},
    Pages = {2:1--2:48},
    Volume = {45},
    Doi = {10.1145/2379776.2379778}
    }
  • C. Bobed, E. Mena, and R. Trillo-Lado, “FirstOnt: Automatic Construction of Ontologies out of Multiple Ontological Resources,” in KES, 2012, pp. 1909-1919.
    [Bibtex]
    @InProceedings{Bobed2012,
    Title = {FirstOnt: Automatic Construction of Ontologies out of Multiple Ontological
    Resources},
    Author = {Carlos Bobed and
    Eduardo Mena and
    Raquel Trillo-Lado},
    Booktitle = {{KES}},
    Year = {2012},
    Pages = {1909--1919},
    Publisher = {{IOS} Press},
    Series = {Frontiers in Artificial Intelligence and Applications},
    Volume = {243},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] J. Fabra, D. V. Castro, P. Álvarez, and E. Marcos, “Automatic execution of business process models: Exploiting the benefits of Model-driven Engineering approaches,” Journal of Systems and Software, vol. 85, iss. 3, pp. 607-625, 2012.
    [Bibtex]
    @Article{Fabra2012,
    Title = {Automatic execution of business process models: Exploiting the benefits of Model-driven Engineering approaches},
    Author = {J. Fabra and V. De Castro and P. {\'{A}}lvarez and E. Marcos},
    Journal = {Journal of Systems and Software},
    Year = {2012},
    Note = {Novel approaches in the design and implementation of systems/software architecture},
    Number = {3},
    Pages = {607 - 625},
    Volume = {85},
    __markedentry = {[jcampos:]},
    Doi = {http://dx.doi.org/10.1016/j.jss.2011.09.022},
    ISSN = {0164-1212},
    Keywords = {Business processes, Model-driven Engineering, Model transformation, Model execution, Service-oriented development},
    Url = {http://www.sciencedirect.com/science/article/pii/S0164121211002391}
    }
  • J. Fabra, S. Hernández, P. Álvarez, and J. Ezpeleta, “A Framework for the Flexible Deployment of Scientific Workflows in Grid Environments,” in Proceedings of the Third International Conference on Cloud Computing, GRIDs, and Virtualization, 2012, pp. 1-8.
    [Bibtex]
    @InProceedings{Fabra2012a,
    Title = {A Framework for the Flexible Deployment of Scientific Workflows in Grid Environments},
    Author = {Fabra, Javier and Hern\'andez, Sergio and \'Alvarez, Pedro and Ezpeleta, Joaq\'in},
    Booktitle = {Proceedings of the Third International Conference on Cloud Computing, GRIDs, and Virtualization},
    Year = {2012},
    Pages = {1--8},
    Series = {CLOUD COMPUTING '12},
    __markedentry = {[jcampos:]},
    Owner = {shernandez},
    Timestamp = {2013.10.17}
    }
  • E. González-López de Murillas, J. Fabra, P. Álvarez, and J. Ezpeleta, “COMBAS: A Semantic-Based Model Checking Framework,” in Proceedings of the Sixth International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2012), 2012, pp. 46-52.
    [Bibtex]
    @InProceedings{Gonzalez-LopezdeMurillas2012,
    Title = {COMBAS: A Semantic-Based Model Checking Framework},
    Author = {E. {Gonz\'alez-L\'opez de Murillas} and J. Fabra and P. \'Alvarez and J. Ezpeleta},
    Booktitle = {Proceedings of the Sixth International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2012)},
    Year = {2012},
    Pages = {46--52}
    }
  • S. Hernández, J. Fabra, P. Álvarez, and J. Ezpeleta, “Una solución SOA para ejecutar workflows científicos en entornos Grid heterogéneos,” in VIII Jornadas de Ciencia e Ingeniería de Servicios (JCIS’12), 2012, pp. 27-40.
    [Bibtex]
    @InProceedings{Hernandez2012c,
    Title = {{Una soluci\'on SOA para ejecutar workflows cient\'ificos en entornos Grid heterog\'eneos}},
    Author = {Hern\'andez, Sergio and Fabra, Javier and \'Alvarez, Pedro and Ezpeleta, Joaqu\'in},
    Booktitle = {VIII Jornadas de Ciencia e Ingenier\'ia de Servicios (JCIS'12)},
    Year = {2012},
    Pages = {27--40},
    __markedentry = {[jcampos:]},
    Owner = {shernandez},
    Timestamp = {2015.09.29}
    }
  • [DOI] M. J. Ibáñez, J. Fabra, P. Álvarez, and J. Ezpeleta, “Model Checking Analysis of Semantically Annotated Business Processes,” IEEE Trans. Systems, Man, and Cybernetics, Part A, vol. 42, iss. 4, pp. 854-867, 2012.
    [Bibtex]
    @Article{Ibanez2012,
    Title = {Model Checking Analysis of Semantically Annotated Business Processes},
    Author = {Mar{\'{\i}}a Jos{\'{e}} Ib{\'{a}}{\~{n}}ez and Javier Fabra and Pedro {\'{A}}lvarez and Joaqu{\'{\i}}n Ezpeleta},
    Journal = {{IEEE} Trans. Systems, Man, and Cybernetics, Part {A}},
    Year = {2012},
    Number = {4},
    Pages = {854--867},
    Volume = {42},
    Doi = {10.1109/TSMCA.2012.2183357},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {https://doi.org/10.1109/TSMCA.2012.2183357}
    }
  • [DOI] M. J. Ibáñez, J. Fabra, P. Álvarez, and J. Ezpeleta, “Model Checking Analysis of Semantically Annotated Business Processes,” Systems, Man, and Cybernetics — Part A: Systems and Humans, 2012.
    [Bibtex]
    @Article{Ibanez2012a,
    Title = {Model Checking Analysis of Semantically Annotated Business Processes},
    Author = {M. J. {Ib\'a\~{n}ez} and J. Fabra and P. \'Alvarez and J. Ezpeleta},
    Journal = {Systems, Man, and Cybernetics -- Part A: Systems and Humans},
    Year = {2012},
    Doi = {10.1109/TSMCA.2012.2183357}
    }
  • [DOI] J. Merseguer and S. Bernardi, “Dependability analysis of DES based on MARTE and UML state machines models,” Discrete Event Dynamic Systems, vol. 22, iss. 2, pp. 163-178, 2012.
    [Bibtex]
    @Article{Merseguer2012,
    Title = {Dependability analysis of {DES} based on {MARTE} and {UML} state machines models},
    Author = {Jos{\'{e}} Merseguer and Simona Bernardi},
    Journal = {Discrete Event Dynamic Systems},
    Year = {2012},
    Number = {2},
    Pages = {163--178},
    Volume = {22},
    Doi = {10.1007/s10626-011-0111-1}
    }
  • [DOI] D. Perez-Palacin, J. Merseguer, and R. Mirandola, “Analysis of bursty workload-aware self-adaptive systems,” in Third Joint WOSP/SIPEW International Conference on Performance Engineering, ICPE’12, Boston, MA, USA – April 22 – 25, 2012, 2012, pp. 75-84.
    [Bibtex]
    @InProceedings{Perez-Palacin2012a,
    Title = {Analysis of bursty workload-aware self-adaptive systems},
    Author = {Diego Perez-Palacin and Jos{\'{e}} Merseguer and Raffaela Mirandola},
    Booktitle = {Third Joint {WOSP/SIPEW} International Conference on Performance Engineering, ICPE'12, Boston, MA, {USA} - April 22 - 25, 2012},
    Year = {2012},
    Pages = {75--84},
    Doi = {10.1145/2188286.2188300},
    Url = {http://doi.acm.org/10.1145/2188286.2188300}
    }
  • [DOI] D. Perez-Palacin, R. Mirandola, and J. Merseguer, “QoS and energy management with Petri nets: A self-adaptive framework,” Journal of Systems and Software, vol. 85, iss. 12, pp. 2796-2811, 2012.
    [Bibtex]
    @Article{Perez-Palacin2012,
    Title = {QoS and energy management with Petri nets: {A} self-adaptive framework},
    Author = {Diego Perez-Palacin and Raffaela Mirandola and Jos{\'{e}} Merseguer},
    Journal = {Journal of Systems and Software},
    Year = {2012},
    Number = {12},
    Pages = {2796--2811},
    Volume = {85},
    Doi = {10.1016/j.jss.2012.04.077},
    Url = {http://dx.doi.org/10.1016/j.jss.2012.04.077}
    }
  • {. {. {R}equeno, {. {B}lanco, {. de {M}iguel {C}asado, and {. {. {C}olom, “Sliced model checking for phylogenetic analysis” in Proceedings 6th International Conference on Practical Applications of Computational Biology and Bioinformatics, M. P. Rocha, N. Luscombe, F. Fdez-Riverola, and J. C. M. Rodríguez, Eds., Berlin: Springer, 2012, vol. 154, pp. 95-103.
    [Bibtex]
    @InCollection{Requeno2012,
    Title = {{S}liced model checking for phylogenetic analysis},
    Author = {{R}equeno, {J}os\'{e} {I}gnacio and {B}lanco, {R}oberto and de {M}iguel {C}asado, {G}regorio and {C}olom, {J}os\'{e} {M}anuel},
    Booktitle = {Proceedings 6th International Conference on Practical Applications of Computational Biology and Bioinformatics},
    Publisher = {Springer},
    Year = {2012},
    Address = {Berlin},
    Editor = {Rocha, Miguel P. and Luscombe, Nicholas and Fdez-Riverola, Florentino and Rodr\'{i}guez, Juan M. Corchado},
    Pages = {95--103},
    Series = {Advances in Intelligent and Soft Computing},
    Volume = {154},
    Owner = {nrequeno},
    Timestamp = {2012.06.19}
    }
  • {. {. {R}equeno and {. {. {C}olom, “Compact representation of biological sequences using set decision diagrams” in Proceedings 6th International Conference on Practical Applications of Computational Biology and Bioinformatics, M. P. Rocha, N. Luscombe, F. Fdez-Riverola, and J. C. M. Rodríguez, Eds., Berlin: Springer, 2012, vol. 154, pp. 231-239.
    [Bibtex]
    @InCollection{Requeno2012a,
    Title = {{C}ompact representation of biological sequences using set decision diagrams},
    Author = {{R}equeno, {J}os{\'e} {I}gnacio and {C}olom, {J}os{\'e} {M}anuel},
    Booktitle = {Proceedings 6th International Conference on Practical Applications of Computational Biology and Bioinformatics},
    Publisher = {Springer},
    Year = {2012},
    Address = {Berlin},
    Editor = {Rocha, Miguel P. and Luscombe, Nicholas and Fdez-Riverola, Florentino and Rodr\'{i}guez, Juan M. Corchado},
    Pages = {231--239},
    Series = {Advances in Intelligent and Soft Computing},
    Volume = {154},
    Owner = {nrequeno},
    Timestamp = {2012.06.19}
    }
  • [DOI] R. J. Rodríguez, J. Júlvez, and J. Merseguer, “PeabraiN: A PIPE Extension for Performance Estimation and Resource Optimisation,” in Proceedings of the 12th International Conference on Application of Concurrency to System Designs (ACSD), 2012, pp. 142-147.
    [Bibtex]
    @InProceedings{Rodriguez2012,
    Title = {{PeabraiN: A PIPE Extension for Performance Estimation and Resource Optimisation}},
    Author = {Ricardo J. Rodr\'{i}guez and Jorge J\'{u}lvez and Jos\'{e} Merseguer},
    Booktitle = {Proceedings of the 12th International Conference on Application of Concurrency to System Designs (ACSD)},
    Year = {2012},
    Pages = {142--147},
    Publisher = {IEEE},
    Abstract = {Many discrete systems with shared resources from different artificial domains (such as manufacturing, logistics or web services) can be modelled in terms of timed Petri nets. Two studies that may result of interest when dealing with such a systems are the performance evaluation (or completed jobs per unit of time) and the resource optimisation. Exact performance evaluation, however, may become unachievable due to the necessity of an exhaustive exploration of the state-space. In this context, a solution can be to estimate the performance by computing bounds. Resource optimisation leverages a budget and distributes resources in order to maximise the system performance. In this paper, we present PeabraiN, a collection of PIPE tool-compliant modules for performance estimation and resource optimisation based on bounds computation for Stochastic Petri Nets. The algorithms supporting the modules make an intensive use of linear programming techniques and therefore their computational complexity is low. Besides, other PN properties, such as structural enabling bound at a transition, structural marking bound at a place or visit ratios computation, are added to PIPE tool as well.},
    Doi = {10.1109/ACSD.2012.13},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RJM-ACSD-12.pdf}
    }
  • [DOI] R. J. Rodríguez, R. Tolosana-Calasanz, and O. F. Rana, “Automating Data-Throttling Analysis for Data-Intensive Workflows,” in Proceedings of the 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), 2012, pp. 310-317.
    [Bibtex]
    @InProceedings{Rodriguez2012b,
    Title = {{Automating Data-Throttling Analysis for Data-Intensive Workflows}},
    Author = {Ricardo J. Rodr\'{i}guez and Rafael Tolosana-Calasanz and Omer F. Rana},
    Booktitle = {Proceedings of the 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)},
    Year = {2012},
    Month = {May},
    Pages = {310--317},
    Publisher = {IEEE},
    Abstract = {Data movement between tasks in scientific workflows has received limited attention compared to task execution. Often the staging of data between tasks is either assumed or the time delay in data transfer is considered to be negligible (compared to task execution). Where data consists of files, such file transfers are accomplished as fast as the network links allow, and once transferred, the files are buffered/stored at their destination. Where a task requires multiple files to execute (from different tasks), it must, however, remain idle until all files are available. Hence, network bandwidth and buffer/storage within a workflow are often not used effectively. We propose an automated workflow structural analysis method for Directed Acyclic Graphs (DAGs) which utilises information from previous workflow executions. The method obtains data-throttling values for the data transfer to enable network bandwidth and buffer/storage capacity to be managed more efficiently. We convert a DAG representation into a Petri net model and analyse the resulting graph using an iterative method to compute data-throttling values. Our approach is demonstrated using the Montage workflow.},
    Doi = {10.1109/CCGrid.2012.27},
    ISBN = {978-1-4673-1395-7},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RTR-CCGrid-12.pdf}
    }
  • [DOI] R. J. Rodríguez, R. Tolosana-Calasanz, and O. F. Rana, “Measuring the Effectiveness of Thottled Data Transfers on Data-Intensive Workflows,” in Proceedings of the 6th International KES Conference on Agents and Multi-agent Systems — Technologies and Applications, 2012, pp. 144-153.
    [Bibtex]
    @InProceedings{Rodriguez2012c,
    Title = {{Measuring the Effectiveness of Thottled Data Transfers on Data-Intensive Workflows}},
    Author = {Ricardo J. Rodr\'{i}guez and Rafael Tolosana-Calasanz and Omer F. Rana},
    Booktitle = {Proceedings of the 6th International KES Conference on Agents and Multi-agent Systems -- Technologies and Applications},
    Year = {2012},
    Editor = {Gordan Jezic and Mario Kusek and Ngoc Thanh Nguyen and Robert J. Howlett and Lakhmi C. Jain},
    Pages = {144--153},
    Publisher = {Springer},
    Series = {Lecture Notes in Computer Science},
    Volume = {7327},
    Abstract = {In data intensive workflows, which often involve files, transfer between tasks is typically accomplished as fast as the network links allow, and once transferred, the files are buffered/stored at their destination. Where a task requires multiple files to execute (from different previous tasks), it must remain idle until all files are available. Hence, network bandwidth and buffer/storage within a workflow are often not used effectively. In this paper, we are quantitatively measuring the impact that applying an intelligent data movement policy can have on buffer/storage in comparison with existing approaches. Our main objective is to propose a metric that considers a workflow structure expressed as a Directed Acyclic Graph (DAG), and performance information collected from historical past executions of the considered workflow. This metric is intended for use at the design-stage, to compare various DAG structures and evaluate their potential for optimisation (of network bandwidth and buffer use).},
    Doi = {10.1007/978-3-642-30947-2_18},
    ISBN = {978-3-642-30946-5},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RTR-KES-AMSTA-12.pdf}
    }
  • [DOI] R. J. Rodríguez, C. Trubiani, and J. Merseguer, “Fault-Tolerant Techniques and Security Mechanisms for Model-based Performance Prediction of Critical Systems,” in Proceedings of the 3rd International Symposium on Architecting Critical Systems (ISARCS), 2012, pp. 21-30.
    [Bibtex]
    @InProceedings{Rodriguez2012a,
    Title = {{Fault-Tolerant Techniques and Security Mechanisms for Model-based Performance Prediction of Critical Systems}},
    Author = {Ricardo J. Rodr\'{i}guez and Catia Trubiani and Jos{\'e} Merseguer},
    Booktitle = {Proceedings of the 3rd International Symposium on Architecting Critical Systems (ISARCS)},
    Year = {2012},
    Pages = {21--30},
    Publisher = {ACM},
    Abstract = {Security attacks aim to system vulnerabilities that may lead to operational failures. In order to react to attacks software designers use to introduce Fault-Tolerant Techniques (FTTs), such as recovery procedures, and/or Security Mechanisms (SMs), such as encryption of data. FTTs and SMs inevitably consume system resources, hence they influence the system performance, even affecting its full operability. The goal of this paper is to provide a model-based methodology able to quantitatively estimate the performance degradation due to the introduction of FTTs and/or SMs aimed at protecting critical systems. Such a methodology is able to inform software designers about the performance degradation the system may incur, thus supporting them to find appropriate security strategies while meeting performance requirements. This approach has been applied to a case study in the E-commerce domain, whose experimental results demonstrate its effectiveness.},
    Doi = {10.1145/2304656.2304660},
    ISBN = {978-3-642-13555-2},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RTM-ISARCS-12.pdf}
    }

2011

  • S. Bergamaschi, E. Domnori, F. Guerra, R. Trillo-Lado, and Y. Velegrakis, “Keyword search over relational databases: a metadata approach,” in SIGMOD Conference, 2011, pp. 565-576.
    [Bibtex]
    @InProceedings{Bergamaschi2011a,
    Title = {Keyword search over relational databases: a metadata approach},
    Author = {Sonia Bergamaschi and
    Elton Domnori and
    Francesco Guerra and
    Raquel Trillo-Lado and
    Yannis Velegrakis},
    Booktitle = {{SIGMOD} Conference},
    Year = {2011},
    Pages = {565--576},
    Publisher = {{ACM}},
    __markedentry = {[jcampos:6]}
    }
  • S. Bergamaschi, E. Domnori, F. Guerra, R. Trillo-Lado, and Y. Velegrakis, “Keyword-based Search in Data Integration Systems,” in SEBD, 2011, p. 103.
    [Bibtex]
    @InProceedings{Bergamaschi2011,
    Title = {Keyword-based Search in Data Integration Systems},
    Author = {Sonia Bergamaschi and
    Elton Domnori and
    Francesco Guerra and
    Raquel Trillo-Lado and
    Yannis Velegrakis},
    Booktitle = {{SEBD}},
    Year = {2011},
    Pages = {103},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] S. Bernardi, J. Campos, and J. Merseguer, “Timing-failure risk assessment of UML design using Time Petri Net bound techniques,” IEEE Transactions on Industrial Informatics, vol. 7, iss. 1, pp. 90-104, 2011.
    [Bibtex]
    @Article{BCM-TII-11,
    Title = {Timing-failure risk assessment of {UML} design
    using {Time} {Petri} {Net} bound techniques},
    Author = {S. Bernardi and J. Campos and J. Merseguer},
    Journal = {IEEE Transactions on Industrial Informatics},
    Year = {2011},
    Month = {February},
    Number = {1},
    Pages = {90-104},
    Volume = {7},
    Abstract = {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 realtime
    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 non-functional 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.},
    Doi = {10.1109/TII.2010.2098415},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/bcm-tii-11.pdf}
    }
  • [DOI] S. Bernardi, F. Flammini, S. Marrone, J. Merseguer, C. Papa, and V. Vittorini, “Model-Driven Availability Evaluation of Railway Control Systems,” in Computer Safety, Reliability, and Security – 30th International Conference, SAFECOMP 2011, Naples, Italy, September 19-22, 2011. Proceedings, 2011, pp. 15-28.
    [Bibtex]
    @InProceedings{Bernardi2011b,
    Title = {Model-Driven Availability Evaluation of Railway Control Systems},
    Author = {Simona Bernardi and Francesco Flammini and Stefano Marrone and Jos{\'{e}} Merseguer and Camilla Papa and Valeria Vittorini},
    Booktitle = {Computer Safety, Reliability, and Security - 30th International Conference, {SAFECOMP} 2011, Naples, Italy, September 19-22, 2011. Proceedings},
    Year = {2011},
    Pages = {15--28},
    Doi = {10.1007/978-3-642-24270-0_2}
    }
  • [DOI] S. Bernardi, J. Merseguer, and D. C. Petriu, “A dependability profile within MARTE,” Software and System Modeling, vol. 10, iss. 3, pp. 313-336, 2011.
    [Bibtex]
    @Article{Bernardi2011,
    Title = {A dependability profile within {MARTE}},
    Author = {Simona Bernardi and Jos{\'e} Merseguer and Dorina C. Petriu},
    Journal = {Software and System Modeling},
    Year = {2011},
    Number = {3},
    Pages = {313-336},
    Volume = {10},
    Doi = {10.1007/s10270-009-0128-1},
    Ee = {http://dx.doi.org/10.1007/s10270-009-0128-1}
    }
  • [DOI] J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “DENEB: a platform for the development and execution of interoperable dynamic Web processes,” Concurrency and Computation: Practice and Experience, vol. 23, iss. 18, pp. 2421-2451, 2011.
    [Bibtex]
    @Article{Fabra2011,
    Title = {{DENEB:} a platform for the development and execution of interoperable dynamic Web processes},
    Author = {Javier Fabra and Pedro {\'{A}}lvarez and Jos{\'{e}} A. Ba{\~{n}}ares and Joaquin Ezpeleta},
    Journal = {Concurrency and Computation: Practice and Experience},
    Year = {2011},
    Number = {18},
    Pages = {2421--2451},
    Volume = {23},
    Doi = {10.1002/cpe.1795},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1002/cpe.1795}
    }
  • [DOI] M. J. Ibáñez, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “Control and Data Flow Compatibility in the Interaction between Dynamic Business Processes,” Concurrency and Computation: Practice and Experience, vol. 23, pp. 57-85, 2011.
    [Bibtex]
    @Article{Ibanez2011,
    Title = {Control and {D}ata {F}low {C}ompatibility in the {I}nteraction between {D}ynamic {B}usiness {P}rocesses},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Pedro \'Alvarez and Jose Angel {Ba\~{n}ares} and Joaqu\'in Ezpeleta},
    Journal = {Concurrency and Computation: Practice and Experience},
    Year = {2011},
    Pages = {57-85},
    Volume = {23},
    Doi = {10.1002/cpe.1595},
    Issue = {1},
    Publisher = {Wiley InterScience}
    }
  • [DOI] M. J. Ibáñez, P. Álvarez, and J. Ezpeleta, “Analyzing Behavioral Properties of Semantic Business Processes with Parametric Data,” Concurrency and Computation: Practice and Experience, vol. 23, pp. 525-555, 2011.
    [Bibtex]
    @Article{Ibanez2011a,
    Title = {Analyzing {B}ehavioral {P}roperties of {S}emantic {B}usiness {P}rocesses with {P}arametric {D}ata},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Pedro \'Alvarez and Joaqu\'in Ezpeleta},
    Journal = {Concurrency and Computation: Practice and Experience},
    Year = {2011},
    Pages = {525-555},
    Volume = {23},
    Doi = {10.1002/cpe.1661},
    Issue = {6},
    Publisher = {Wiley InterScience}
    }
  • G. E. de Murillas, F. J. Fabra, P. Álvarez, and J. Ezpeleta, “COMBAS: una herramienta para el análisis de procesos con información semántica,” in VII Jornadas de Ciencia e Ingeniería de Servicios (JCIS’11), 2011, pp. 41-54.
    [Bibtex]
    @InProceedings{Murillas2011,
    Title = {COMBAS: una herramienta para el an\'alisis de procesos con informaci\'on sem\'antica},
    Author = {E. Gonz\'alez-López de Murillas and F.J. Fabra and P. \'Alvarez and J. Ezpeleta},
    Booktitle = {VII Jornadas de Ciencia e Ingeniería de Servicios (JCIS’11)},
    Year = {2011},
    Pages = {41-54},
    __markedentry = {[jcampos:]}
    }
  • [DOI] D. Perez-Palacin and J. Merseguer, “Performance sensitive self-adaptive service-oriented software using hidden markov models,” in ICPE’11 – Second Joint WOSP/SIPEW International Conference on Performance Engineering, Karlsruhe, Germany, March 14-16, 2011, 2011, pp. 201-206.
    [Bibtex]
    @InProceedings{Perez-Palacin2011c,
    Title = {Performance sensitive self-adaptive service-oriented software using hidden markov models},
    Author = {Diego Perez-Palacin and Jos{\'{e}} Merseguer},
    Booktitle = {ICPE'11 - Second Joint {WOSP/SIPEW} International Conference on Performance Engineering, Karlsruhe, Germany, March 14-16, 2011},
    Year = {2011},
    Pages = {201--206},
    Doi = {10.1145/1958746.1958776},
    Url = {http://doi.acm.org/10.1145/1958746.1958776}
    }
  • [DOI] D. Perez-Palacin and J. Merseguer, “Performance sensitive self-adaptive service-oriented software using hidden Markov models (abstracts only),” SIGMETRICS Performance Evaluation Review, vol. 39, iss. 3, p. 15, 2011.
    [Bibtex]
    @Article{Perez-Palacin2011,
    Title = {Performance sensitive self-adaptive service-oriented software using hidden Markov models (abstracts only)},
    Author = {Diego Perez-Palacin and Jos{\'{e}} Merseguer},
    Journal = {{SIGMETRICS} Performance Evaluation Review},
    Year = {2011},
    Number = {3},
    Pages = {15},
    Volume = {39},
    Doi = {10.1145/2160803.2160825},
    Url = {http://doi.acm.org/10.1145/2160803.2160825}
    }
  • [DOI] D. Perez-Palacin, R. Mirandola, and J. Merseguer, “Enhancing a QoS-based self-adaptive framework with energy management capabilities,” in 7th International Conference on the Quality of Software Architectures, QoSA 2011 and 2nd International Symposium on Architecting Critical Systems, ISARCS 2011. Boulder, CO, USA, June 20-24, 2011, Proceedings, 2011, pp. 165-170.
    [Bibtex]
    @InProceedings{Perez-Palacin2011a,
    Title = {Enhancing a QoS-based self-adaptive framework with energy management capabilities},
    Author = {Diego Perez-Palacin and Raffaela Mirandola and Jos{\'{e}} Merseguer},
    Booktitle = {7th International Conference on the Quality of Software Architectures, QoSA 2011 and 2nd International Symposium on Architecting Critical Systems, {ISARCS} 2011. Boulder, CO, USA, June 20-24, 2011, Proceedings},
    Year = {2011},
    Pages = {165--170},
    Doi = {10.1145/2000259.2000287},
    Url = {http://doi.acm.org/10.1145/2000259.2000287}
    }
  • [DOI] D. Perez-Palacin, R. Mirandola, and J. Merseguer, “Software architecture adaptability metrics for QoS-based self-adaptation,” in 7th International Conference on the Quality of Software Architectures, QoSA 2011 and 2nd International Symposium on Architecting Critical Systems, ISARCS 2011. Boulder, CO, USA, June 20-24, 2011, Proceedings, 2011, pp. 171-176.
    [Bibtex]
    @InProceedings{Perez-Palacin2011b,
    Title = {Software architecture adaptability metrics for QoS-based self-adaptation},
    Author = {Diego Perez-Palacin and Raffaela Mirandola and Jos{\'{e}} Merseguer},
    Booktitle = {7th International Conference on the Quality of Software Architectures, QoSA 2011 and 2nd International Symposium on Architecting Critical Systems, {ISARCS} 2011. Boulder, CO, USA, June 20-24, 2011, Proceedings},
    Year = {2011},
    Pages = {171--176},
    Doi = {10.1145/2000259.2000288},
    Url = {http://doi.acm.org/10.1145/2000259.2000288}
    }
  • {. {. {R}equeno, {. {B}lanco, {. de {M}iguel {C}asado, and {. {. {C}olom, “Phylogenetic analysis using an SMV tool” in Proceedings 5th International Conference on Practical Applications of Computational Biology and Bioinformatics, M. P. Rocha, J. C. M. Rodríguez, F. Fdez-Riverola, and A. Valencia, Eds., Berlin: Springer, 2011, vol. 93, pp. 167-174.
    [Bibtex]
    @InCollection{Requeno2011,
    Title = {{P}hylogenetic analysis using an {SMV} tool},
    Author = {{R}equeno, {J}os\'{e} {I}gnacio and {B}lanco, {R}oberto and de {M}iguel {C}asado, {G}regorio and {C}olom, {J}os\'{e} {M}anuel},
    Booktitle = {Proceedings 5th International Conference on Practical Applications of Computational Biology and Bioinformatics},
    Publisher = {Springer},
    Year = {2011},
    Address = {Berlin},
    Editor = {Rocha, Miguel P. and Rodr{\'i}guez, Juan M. Corchado and Fdez-Riverola, Florentino and Valencia, Alfonso},
    Pages = {167--174},
    Series = {Advances in Intelligent and Soft Computing},
    Volume = {93},
    Affiliation = {Department of Computer Science and Systems Engineering (DIIS)/Aragon Institute of Engineering Research (I3A), Universidad de Zaragoza, C/ Maria de Luna 1, 50018 Zaragoza, Spain},
    Owner = {nrequeno},
    Timestamp = {2011.04.27}
    }
  • R. J. Rodríguez, J. Merseguer, and S. Bernardi, “A Security Analysis and Modelling profile: an Overview,” {Dpto. de Informática e Ingeniería de Sistemas, Universidad de Zaragoza}, {RR-01-11}, 2011.
    [Bibtex]
    @TechReport{Rodriguez2011,
    Title = {{A Security Analysis and Modelling profile: an Overview}},
    Author = {Ricardo J. Rodr\'{i}guez and Jos\'{e} Merseguer and Simona Bernardi},
    Institution = {{Dpto. de Inform\'{a}tica e Ingenier\'{i}a de Sistemas, Universidad de Zaragoza}},
    Year = {2011},
    Number = {{RR-01-11}},
    Abstract = {Security is a non-functional property that, at least, should be documented early in the software life-cycle, but also assessed whenever possible in these stages. However, modelling system security is not a common practise in software projects yet and there is not a standard for this purpose. UML, the de facto standard as modelling language, can be tailored for specific purposes through profiling. For example, UML features MARTE, a profile for quantitative analysis of schedulability and performance. Other profile, DAM (which inherits from MARTE) enables UML for quantitative analysis of dependability. Dependability and security share well-known concerns at the core of computing: availability and integrity. In this work, the basis of a security profile for UML is developed. It is built on the MARTE-DAM framework and accounts for the tight relationships between security and dependability. Concretely, access control mechanisms and resilience topic are addressed in this work to establish the main body of the proposed profile. Some examples are used through the paper to illustrate the usage of the profile.}
    }
  • R. Trillo-Lado, L. Po, S. Ilarri, S. Bergamaschi, and E. Mena, “Using semantic techniques to access web data,” Inf. Syst., vol. 36, iss. 2, pp. 117-133, 2011.
    [Bibtex]
    @Article{Trillo-Lado2011,
    Title = {Using semantic techniques to access web data},
    Author = {Raquel Trillo-Lado and
    Laura Po and
    Sergio Ilarri and
    Sonia Bergamaschi and
    Eduardo Mena},
    Journal = {Inf. Syst.},
    Year = {2011},
    Number = {2},
    Pages = {117--133},
    Volume = {36},
    __markedentry = {[jcampos:6]}
    }

2010

  • {B}lanco {R}oberto, {. de {M}iguel {C}asado, {. {. {R}equeno, and {. {. {C}olom, “Temporal logics for phylogenetic analysis via model checking,” in Proceedings IEEE International Workshop on Mining and Management of Biological and Health Data, Los Alamitos, CA, 2010.
    [Bibtex]
    @InProceedings{Blanco2010,
    Title = {{T}emporal logics for phylogenetic analysis via model checking},
    Author = {{B}lanco, {R}oberto, and de {M}iguel {C}asado, {G}regorio and {R}equeno, {J}os\'{e} {I}gnacio and {C}olom, {J}os\'{e} {M}anuel},
    Booktitle = {Proceedings IEEE International Workshop on Mining and Management of Biological and Health Data},
    Year = {2010},
    Address = {Los Alamitos, CA},
    Owner = {nrequeno},
    Timestamp = {2011.03.14}
    }
  • S. Bergamaschi, E. Domnori, F. Guerra, M. Orsini, R. Trillo-Lado, and Y. Velegrakis, “Keymantic: Semantic Keyword-based Searching in Data Integration Systems,” PVLDB, vol. 3, iss. 2, pp. 1637-1640, 2010.
    [Bibtex]
    @Article{Bergamaschi2010,
    Title = {Keymantic: Semantic Keyword-based Searching in Data Integration Systems},
    Author = {Sonia Bergamaschi and
    Elton Domnori and
    Francesco Guerra and
    Mirko Orsini and
    Raquel Trillo-Lado and
    Yannis Velegrakis},
    Journal = {{PVLDB}},
    Year = {2010},
    Number = {2},
    Pages = {1637--1640},
    Volume = {3},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] S. Bernardi, J. Merseguer, and R. R. Lutz, “Reliability and availability requirements engineering within the Unified Process using a Dependability Analysis and Modeling profile,” in Proceedings of the Eighth European Dependable Computing Conference (EDCC’10), Valencia, Spain, 2010, pp. 95-104.
    [Bibtex]
    @InProceedings{Bernardi2010,
    Title = {Reliability and availability requirements engineering within the Unified Process using a Dependability Analysis and Modeling profile},
    Author = {S. Bernardi and J. Merseguer and R.R. Lutz},
    Booktitle = {Proceedings of the Eighth European Dependable Computing Conference (EDCC'10)},
    Year = {2010},
    Address = {Valencia, Spain},
    Pages = {95--104},
    Publisher = {IEEE},
    Doi = {10.1109/EDCC.2010.21},
    ISBN = {978-1-60558-563-5}
    }
  • C. Bobed, R. Trillo-Lado, E. Mena, and S. Ilarri, “From Keywords to Queries: Discovering the User’s Intended Meaning,” in WISE, 2010, pp. 190-203.
    [Bibtex]
    @InProceedings{Bobed2010,
    Title = {From Keywords to Queries: Discovering the User's Intended Meaning},
    Author = {Carlos Bobed and
    Raquel Trillo-Lado and
    Eduardo Mena and
    Sergio Ilarri},
    Booktitle = {{WISE}},
    Year = {2010},
    Pages = {190--203},
    Publisher = {Springer},
    Series = {Lecture Notes in Computer Science},
    Volume = {6488},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] J. Campos, “Guest Editorial: Special Section on Formal Methods in Manufacturing,” IEEE Transactions on Industrial Informatics, vol. 6, iss. 2, pp. 125-126, 2010.
    [Bibtex]
    @Article{Cam-TII-10,
    Title = {Guest Editorial: {Special Section on Formal Methods in Manufacturing}},
    Author = {J. Campos},
    Journal = {IEEE Transactions on Industrial Informatics},
    Year = {2010},
    Month = {May},
    Number = {2},
    Pages = {125-126},
    Volume = {6},
    Doi = {10.1109/TII.2010.2042529},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cam-tii-10.pdf}
    }
  • V. de Castro, F. J. Fabra, P. Álvarez, and E. Marcos, “Integración de SOD-M y DENEB: un marco para la ejecución de modelos de procesos de negocio,” in VI Jornadas científico-técnicas en Servicios Web y SOA (JSWEB’10), 2010, pp. 103-116.
    [Bibtex]
    @InProceedings{Castro2010,
    Title = {Integraci\'on de SOD-M y DENEB: un marco para la ejecuci\'on de modelos de procesos de negocio},
    Author = {V. de Castro and F.J. Fabra and P. \'Alvarez and E. Marcos},
    Booktitle = {VI Jornadas científico-técnicas en Servicios Web y SOA (JSWEB’10)},
    Year = {2010},
    Pages = {103-116},
    __markedentry = {[jcampos:]}
    }
  • J. Fabra and P. Álvarez, “BPEL2DENEB: translation of BPEL processes to executable high-level Petri nets,” in The Fifth International Conference on Internet and Web Applications and Services (ICIW’10), 2010, pp. 496-505.
    [Bibtex]
    @InProceedings{Fabra2010,
    Title = {BPEL2DENEB: translation of BPEL processes to executable high-level Petri nets},
    Author = {J. Fabra and P. \'Alvarez},
    Booktitle = {The Fifth International Conference on Internet and Web Applications and Services (ICIW'10)},
    Year = {2010},
    Pages = {496-505},
    __markedentry = {[jcampos:]}
    }
  • [DOI] E. Gómez-Martínez and J. Merseguer, “Performance Modeling and Analysis of the Universal Control Hub,” in Computer Performance Engineering – 7th European Performance Engineering Workshop, EPEW 2010, Bertinoro, Italy, September 23-24, 2010. Proceedings, 2010, pp. 160-174.
    [Bibtex]
    @InProceedings{Gomez-Martinez2010,
    Title = {Performance Modeling and Analysis of the Universal Control Hub},
    Author = {Elena G{\'{o}}mez-Mart{\'{\i}}nez and Jos{\'{e}} Merseguer},
    Booktitle = {Computer Performance Engineering - 7th European Performance Engineering Workshop, {EPEW} 2010, Bertinoro, Italy, September 23-24, 2010. Proceedings},
    Year = {2010},
    Pages = {160--174},
    Doi = {10.1007/978-3-642-15784-4_11},
    Url = {http://dx.doi.org/10.1007/978-3-642-15784-4_11}
    }
  • [DOI] H. J. A. Holanda, J. Merseguer, G. Cordeiro, and A. B. Serra, “Performance Evaluation of Web Services Orchestrated with WS-BPEL4People,” International Journal of Computer Networks & Communications, vol. 2, p. 18, 2010.
    [Bibtex]
    @Article{Holanda2010,
    Title = {Performance Evaluation of Web Services Orchestrated with WS-BPEL4People},
    Author = {H.J.A. Holanda and Jos{\'e} Merseguer and G. Cordeiro and A.B. Serra},
    Journal = {International Journal of Computer Networks \& Communications},
    Year = {2010},
    Month = {11/2010},
    Pages = {18},
    Volume = {2},
    Chapter = {117},
    Doi = {10.5121/ijcnc.2010.2609},
    ISSN = {0975- 2293}
    }
  • M. J. Ibáñez, P. Álvarez, and J. Ezpeleta, “Model Checking Verification of Behavioral Properties in Semantically Annotated Business Processes,” Submited to Journal of Computer and System Science, 2010.
    [Bibtex]
    @Article{Ibanez2010,
    Title = {Model {C}hecking {V}erification of {B}ehavioral {P}roperties in {S}emantically {A}nnotated {B}usiness {P}rocesses},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Pedro \'Alvarez and Joaqu\'in Ezpeleta},
    Journal = {Submited to Journal of Computer and System Science},
    Year = {2010},
    Publisher = {IEEE Computer Society}
    }
  • M. J. Ibáñez, G. Vulcu, J. Ezpeleta, and S. Bhiri, “Discovery of Service Partners based on Interaction Descriptions,” Submited to Data and Knowledge Engineering, 2010.
    [Bibtex]
    @Article{Ibanez2010a,
    Title = {Discovery of {S}ervice {P}artners based on {I}nteraction {D}escriptions},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Gabriela Vulcu and Joaqu\'in Ezpeleta and Sami Bhiri},
    Journal = {Submited to Data and Knowledge Engineering},
    Year = {2010},
    Publisher = {Elsevier}
    }
  • M. J. Ibáñez, G. Vulcu, J. Ezpeleta, and S. Bhiri, “Semantically Enabled Business Process Discovery,” in Procedings of the 25th Symposium On Applied Computing (SAC 2010), Sierre, Switzerland, March 22 -26, 2010, 2010, pp. 1396-1403.
    [Bibtex]
    @InProceedings{Ibanez2010b,
    Title = {Semantically {E}nabled {B}usiness {P}rocess {D}iscovery},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Gabriela Vulcu and Joaqu\'in Ezpeleta and Sami Bhiri},
    Booktitle = {Procedings of the 25th Symposium On Applied Computing (SAC 2010), Sierre, Switzerland, March 22 -26, 2010},
    Year = {2010},
    Pages = {1396--1403}
    }
  • [DOI] C. K. M. Marques, S. Ilarri, J. Merseguer, and G. C. Barroso, “Performance analysis of a dynamic architecture for reconfiguration of web servers clusters,” in Proceedings of the 6th International Conference on Networking and Services (ICNS’10), Cancun, Mexico, 2010, pp. 224-229.
    [Bibtex]
    @InProceedings{Marques2010,
    Title = {Performance analysis of a dynamic architecture for reconfiguration of web servers clusters},
    Author = {C.K.M. Marques and S. Ilarri and J. Merseguer and G.C. Barroso},
    Booktitle = {Proceedings of the 6th International Conference on Networking and Services (ICNS'10)},
    Year = {2010},
    Address = {Cancun, Mexico},
    Pages = {224-229},
    Publisher = {IEEE},
    Doi = {10.1109/ICNS.2010.38},
    ISBN = {978-0-76905-3969-0}
    }
  • [DOI] D. Perez-Palacin and J. Merseguer, “Performance Evaluation of Self-reconfigurable Service-oriented Software With Stochastic Petri Nets,” Electr. Notes Theor. Comput. Sci., vol. 261, pp. 181-201, 2010.
    [Bibtex]
    @Article{Perez-Palacin2010,
    Title = {Performance Evaluation of Self-reconfigurable Service-oriented Software With Stochastic Petri Nets},
    Author = {Diego Perez-Palacin and Jos{\'{e}} Merseguer},
    Journal = {Electr. Notes Theor. Comput. Sci.},
    Year = {2010},
    Pages = {181--201},
    Volume = {261},
    Doi = {10.1016/j.entcs.2010.01.012},
    Url = {http://dx.doi.org/10.1016/j.entcs.2010.01.012}
    }
  • [DOI] D. Perez-Palacin, J. Merseguer, and S. Bernardi, “Performance Aware Open-world Software in a 3-Layer Architecture,” in Proceedings of the 1st International Conference on Performance Engineering (ICPE’10), San José, California, USA, 2010, pp. 49-56.
    [Bibtex]
    @InProceedings{Perez-Palacin2010a,
    Title = {{P}erformance {A}ware {Open-world} {S}oftware in a {3-Layer} {A}rchitecture},
    Author = {D. Perez-Palacin and J. Merseguer and S. Bernardi},
    Booktitle = {Proceedings of the 1st International Conference on Performance Engineering (ICPE'10)},
    Year = {2010},
    Address = {San Jos{\'e}, California, USA},
    Pages = {49-56},
    Publisher = {ACM},
    Comment = {References: 2011:BLG-ACM-AC-11},
    Doi = {10.1145/1712605.1712614},
    ISBN = {978-1-60558-563-5}
    }
  • [DOI] D. Perez-Palacin, R. Mirandola, J. Merseguer, and V. Grassi, “QoS-Based Model Driven Assessment of Adaptive Reactive Systems,” in Third International Conference on Software Testing, Verification and Validation, ICST 2010, Paris, France, April 7-9, 2010, Workshops Proceedings, 2010, pp. 299-308.
    [Bibtex]
    @InProceedings{Perez-Palacin2010b,
    Title = {QoS-Based Model Driven Assessment of Adaptive Reactive Systems},
    Author = {Diego Perez-Palacin and Raffaela Mirandola and Jos{\'{e}} Merseguer and Vincenzo Grassi},
    Booktitle = {Third International Conference on Software Testing, Verification and Validation, {ICST} 2010, Paris, France, April 7-9, 2010, Workshops Proceedings},
    Year = {2010},
    Pages = {299--308},
    Doi = {10.1109/ICSTW.2010.20},
    Timestamp = {Mon, 11 May 2015 16:37:25 +0200},
    Url = {http://dx.doi.org/10.1109/ICSTW.2010.20}
    }
  • [DOI] R. J. Rodríguez and J. Júlvez, “Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing,” in Proceedings of the 7th European Performance Engineering Workshop (EPEW), 2010, pp. 175-190.
    [Bibtex]
    @InProceedings{Rodriguez2010,
    Title = {{Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing}},
    Author = {Ricardo J. Rodr\'{i}guez and Jorge J\'{u}lvez},
    Booktitle = {Proceedings of the 7th European Performance Engineering Workshop (EPEW)},
    Year = {2010},
    Month = {September},
    Pages = {175--190},
    Publisher = {Springer},
    Series = {Lecture Notes in Computer Science},
    Volume = {6342},
    Abstract = {The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of current industrial systems, which are often modelled as a Discrete Event Systems (DES), is a need. Due to the state explosion problem, the performance evaluation of DES becomes increasingly difficult as the size of the systems increases. Some approaches, such as the computation of performance bounds, have been developed to overcome this problem. In this paper we propose a new method to produce performance bounds that are sharper than the ones that can be achieved with current methods. The core of our method is an iterative algorithm that initially considers the most constraining bottleneck cycle of the system and adds other cycles to it in each iteration. The proposed method is deeply explained and then applied to a broad set of Marked Graphs.},
    Doi = {10.1007/978-3-642-15784-4_12},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RJ-EPEW-10.pdf}
    }
  • [DOI] R. J. Rodríguez and J. Merseguer, “Integrating Fault-Tolerant Techniques into the Design of Critical Systems,” in Proceedings of the 1st International Symposium on Architecting Critical Systems (ISARCS), Prague, Czech Republic, 2010, pp. 33-51.
    [Bibtex]
    @InProceedings{Rodriguez2010b,
    Title = {{Integrating Fault-Tolerant Techniques into the Design of Critical Systems}},
    Author = {Ricardo J. Rodr\'{i}guez and Jos{\'e} Merseguer},
    Booktitle = {Proceedings of the 1st International Symposium on Architecting Critical Systems (ISARCS)},
    Year = {2010},
    Address = {Prague, Czech Republic},
    Editor = {Holger Giese},
    Month = {June},
    Pages = {33--51},
    Publisher = {Springer},
    Series = {Lecture Notes in Computer Science},
    Volume = {6150},
    Abstract = {Software designs equipped with specification of dependability techniques can help engineers to develop critical systems. In this work, we start to envision how a software engineer can assess that a given dependability technique is adequate for a given software design, i.e., if the technique, when applied, will cause the system to meet a dependability requirement (e.g., an availability degree). So, the idea here presented is how to integrate already developed fault-tolerant techniques in software designs for their analysis. On the one hand, we will assume software behavioural designs as a set of UML state-charts properly annotated with profiles to take into account its performance, dependability and security characteristics, i.e., those properties that may hamper a critical system. On the other hand, we will propose UML models for well-known fault-tolerant techniques. Then, the challenge is how to combine both (the software design and the FT techniques) to assist the software engineer. We will propose to accomplish it through a formal model, in terms of Petri nets, that offers results early in the life-cycle.},
    Doi = {10.1007/978-3-642-13556-9_3},
    ISBN = {978-3-642-13555-2},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RM-ISARCS-10.pdf}
    }
  • [DOI] R. J. Rodríguez, J. Merseguer, and S. Bernardi, “Modelling and Analysing Resilience as a Security Issue within UML,” in Proceedings of the 2nd International Workshop on Software Engineering for Resilient Systems (SERENE), London, United Kingdom, 2010, pp. 42-51.
    [Bibtex]
    @InProceedings{Rodriguez2010a,
    Title = {{Modelling and Analysing Resilience as a Security Issue within UML}},
    Author = {Ricardo J. Rodr\'{i}guez and Jos\'{e} Merseguer and Simona Bernardi},
    Booktitle = {Proceedings of the 2nd International Workshop on Software Engineering for Resilient Systems (SERENE)},
    Year = {2010},
    Address = {London, United Kingdom},
    Month = {April},
    Pages = {42--51},
    Publisher = {ACM},
    Abstract = {Modelling system security is not common practise in software projects yet. Among other problems, there is not a widely accepted methodology which unifies the actual heterogeneity of security issues when addressing a whole security specification. Certainly, the reality is even worse since there is not an accepted or standard common notation for carrying out the security specification. In this work, we study how modelling security issues, specifically resilience, could be integrated in the MARTE-DAM framework, which allows the expression of performance and dependability requirements in UML models. We base this claim on the close relationship between security and dependability. Indeed, MARTE proposes a framework for non-functional properties specification (NFP), while DAM exploits it for dependability purposes. So, our goal is to take advantage of the common NFP framework while the dependability and security concerns are modelled in a unified view. On the other hand, we consider that the resulting security specification will be useful for developing model in which security related properties, such as availability, will be analysed. We will clarify these claims by means of an example.},
    Doi = {10.1145/2401736.2401741},
    Url = {http://webdiis.unizar.es/~ricardo/files/papers/RMB-SERENE-10.pdf}
    }
  • [DOI] R. Tolosana-Calasanz, J. A. Bañares, O. F. Rana, P. Álvarez, J. Ezpeleta, and A. Hoheisel, “Adaptive exception handling for scientific workflows,” Concurrency and Computation: Practice and Experience, vol. 22, iss. 5, pp. 617-642, 2010.
    [Bibtex]
    @Article{Tolosana-Calasanz2010,
    Title = {Adaptive exception handling for scientific workflows},
    Author = {Tolosana-Calasanz, Rafael and Ba\~{n}ares, Jos\'{e} A. and Rana, Omer F. and \'{A}lvarez, Pedro and Ezpeleta, Joaqu\'{i}n and Hoheisel, Andreas},
    Journal = {Concurrency and Computation: Practice and Experience},
    Year = {2010},
    Number = {5},
    Pages = {617--642},
    Volume = {22},
    __markedentry = {[jcampos:]},
    Doi = {10.1002/cpe.1487},
    ISSN = {1532-0634},
    Keywords = {scientific workflows, exception handling, Petri nets},
    Publisher = {John Wiley \& Sons, Ltd.},
    Url = {http://dx.doi.org/10.1002/cpe.1487}
    }
  • [DOI] R. Tolosana-Calasanz, J. A. Bañares, P. Álvarez, J. Ezpeleta, and O. Rana, “An uncoordinated asynchronous checkpointing model for hierarchical scientific workflows,” Journal of Computer and System Sciences, vol. 76, iss. 6, pp. 403-415, 2010.
    [Bibtex]
    @Article{Tolosana-Calasanz2010a,
    Title = {An uncoordinated asynchronous checkpointing model for hierarchical scientific workflows},
    Author = {Rafael Tolosana-Calasanz and Jos\'{e} A. Bañares and Pedro \'{A}lvarez and Joaqu\'{i}n Ezpeleta and Omer Rana},
    Journal = {Journal of Computer and System Sciences},
    Year = {2010},
    Note = {Special Issue: Scientific Workflow 2009},
    Number = {6},
    Pages = {403 - 415},
    Volume = {76},
    __markedentry = {[jcampos:]},
    Doi = {http://dx.doi.org/10.1016/j.jcss.2009.11.003},
    ISSN = {0022-0000},
    Keywords = {Checkpointing, Rollback recovery, Petri nets, Reference nets, Scientific workflows},
    Url = {http://www.sciencedirect.com/science/article/pii/S0022000009001196}
    }

2009

  • L. Berardinelli, S. Bernardi, Vittorio Cortellessa, and J. Merseguer, “UML Profiles for Non-functional Properties at Work: Analyzing Reliability, Availability and Performance,” in Proceedings of the 2nd International Workshop on Non-functional System Properties in Domain Specific Modeling Languages (NFPinDSML2009), 2009.
    [Bibtex]
    @InProceedings{Berardinelli2009,
    Title = {UML Profiles for Non-functional Properties at Work: Analyzing Reliability, Availability and Performance},
    Author = {Luca Berardinelli and Simona Bernardi and Vittorio Cortellessa, and Jose Merseguer},
    Booktitle = {Proceedings of the 2nd International Workshop on Non-functional System Properties in Domain Specific Modeling Languages {(NFPinDSML2009)}},
    Year = {2009},
    Publisher = {CEUR},
    Volume = {553},
    Editors = {M. Boskovic and D. Gasevic and C. Pahl and B. Schatz},
    ISSN = {1613-0073},
    Location = {Denver, Colorado, USA}
    }
  • [DOI] S. Bernardi and J. Campos, “Computation of Performance Bounds for Real-Time Systems Using Time Petri Nets,” IEEE Transactions on Industrial Informatics, vol. 5, iss. 2, pp. 168-180, 2009.
    [Bibtex]
    @Article{BC-TII-09,
    Title = {Computation of Performance Bounds for Real-Time Systems Using Time {Petri} Nets},
    Author = {S. Bernardi and J. Campos},
    Journal = {IEEE Transactions on Industrial Informatics},
    Year = {2009},
    Month = {May},
    Number = {2},
    Pages = {168-180},
    Volume = {5},
    Abstract = {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.},
    Doi = {10.1109/TII.2009.2017201},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/bc-tii-09.pdf}
    }
  • M. J. Ibáñez, P. Álvarez, S. Bhiri, and J. Ezpeleta, “RDF-Annotated Petri Nets: A Formalism for the Validation and Analysis of Processes with Semantic Information,” in Procedings of the ACM 4th International Workshop on Semantic Business Process Management (SBPM 2009), Crete, Greece, June 1, 2009, 2009, pp. 1-4.
    [Bibtex]
    @InProceedings{Ibanez2009,
    Title = {{RDF}-{A}nnotated {P}etri {N}ets: {A} {F}ormalism for the {V}alidation and {A}nalysis of {P}rocesses with {S}emantic {I}nformation},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Pedro \'Alvarez and Sami Bhiri and Joaqu\'in Ezpeleta},
    Booktitle = {Procedings of the ACM 4th International Workshop on Semantic Business Process Management (SBPM 2009), Crete, Greece, June 1, 2009},
    Year = {2009},
    Pages = {1-4}
    }
  • M. J. Ibáñez, P. Álvarez, and J. Ezpeleta, “RDF Model Checking: A Technique to Verify Behavioral Properties in Semantically Annotated Business Processes,” in Procedings of the Third IEEE International Conference on Semantic Computing (ICSC 2009), Berkeley, CA, USA, September 14-16, 2009, 2009, pp. 245-252.
    [Bibtex]
    @InProceedings{Ibanez2009a,
    Title = {{RDF} {M}odel {C}hecking: {A} {T}echnique to {V}erify {B}ehavioral {P}roperties in {S}emantically {A}nnotated {B}usiness {P}rocesses},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Pedro \'Alvarez and Joaqu\'in Ezpeleta},
    Booktitle = {Procedings of the Third IEEE International Conference on Semantic Computing (ICSC 2009), Berkeley, CA, USA, September 14-16, 2009},
    Year = {2009},
    Pages = {245-252},
    Publisher = {IEEE Computer Society}
    }
  • M. J. Ibáñez, P. Álvarez, and J. Ezpeleta, “Symbolic Analysis of the Behavior of Semantic Business Processes,” in Procedings of the 2009 International Conference on Semantic Web and Web Services (SWWS 2009), Las Vegas, Nevada, USA, July 13-16, 2009, 2009, pp. 213-219.
    [Bibtex]
    @InProceedings{Ibanez2009b,
    Title = {Symbolic {A}nalysis of the {B}ehavior of {S}emantic {B}usiness {P}rocesses},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Pedro \'Alvarez and Joaqu\'in Ezpeleta},
    Booktitle = {Procedings of the 2009 International Conference on Semantic Web and Web Services (SWWS 2009), Las Vegas, Nevada, USA, July 13-16, 2009},
    Year = {2009},
    Pages = {213-219},
    Publisher = {CSREA Press}
    }
  • M. J. Ibáñez, J. Ezpeleta, and S. Bhiri, “Discovery of Business Processes based on Behavioral Descriptions,” in Procedings of the 2009 International Conference on Semantic Web and Web Services (SWWS 2009), Las Vegas, Nevada, USA, July 13-16, 2009, 2009, pp. 190-196.
    [Bibtex]
    @InProceedings{Ibanez2009c,
    Title = {Discovery of {B}usiness {P}rocesses based on {B}ehavioral {D}escriptions},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Joaqu\'in Ezpeleta and Sami Bhiri},
    Booktitle = {Procedings of the 2009 International Conference on Semantic Web and Web Services (SWWS 2009), Las Vegas, Nevada, USA, July 13-16, 2009},
    Year = {2009},
    Pages = {190-196}
    }
  • M. J. Ibáñez, P. Álvarez, and J. Ezpeleta, “Predicción simbólica del comportamiento en ejecución de los procesos de negocio semánticos,” in V Jornadas científico-técnicas en Servicios Web y SOA (JSWEB’09), 2009, pp. 183-196.
    [Bibtex]
    @InProceedings{Ibanez2009g,
    Title = {Predicci\'on simb\'olica del comportamiento en ejecuci\'on de los procesos de negocio sem\'anticos},
    Author = {M. J. Ib\'añez and Pedro {\'{A}}lvarez and Joaquin Ezpeleta},
    Booktitle = {V Jornadas científico-técnicas en Servicios Web y SOA (JSWEB’09)},
    Year = {2009},
    Pages = {183-196},
    __markedentry = {[jcampos:]}
    }
  • [DOI] E. P. Naumovich and S. Bernardi, “Integrating TPNs and Performance Bound Techniques in ITPN-PerfBound: A New Import Functionality,” in QEST 2009, Sixth International Conference on the Quantitative Evaluation of Systems, Budapest, Hungary, 13-16 September 2009, 2009, pp. 285-286.
    [Bibtex]
    @InProceedings{Naumovich2009a,
    Title = {{Integrating TPNs and Performance Bound Techniques in ITPN-PerfBound: {A} New Import Functionality}},
    Author = {Elina Pacini Naumovich and Simona Bernardi},
    Booktitle = {{QEST} 2009, Sixth International Conference on the Quantitative Evaluation of Systems, Budapest, Hungary, 13-16 September 2009},
    Year = {2009},
    Pages = {285--286},
    Doi = {10.1109/QEST.2009.39}
    }
  • [DOI] E. P. Naumovich, S. Bernardi, and M. Gribaudo, “ITPN-PerfBound: A Performance Bound Tool for Interval Time Petri Nets,” in Tools and Algorithms for the Construction and Analysis of Systems, 15th International Conference, TACAS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, 2009, pp. 50-53.
    [Bibtex]
    @InProceedings{Naumovich2009b,
    Title = {{ITPN-PerfBound: {A} Performance Bound Tool for Interval Time Petri Nets}},
    Author = {Elina Pacini Naumovich and Simona Bernardi and Marco Gribaudo},
    Booktitle = {Tools and Algorithms for the Construction and Analysis of Systems, 15th International Conference, {TACAS} 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2009, York, UK, March 22-29, 2009. Proceedings},
    Year = {2009},
    Pages = {50--53},
    Doi = {10.1007/978-3-642-00768-2_5}
    }
  • E. P. Naumovich, S. Bernardi, and M. Gribaudo, The ITPN-PerfBound tool, 2009.
    [Bibtex]
    @Unpublished{Naumovich2009,
    Title = {The {ITPN-PerfBound} tool},
    Author = {Elina Pacini Naumovich and Simona Bernardi and Marco Gribaudo},
    Note = {\url{https://sites.google.com/site/itpnperfbound/}},
    Year = {2009}
    }
  • [DOI] D. Pérez-Palacin and J. Merseguer, “Performance evaluation of self-reconfigurable service-oriented software with stochastic Petri nets,” in Proceedings of the Fourth International Workshop on Practical Applications of Stochastic Modelling (PASM’09), Electronic Notes in Theoretical Computer Science (2010), 2009, pp. 181-201.
    [Bibtex]
    @InProceedings{Perez-Palacin2009,
    Title = {Performance evaluation of self-reconfigurable service-oriented software with stochastic Petri nets},
    Author = {D. P{\'e}rez-Palacin and J. Merseguer},
    Booktitle = {Proceedings of the Fourth International Workshop on Practical Applications of Stochastic Modelling {(PASM'09)}, Electronic Notes in Theoretical Computer Science (2010)},
    Year = {2009},
    Pages = {181-201},
    Doi = {DOI10.1016/j.entcs.2010.01.012}
    }
  • Proceedings of the 14th IEEE International Conference on Emerging Technologies and Factory Automation, A. Grau, J. Campos, and G. Oliver, Eds., Palma de Mallorca, Spain: IEEE Industrial Electronics Society, 2009. [Publisher URL]
    [Bibtex]
    @Book{ETFA-09,
    Title = {Proceedings of the 14th IEEE International Conference on Emerging Technologies and Factory Automation},
    Editor = {Antoni Grau and Javier Campos and Gabriel Oliver},
    Publisher = {IEEE Industrial Electronics Society},
    Year = {2009},
    Address = {Palma de Mallorca, Spain},
    Month = {September},
    Url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5340902}
    }

2008

  • [DOI] J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “Runtime Protocol Binding: Flexible Service Integration by Means of Flexible Service Interactions,” in 2008 IEEE International Conference on Services Computing (SCC 2008), 8-11 July 2008, Honolulu, Hawaii, USA, 2008, pp. 291-298.
    [Bibtex]
    @InProceedings{Fabra2008,
    Title = {Runtime Protocol Binding: Flexible Service Integration by Means of Flexible Service Interactions},
    Author = {Javier Fabra and Pedro {\'{A}}lvarez and Jos{\'{e}} A. Ba{\~{n}}ares and Joaquin Ezpeleta},
    Booktitle = {2008 {IEEE} International Conference on Services Computing {(SCC} 2008), 8-11 July 2008, Honolulu, Hawaii, {USA}},
    Year = {2008},
    Pages = {291--298},
    Crossref = {DBLP:conf/IEEEscc/2008},
    Doi = {10.1109/SCC.2008.119},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1109/SCC.2008.119}
    }
  • [DOI] J. Fabra, J. Peña, A. R. Cortés, and J. Ezpeleta, “Enabling the Evolution of Service-Oriented Solutions Using an UML2 Profile and a Reference Petri Nets Execution Platform,” in Third International Conference on Internet and Web Applications and Services, ICIW 2008, 8-13 June 2008, Athens, Greece, 2008, pp. 198-204.
    [Bibtex]
    @InProceedings{Fabra2008b,
    Title = {Enabling the Evolution of Service-Oriented Solutions Using an {UML2} Profile and a Reference Petri Nets Execution Platform},
    Author = {Javier Fabra and Joaqu{\'{\i}}n Pe{\~{n}}a and Antonio Ruiz Cort{\'{e}}s and Joaquin Ezpeleta},
    Booktitle = {Third International Conference on Internet and Web Applications and Services, {ICIW} 2008, 8-13 June 2008, Athens, Greece},
    Year = {2008},
    Pages = {198--204},
    Crossref = {DBLP:conf/iciw/2008},
    Doi = {10.1109/ICIW.2008.63},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {https://doi.org/10.1109/ICIW.2008.63}
    }
  • [DOI] S. Bernardi, J. Merseguer, and D. C. Petriu, “Adding Dependability Analysis Capabilities to the MARTE Profile,” in MoDELS ’08: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems, Berlin, Heidelberg, 2008, pp. 736-750.
    [Bibtex]
    @InProceedings{Bernardi2008,
    Title = {Adding Dependability Analysis Capabilities to the MARTE Profile},
    Author = {Bernardi, Simona and Merseguer, Jos\'{e} and Petriu, Dorina C.},
    Booktitle = {MoDELS '08: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems},
    Year = {2008},
    Address = {Berlin, Heidelberg},
    Pages = {736--750},
    Publisher = {Springer-Verlag},
    Doi = {http://dx.doi.org/10.1007/978-3-540-87875-9_51},
    ISBN = {978-3-540-87874-2},
    Location = {Toulouse, France}
    }
  • C. Bobed, R. Trillo-Lado, E. Mena, and J. Bernad, “Semantic Discovery of the User Intended Query in a Selectable Target Query Language,” in Web Intelligence, 2008, pp. 579-582.
    [Bibtex]
    @InProceedings{Bobed2008,
    Title = {Semantic Discovery of the User Intended Query in a Selectable Target
    Query Language},
    Author = {Carlos Bobed and
    Raquel Trillo-Lado and
    Eduardo Mena and
    Jordi Bernad},
    Booktitle = {Web Intelligence},
    Year = {2008},
    Pages = {579--582},
    Publisher = {{IEEE} Computer Society},
    __markedentry = {[jcampos:6]}
    }
  • J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “Integración en DENEB de componentes para la conectividad dinámica de los procesos Web. Aplicación a escenarios de gestión de emergencias basados en Sensor Web,” in IV Jornadas Científico Técnicas en Servicios Web y SOA (JSWEB 2008), 2008, pp. 42-55.
    [Bibtex]
    @InProceedings{Fabra2008e,
    Title = {Integraci\'on en DENEB de componentes para la conectividad din\'amica de los procesos Web. Aplicaci\'on a escenarios de gesti\'on de emergencias basados en Sensor Web},
    Author = {Javier Fabra and Pedro {\'{A}}lvarez and Jos{\'{e}} A. Ba{\~{n}}ares and Joaquin Ezpeleta},
    Booktitle = {IV Jornadas Científico Técnicas en Servicios Web y SOA (JSWEB 2008)},
    Year = {2008},
    Pages = {42-55},
    __markedentry = {[jcampos:]}
    }
  • J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “Run Time Protocol Binding: Flexible Service Integration by Means of Flexible Service Interactions,” in Procesings of the 2008 IEEE International Conference on Services Computing (SCC 2008), Honolulu, Hawaii, USA, July 8-11, 2008, 2008, pp. 291-298.
    [Bibtex]
    @InProceedings{Fabra2008a,
    Title = {Run {T}ime {P}rotocol {B}inding: {F}lexible {S}ervice {I}ntegration by {M}eans of {F}lexible {S}ervice {I}nteractions},
    Author = {Javier Fabra and Pedro \'Alvarez and Jose Angel {Ba\~{n}ares} and Joaqu\'in Ezpeleta},
    Booktitle = {Procesings of the 2008 IEEE International Conference on Services Computing (SCC 2008), Honolulu, Hawaii, USA, July 8-11, 2008},
    Year = {2008},
    Pages = {291-298}
    }
  • J. Fabra, P. Álvarez, and J. Ezpeleta, “Development of Configurable e-Marketplaces Based on a Flexible Management of e-Negotiation Protocols,” in IADIS Multi Conference on Compueter Science and Information Systems (IADIS e-Commerce 2008), 2008, pp. 3-10.
    [Bibtex]
    @InProceedings{Fabra2008d,
    Title = {Development of Configurable e-Marketplaces Based on a Flexible Management of e-Negotiation Protocols},
    Author = {J. Fabra and P. \'Alvarez and J. Ezpeleta},
    Booktitle = {IADIS Multi Conference on Compueter Science and Information Systems (IADIS e-Commerce 2008)},
    Year = {2008},
    Pages = {3-10},
    __markedentry = {[jcampos:]}
    }
  • M. J. Ibáñez, P. Álvarez, and J. Ezpeleta, “Checking Necessary Conditions for Control and Data Flow Compatibility between Business and Interaction Logics in Web Processes,” in Procedings of the 6th IEEE European Conference on Web Services (ECOWS 2008), November 12-14, 2008, Dublin, Ireland, 2008, pp. 92-101.
    [Bibtex]
    @InProceedings{Ibanez2008a,
    Title = {Checking {N}ecessary {C}onditions for {C}ontrol and {D}ata {F}low {C}ompatibility between {B}usiness and {I}nteraction {L}ogics in {W}eb {P}rocesses},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Pedro \'Alvarez and Joaqu\'in Ezpeleta},
    Booktitle = {Procedings of the 6th IEEE European Conference on Web Services (ECOWS 2008), November 12-14, 2008, Dublin, Ireland},
    Year = {2008},
    Pages = {92-101}
    }
  • M. J. Ibáñez, P. Álvarez, and J. Ezpeleta, “Flow and Data Compatibility for the Correct Interaction among Web Processes,” in Procedings of the International Conference on Intelligent Agents, Web Technologies and Internet Commerce (IAWTIC 2008), Vienna, Austria, December 10-12, 2008, 2008, pp. 716-722.
    [Bibtex]
    @InProceedings{Ibanez2008,
    Title = {Flow and {D}ata {C}ompatibility for the {C}orrect {I}nteraction among {W}eb {P}rocesses},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Pedro \'Alvarez and Joaqu\'in Ezpeleta},
    Booktitle = {Procedings of the International Conference on Intelligent Agents, Web Technologies and Internet Commerce (IAWTIC 2008), Vienna, Austria, December 10-12, 2008},
    Year = {2008},
    Pages = {716-722}
    }
  • M. J. Ibáñez, P. Álvarez, and J. Ezpeleta, “Structural Compatibility between Business Logic and Interaction Roles of Web Processes,” , María de Luna 3, e-50015 Zaragoza (España), 2008, p. 8.
    [Bibtex]
    @InProceedings{Ibanez2008b,
    Title = {Structural {C}ompatibility between {B}usiness {L}ogic and {I}nteraction {R}oles of {W}eb {P}rocesses},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Pedro \'Alvarez and Joaqu\'in Ezpeleta},
    Year = {2008},
    Address = {Mar\'{\i}a de Luna 3, e-50015 Zaragoza (Espa\~na)},
    Month = {March},
    Pages = {8},
    Institution = {Department of Computer Science and System Engineering, Zaragoza University},
    Keywords = {Web process, Web service, soc, soa, workflow, interaction protocol, deneb, compatibility, replaceability}
    }
  • M. J. Ibáñez, P. Álvarez, and J. Ezpeleta, “Syntactic Compatibility and Replaceability in DENEB-based Processes,” Department of Computer Science and System Engineering, Zaragoza University, María de Luna 3, e-50015 Zaragoza (España), RR-08-02, 2008.
    [Bibtex]
    @TechReport{Ibanez2008c,
    Title = {Syntactic {C}ompatibility and {R}eplaceability in {DENEB}-based {P}rocesses},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Pedro \'Alvarez and Joaqu\'in Ezpeleta},
    Institution = {Department of Computer Science and System Engineering, Zaragoza University},
    Year = {2008},
    Address = {Mar\'{\i}a de Luna 3, e-50015 Zaragoza (Espa\~na)},
    Month = {March},
    Number = {RR-08-02},
    Keywords = {Web process, Web service, soc, soa, workflow, interaction protocol, deneb, compatibility, replaceability},
    Pages = {40}
    }
  • M. J. Ibáñez, P. Álvarez, and J. Ezpeleta, “Syntactic Compatibility and Replaceability in DENEB-based Processes,” Department of Computer Science and System Engineering, Zaragoza University, María de Luna 3, e-50015 Zaragoza (España), RR-08-02, 2008.
    [Bibtex]
    @TechReport{Ibanez2008d,
    Title = {Syntactic {C}ompatibility and {R}eplaceability in {DENEB}-based {P}rocesses},
    Author = {Mar\'ia Jos\'e {Ib\'a\~{n}ez} and Pedro \'Alvarez and Joaqu\'in Ezpeleta},
    Institution = {Department of Computer Science and System Engineering, Zaragoza University},
    Year = {2008},
    Address = {Mar\'{\i}a de Luna 3, e-50015 Zaragoza (Espa\~na)},
    Month = {March},
    Number = {RR-08-02},
    Keywords = {Web process, Web service, soc, soa, workflow, interaction protocol, deneb, compatibility, replaceability},
    Pages = {40}
    }
  • R. Tolosana, J. A. Bañares, P. Álvarez, and J. Ezpeleta, “On Interlinking of Grids: a Proposal for Improving the Flexibility of Grid Service Interactions,” in III International Conference on Internet and Web Applications and Services (ICIW 2008), 2008, pp. 714-720.
    [Bibtex]
    @InProceedings{Tolosana2008,
    Title = {On Interlinking of Grids: a Proposal for Improving the Flexibility of Grid Service Interactions},
    Author = {R. Tolosana and J.A. Ba\~{n}ares and P. \'Alvarez and J. Ezpeleta},
    Booktitle = {III International Conference on Internet and Web Applications and Services (ICIW 2008)},
    Year = {2008},
    Pages = {714-720},
    __markedentry = {[jcampos:]}
    }

2007

  • [DOI] J. Fabra, P. Álvarez, and J. Ezpeleta, “DRLinda: A Distributed Message Broker for Collaborative Interactions Among Business Processes,” in E-Commerce and Web Technologies, 8th International Conference, EC-Web 2007, Regensburg, Germany, September 3-7, 2007, Proceedings, 2007, pp. 212-221.
    [Bibtex]
    @InProceedings{Fabra2007,
    Title = {DRLinda: {A} Distributed Message Broker for Collaborative Interactions Among Business Processes},
    Author = {Javier Fabra and Pedro {\'{A}}lvarez and Joaquin Ezpeleta},
    Booktitle = {E-Commerce and Web Technologies, 8th International Conference, EC-Web 2007, Regensburg, Germany, September 3-7, 2007, Proceedings},
    Year = {2007},
    Pages = {212--221},
    Crossref = {DBLP:conf/ecweb/2007},
    Doi = {10.1007/978-3-540-74563-1_21},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1007/978-3-540-74563-1_21}
    }
  • J. Fabra, P. Álvarez, and J. Ezpeleta, “DRLinda: A Distributed Message Broker for Collaborative Interactions Among Business Processes,” in EC-Web, 2007, pp. 212-221.
    [Bibtex]
    @InProceedings{Fabra2007a,
    Title = {{DRL}inda: {A} {D}istributed {M}essage {B}roker for {C}ollaborative {I}nteractions {A}mong {B}usiness {P}rocesses},
    Author = {Javier Fabra and Pedro \'Alvarez and Joaqu\'in Ezpeleta},
    Booktitle = {EC-Web},
    Year = {2007},
    Pages = {212-221},
    Bibsource = {DBLP, http://dblp.uni-trier.de},
    Crossref = {DBLP:conf/ecWeb/2007},
    Ee = {http://dx.doi.org/10.1007/978-3-540-74563-1_21}
    }
  • [DOI] S. Bernardi and J. Merseguer, “A UML Profile for Dependability Analysis of Real–Time Embedded Systems,” in Sixth International Workshop on Software and Performance (WOSP 2007), 2007, pp. 115-124.
    [Bibtex]
    @InProceedings{Bernardi2007,
    Title = {A UML Profile for Dependability Analysis of Real--Time Embedded Systems},
    Author = {S. Bernardi and J. Merseguer},
    Booktitle = {Sixth International Workshop on Software and Performance (WOSP 2007)},
    Year = {2007},
    Month = {February},
    Pages = {115--124},
    Publisher = {ACM},
    Comment = {References: 2008: SR-TII-08 },
    Doi = {10.1145/1216993.1217012}
    }
  • [DOI] S. Bernardi and J. Merseguer, “Performance evaluation of UML design with Stochastic Well–formed Nets,” Journal of Systems and Software, vol. 80, iss. 11, pp. 1843-1865, 2007.
    [Bibtex]
    @Article{Bernardi2007a,
    Title = {Performance evaluation of UML design with Stochastic Well--formed Nets},
    Author = {S. Bernardi and J. Merseguer},
    Journal = {Journal of Systems and Software},
    Year = {2007},
    Number = {11},
    Pages = {1843-1865},
    Volume = {80},
    Doi = {10.1016/j.jss.2007.02.029},
    Publisher = {Elsevier Science}
    }
  • J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “DENEB: una plataforma para el desarrollo y ejecución de procesos Web dinámicos,” in III Jornadas Científico Técnicas en Servicios Web y SOA (JSWEB 2007), 2007, pp. 11-18.
    [Bibtex]
    @InProceedings{Fabra2007c,
    Title = {DENEB: una plataforma para el desarrollo y ejecuci\'on de procesos Web din\'amicos},
    Author = {Javier Fabra and Pedro {\'{A}}lvarez and Jos{\'{e}} A. Ba{\~{n}}ares and Joaquin Ezpeleta},
    Booktitle = {III Jornadas Científico Técnicas en Servicios Web y SOA (JSWEB 2007)},
    Year = {2007},
    Pages = {11-18},
    __markedentry = {[jcampos:]}
    }
  • [DOI] J. Fabra, P. Álvarez, and J. Ezpeleta, “DRLinda: A Distributed Message Broker for Collaborative Interactions Among Business Processes” in E-Commerce and Web Technologies: 8th International Conference, EC-Web 2007, Regensburg, Germany, September 3-7, 2007. Proceedings, G. Psaila and R. Wagner, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 212-221.
    [Bibtex]
    @InBook{Fabra2007b,
    Title = {DRLinda: A Distributed Message Broker for Collaborative Interactions Among Business Processes},
    Author = {Fabra, J. and {\'A}lvarez, P. and Ezpeleta, J.},
    Editor = {Psaila, Giuseppe and Wagner, Roland},
    Pages = {212--221},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2007},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {E-Commerce and Web Technologies: 8th International Conference, EC-Web 2007, Regensburg, Germany, September 3-7, 2007. Proceedings},
    Doi = {10.1007/978-3-540-74563-1_21},
    ISBN = {978-3-540-74563-1},
    Url = {http://dx.doi.org/10.1007/978-3-540-74563-1_21}
    }
  • [DOI] E. Gómez–Martínez, S. Ilarri, and J. Merseguer, “Performance Analysis of Mobile Agents Tracking,” in Sixth International Workshop on Software and Performance (WOSP 2007), 2007, pp. 181-188.
    [Bibtex]
    @InProceedings{Gomez-Martinez2007,
    Title = {Performance Analysis of Mobile Agents Tracking},
    Author = {E. G\'{o}mez--Mart\'{i}nez and S. Ilarri and J. Merseguer},
    Booktitle = {Sixth International Workshop on Software and Performance (WOSP 2007)},
    Year = {2007},
    Month = {February},
    Pages = {181--188},
    Publisher = {ACM},
    Comment = {References: 2008:FC-JSA08, WXL-ATC08},
    Doi = {10.1145/1216993.1217024}
    }
  • S. Ilarri, J. L. Serrano, E. Mena, and R. Trillo-Lado, “3D Monitoring of Distributed Multiagent Systems,” in WEBIST (1), 2007, pp. 439-442.
    [Bibtex]
    @InProceedings{Ilarri2007,
    Title = {3D Monitoring of Distributed Multiagent Systems},
    Author = {Sergio Ilarri and
    Juan L. Serrano and
    Eduardo Mena and
    Raquel Trillo-Lado},
    Booktitle = {{WEBIST} {(1)}},
    Year = {2007},
    Pages = {439--442},
    Publisher = {{INSTICC} Press},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] E. J. Mata, P. Álvarez, J. A. Bañares, and J. Rubio, “Formal Modelling of a Coordination System: From Practice to Theory, and Back Again” in Engineering Societies in the Agents World VII: 7th International Workshop, ESAW 2006 Dublin, Ireland, September 6-8, 2006 Revised Selected and Invited Papers, G. M. P. O’Hare, A. Ricci, M. J. O’Grady, and O. Dikenelli, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 229-244.
    [Bibtex]
    @InBook{Mata2007,
    Title = {Formal Modelling of a Coordination System: From Practice to Theory, and Back Again},
    Author = {Mata, Eloy J. and {\'A}lvarez, Pedro and Ba{\~{n}}ares, Jos{\'e} A. and Rubio, Julio},
    Editor = {O'Hare, Gregory M. P. and Ricci, Alessandro and O'Grady, Michael J. and Dikenelli, O{\u{g}}uz},
    Pages = {229--244},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2007},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {Engineering Societies in the Agents World VII: 7th International Workshop, ESAW 2006 Dublin, Ireland, September 6-8, 2006 Revised Selected and Invited Papers},
    Doi = {10.1007/978-3-540-75524-1_13},
    ISBN = {978-3-540-75524-1},
    Url = {http://dx.doi.org/10.1007/978-3-540-75524-1_13}
    }
  • [DOI] E. J. Mata, P. Álvarez, J. A. Bañares, and J. Rubio, “Formal Reasoning on a Web Coordination System” in Computer Aided Systems Theory — EUROCAST 2007: 11th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 12-16, 2007, Revised Selected Papers, R. Moreno Díaz, F. Pichler, and A. Quesada Arencibia, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 329-336.
    [Bibtex]
    @InBook{Mata2007a,
    Title = {Formal Reasoning on a Web Coordination System},
    Author = {Mata, Eloy J. and {\'A}lvarez, Pedro and Ba{\~{n}}ares, Jos{\'e} A. and Rubio, Julio},
    Editor = {Moreno D{\'i}az, Roberto and Pichler, Franz and Quesada Arencibia, Alexis},
    Pages = {329--336},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2007},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {Computer Aided Systems Theory -- EUROCAST 2007: 11th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 12-16, 2007, Revised Selected Papers},
    Doi = {10.1007/978-3-540-75867-9_42},
    ISBN = {978-3-540-75867-9},
    Url = {http://dx.doi.org/10.1007/978-3-540-75867-9_42}
    }
  • [DOI] C. J. Pérez-Jiménez, J. Campos, and M. Silva, “Approximate Throughput Computation of Stochastic Weighted T-Systems,” IEEE Transactions on Systems, Man, and Cybernetics. Part A: Systems and Humans, vol. 37, iss. 3, pp. 431-444, 2007.
    [Bibtex]
    @Article{PJCS-TSMC-07,
    Title = {Approximate Throughput Computation of Stochastic Weighted {T}-Systems},
    Author = {C.J. P{\'e}rez-Jim{\'e}nez and J. Campos and M. Silva},
    Journal = {IEEE Transactions on Systems, Man, and Cybernetics. Part A: Systems and Humans},
    Year = {2007},
    Month = {May},
    Number = {3},
    Pages = {431-444},
    Volume = {37},
    Abstract = {A general iterative technique for approximate throughput computation of stochastic live and bounded weighted T-systems is presented. It generalizes a previous technique on stochastic marked graphs. The approach has two basic foundations. First, a deep understanding of the qualitative behaviour of weighted T-systems leads to a general decomposition technique. Second, after the decomposition phase, an iterative response time approximation method is applied for the throughput computation. Existence of convergence points for the iterative approximation method can be proved. Experimental results generally have an error of less than 5%. The state space is usually reduced by more than one order of magnitude; therefore, the analysis of otherwise intractable systems is possible.},
    Doi = {10.1109/TSMCA.2007.893455},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pjcs-tsmc-07.pdf}
    }
  • [DOI] R. Tolosana-Calasanz, J. A. Bañares, P. Álvarez, and J. Ezpeleta, “Vega: A Service-Oriented Grid Workflow Management System” in On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS: OTM Confederated International Conferences CoopIS, DOA, ODBASE, GADA, and IS 2007, Vilamoura, Portugal, November 25-30, 2007, Proceedings, Part II, R. Meersman and Z. Tari, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 1516-1523.
    [Bibtex]
    @InBook{Tolosana-Calasanz2007,
    Title = {Vega: A Service-Oriented Grid Workflow Management System},
    Author = {Tolosana-Calasanz, R. and Ba{\~{n}}ares, J. A. and {\'A}lvarez, P. and Ezpeleta, J.},
    Editor = {Meersman, Robert and Tari, Zahir},
    Pages = {1516--1523},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2007},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS: OTM Confederated International Conferences CoopIS, DOA, ODBASE, GADA, and IS 2007, Vilamoura, Portugal, November 25-30, 2007, Proceedings, Part II},
    Doi = {10.1007/978-3-540-76843-2_27},
    ISBN = {978-3-540-76843-2},
    Url = {http://dx.doi.org/10.1007/978-3-540-76843-2_27}
    }
  • R. Trillo-Lado, J. Gracia, M. Espinoza, and E. Mena, “Discovering the Semantics of User Keywords,” J. UCS, vol. 13, iss. 12, pp. 1908-1935, 2007.
    [Bibtex]
    @Article{Trillo-Lado2007a,
    Title = {Discovering the Semantics of User Keywords},
    Author = {Raquel Trillo-Lado and
    Jorge Gracia and
    Mauricio Espinoza and
    Eduardo Mena},
    Journal = {J. {UCS}},
    Year = {2007},
    Number = {12},
    Pages = {1908--1935},
    Volume = {13},
    __markedentry = {[jcampos:6]}
    }
  • R. Trillo-Lado, S. Ilarri, J. López, and N. R. Brisaboa, “Development of an On-line Assessment System to Track the Performance of Students,” in WEBIST (3), 2007, pp. 452-457.
    [Bibtex]
    @InProceedings{Trillo-Lado2007,
    Title = {Development of an On-line Assessment System to Track the Performance
    of Students},
    Author = {Raquel Trillo-Lado and
    Sergio Ilarri and
    Juan-Ram{\'{o}}n L{\'{o}}pez and
    Nieves R. Brisaboa},
    Booktitle = {{WEBIST} {(3)}},
    Year = {2007},
    Pages = {452--457},
    Publisher = {{INSTICC} Press},
    __markedentry = {[jcampos:6]}
    }

2006

  • [DOI] J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “A Framework for the Development and Execution of Horizontal Protocols in Open BPM Systems,” in Business Process Management, 4th International Conference, BPM 2006, Vienna, Austria, September 5-7, 2006, Proceedings, 2006, pp. 209-224.
    [Bibtex]
    @InProceedings{Fabra2006a,
    Title = {A Framework for the Development and Execution of Horizontal Protocols in Open {BPM} Systems},
    Author = {Javier Fabra and Pedro {\'{A}}lvarez and Jos{\'{e}} A. Ba{\~{n}}ares and Joaquin Ezpeleta},
    Booktitle = {Business Process Management, 4th International Conference, {BPM} 2006, Vienna, Austria, September 5-7, 2006, Proceedings},
    Year = {2006},
    Pages = {209--224},
    Crossref = {DBLP:conf/bpm/2006},
    Doi = {10.1007/11841760_15},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1007/11841760_15}
    }
  • [DOI] J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “RLinda: A Petri Net Based Implementation of the Linda Coordination Paradigm for Web Services Interactions,” in E-Commerce and Web Technologies, 7th International Conference, EC-Web 2006, Krakow, Poland, September 5-7, 2006, Proceedings, 2006, pp. 183-192.
    [Bibtex]
    @InProceedings{Fabra2006,
    Title = {RLinda: {A} Petri Net Based Implementation of the Linda Coordination Paradigm for Web Services Interactions},
    Author = {Javier Fabra and Pedro {\'{A}}lvarez and Jos{\'{e}} A. Ba{\~{n}}ares and Joaquin Ezpeleta},
    Booktitle = {E-Commerce and Web Technologies, 7th International Conference, EC-Web 2006, Krakow, Poland, September 5-7, 2006, Proceedings},
    Year = {2006},
    Pages = {183--192},
    Crossref = {DBLP:conf/ecweb/2006},
    Doi = {10.1007/11823865_19},
    Owner = {ezpeleta},
    Timestamp = {2017.05.23},
    Url = {http://dx.doi.org/10.1007/11823865_19}
    }
  • J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “A Framework for the Development and Execution of Horizontal Protocols in Open BPM Systems.,” in Business Process Management, 2006, pp. 209-224.
    [Bibtex]
    @InProceedings{Fabra2006c,
    Title = {A Framework for the Development and Execution of Horizontal Protocols in Open BPM Systems.},
    Author = {J. Fabra and Pedro {\'A}lvarez and Jos{\'e} A. Ba{\~n}ares and Joaquin Ezpeleta},
    Booktitle = {Business Process Management},
    Year = {2006},
    Pages = {209-224},
    Bibsource = {DBLP, http://dblp.uni-trier.de},
    Crossref = {DBLP:conf/bpm/2006},
    Ee = {http://dx.doi.org/10.1007/11841760_15},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “RLinda: A Petri Net Based Implementation of the Linda Coordination Paradigm for Web Services Interactions.,” in EC-Web, 2006, pp. 183-192.
    [Bibtex]
    @InProceedings{Fabra2006b,
    Title = {RLinda: A Petri Net Based Implementation of the Linda Coordination Paradigm for Web Services Interactions.},
    Author = {J. Fabra and Pedro {\'A}lvarez and Jos{\'e} A. Ba{\~n}ares and Joaquin Ezpeleta},
    Booktitle = {EC-Web},
    Year = {2006},
    Pages = {183-192},
    Bibsource = {DBLP, http://dblp.uni-trier.de},
    Crossref = {DBLP:conf/ecweb/2006},
    Ee = {http://dx.doi.org/10.1007/11823865_19},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • [DOI] S. Bernardi and J. Merseguer, “QoS Assesment via Stochastics Analysis,” IEEE Internet Computing, vol. 10, iss. 3, pp. 32-42, 2006.
    [Bibtex]
    @Article{Bernardi2006,
    Title = {QoS {A}ssesment via {S}tochastics {A}nalysis},
    Author = {Bernardi, S. and Merseguer, J.},
    Journal = {IEEE Internet Computing},
    Year = {2006},
    Number = {3},
    Pages = {32-42},
    Volume = {10},
    Comment = {References: 2007: YHGL-Asia07},
    Doi = {10.1109/MIC.2006.63}
    }
  • [DOI] J. Campos and J. Merseguer, “On the integration of UML and Petri nets in software development,” Lecture Notes in Computer Science, vol. 4024, pp. 19-36, 2006.
    [Bibtex]
    @Article{CM-LNCS-06,
    Title = {On the integration of {UML} and {Petri} nets in software development},
    Author = {J. Campos and J. Merseguer},
    Journal = {Lecture Notes in Computer Science},
    Year = {2006},
    Note = {Invited paper},
    Pages = {19-36},
    Volume = {4024},
    Abstract = {Software performance engineering deals with the consideration of quantitative analysis of the behaviour of software systems from the early development phases in the life cycle. This paper summarizes in a semiformal and illustrative way our proposal for a suitable software performance engineering process. We try to integrate in a very pragmatic approach the usual object oriented methodology ---supported with UML language and widespread CASE tools--- with a performance modelling formalism, namely stochastic Petri nets. A simple case study is used to describe the whole process. More technical details should be looked up in the cited bibliography.},
    Booktitle = {Petri Nets and Other Models of Concurrency - ICATPN 2006: 27th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, Turku, Finland, June 26-30, 2006},
    Doi = {10.1007/11767589_2},
    Editor = {S. Donatelli and P. S. Thiagarajan},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cm-lncs-06.pdf}
    }
  • M. Espinoza, J. Gracia, R. Trillo-Lado, and E. Mena, “Discovering the Semantics of Keywords: An Ontology-based Approach,” in SWWS, 2006, p. 193.
    [Bibtex]
    @InProceedings{Espinoza2006a,
    Title = {Discovering the Semantics of Keywords: An Ontology-based Approach},
    Author = {Mauricio Espinoza and
    Jorge Gracia and
    Raquel Trillo-Lado and
    Eduardo Mena},
    Booktitle = {{SWWS}},
    Year = {2006},
    Pages = {193},
    Publisher = {{CSREA} Press},
    __markedentry = {[jcampos:6]}
    }
  • M. Espinoza, R. Trillo-Lado, J. Gracia, and E. Mena, “Discovering and Merging Keyword Senses using Ontology Matching,” in Ontology Matching, 2006.
    [Bibtex]
    @InProceedings{Espinoza2006,
    Title = {Discovering and Merging Keyword Senses using Ontology Matching},
    Author = {Mauricio Espinoza and
    Raquel Trillo-Lado and
    Jorge Gracia and
    Eduardo Mena},
    Booktitle = {Ontology Matching},
    Year = {2006},
    Publisher = {CEUR-WS.org},
    Series = {{CEUR} Workshop Proceedings},
    Volume = {225},
    __markedentry = {[jcampos:6]}
    }
  • [DOI] J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “A Framework for the Development and Execution of Horizontal Protocols in Open BPM Systems” in Business Process Management: 4th International Conference, BPM 2006, Vienna, Austria, September 5-7, 2006. Proceedings, S. Dustdar, J. L. Fiadeiro, and A. P. Sheth, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 209-224.
    [Bibtex]
    @InBook{Fabra2006g,
    Title = {A Framework for the Development and Execution of Horizontal Protocols in Open BPM Systems},
    Author = {Fabra, J. and {\'A}lvarez, P. and Ba{\~{n}}ares, J. A. and Ezpeleta, J.},
    Editor = {Dustdar, Schahram and Fiadeiro, Jos{\'e} Luiz and Sheth, Amit P.},
    Pages = {209--224},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2006},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {Business Process Management: 4th International Conference, BPM 2006, Vienna, Austria, September 5-7, 2006. Proceedings},
    Doi = {10.1007/11841760_15},
    ISBN = {978-3-540-38903-3},
    Url = {http://dx.doi.org/10.1007/11841760_15}
    }
  • [DOI] J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “RLinda: A Petri Net Based Implementation of the Linda Coordination Paradigm for Web Services Interactions” in E-Commerce and Web Technologies: 7th International Conference, EC-Web 2006, Krakow, Poland, September 5-7, 2006. Proceedings, K. Bauknecht, B. Pröll, and H. Werthner, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 183-192.
    [Bibtex]
    @InBook{Fabra2006f,
    Title = {RLinda: A Petri Net Based Implementation of the Linda Coordination Paradigm for Web Services Interactions},
    Author = {Fabra, J. and {\'A}lvarez, P. and Ba{\~{n}}ares, J. A. and Ezpeleta, J.},
    Editor = {Bauknecht, Kurt and Pr{\"o}ll, Birgit and Werthner, Hannes},
    Pages = {183--192},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2006},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {E-Commerce and Web Technologies: 7th International Conference, EC-Web 2006, Krakow, Poland, September 5-7, 2006. Proceedings},
    Doi = {10.1007/11823865_19},
    ISBN = {978-3-540-37745-0},
    Url = {http://dx.doi.org/10.1007/11823865_19}
    }
  • J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “RLinda: a Petri Net Based Implementation of the Linda Coordination Paradigm for Web Services Interactions,” , pp. 183-192, 2006.
    [Bibtex]
    @InProceedings{Fabra2006e,
    Title = {{RL}inda: a {P}etri {N}et {B}ased {I}mplementation of the {L}inda {C}oordination {P}aradigm for {W}eb {S}ervices {I}nteractions},
    Author = {Javier Fabra and Pedro \'Alvarez and Jose Angel {Ba\~{n}ares} and Joaqu\'in Ezpeleta},
    Booktitle = {Procedings of the 7th International Conference on Electronic Commerce and Web Technologies (EC-Web 2006), Krakow, Poland, September 5-7, 2006},
    Year = {2006},
    Address = {Krakow (Poland)},
    Pages = {183-192},
    Series = {Lecture Notes in Computer Science},
    Entrytype = {inproceedings}
    }
  • J. Fabra, P. Álvarez, J. A. Bañares, and J. Ezpeleta, “A Framework for the Development and Execution of Horizontal Protocols in Open BPM Systems,” in Proceedings of the 4th International Conference on Business Process Management, (BPM 2006), Vienna, Austria, September 5-7, 2006, 2006, pp. 209-224.
    [Bibtex]
    @InProceedings{Fabra2006d,
    Title = {A {F}ramework for the {D}evelopment and {E}xecution of {H}orizontal {P}rotocols in {O}pen {BPM} {S}ystems},
    Author = {Javier Fabra and Pedro \'Alvarez and Jose Angel {Ba\~{n}ares} and Joaqu\'in Ezpeleta},
    Booktitle = {Proceedings of the 4th International Conference on Business Process Management, (BPM 2006), Vienna, Austria, September 5-7, 2006},
    Year = {2006},
    Pages = {209-224},
    Publisher = {Springer Verlag},
    Series = {Lecture Notes in Computer Science}
    }
  • [DOI] E. Gómez–Martínez and J. Merseguer, “ArgoSPE: Model-based software performance engineering,” in 27th International Conference on Application and Theory of Petri Nets and Other Models Of Councurrency, 2006, pp. 401-410.
    [Bibtex]
    @InProceedings{Gomez-Martinez2006a,
    Title = {{ArgoSPE}: Model-based software performance engineering},
    Author = {E. G\'{o}mez--Mart\'{i}nez and J. Merseguer},
    Booktitle = {27th International Conference on Application and Theory of Petri Nets and Other Models Of Councurrency},
    Year = {2006},
    Pages = {401-410},
    Publisher = {Springer},
    Series = {Lecture Notes in Computer Science},
    Volume = {4024},
    Comment = {References: 2010: Devaraj-IETsw-10},
    Doi = {10.1007/11767589_23}
    }
  • [DOI] E. Gómez–Martínez and J. Merseguer, “Impact of SOAP Implementations in the Performance of a Web Service–based Application,” in Lecture Notes in Computer Science. Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops, 2006, pp. 884-896.
    [Bibtex]
    @InProceedings{Gomez-Martinez2006,
    Title = {Impact of SOAP Implementations in the Performance of a Web Service--based Application},
    Author = {E. G\'{o}mez--Mart\'{i}nez and J. Merseguer},
    Booktitle = {Lecture Notes in Computer Science. Frontiers of High Performance Computing and Networking - ISPA 2006 Workshops},
    Year = {2006},
    Month = {December},
    Pages = {884--896},
    Publisher = {Springer--Verlag},
    Volume = {4331},
    Doi = {10.1007/11942634_90}
    }
  • J. Gracia, R. Trillo-Lado, M. Espinoza, and E. Mena, “Querying the web: a multiontology disambiguation method,” in ICWE, 2006, pp. 241-248.
    [Bibtex]
    @InProceedings{Gracia2006,
    Title = {Querying the web: a multiontology disambiguation method},
    Author = {Jorge Gracia and
    Raquel Trillo-Lado and
    Mauricio Espinoza and
    Eduardo Mena},
    Booktitle = {{ICWE}},
    Year = {2006},
    Pages = {241--248},
    Publisher = {{ACM}},
    __markedentry = {[jcampos:6]}
    }
  • S. Ilarri, R. Trillo-Lado, and E. Mena, “SPRINGS: A Scalable Platform for Highly Mobile Agents in Distributed Computing Environments,” in WOWMOM, 2006, pp. 633-637.
    [Bibtex]
    @InProceedings{Ilarri2006,
    Title = {{SPRINGS:} {A} Scalable Platform for Highly Mobile Agents in Distributed
    Computing Environments},
    Author = {Sergio Ilarri and
    Raquel Trillo-Lado and
    Eduardo Mena},
    Booktitle = {{WOWMOM}},
    Year = {2006},
    Pages = {633--637},
    Publisher = {{IEEE} Computer Society},
    __markedentry = {[jcampos:6]}
    }

2005

  • P. Álvarez, J. A. Bañares, and J. Ezpeleta, “Approaching Web Service Coordination and Composition by Means of Petri Nets. The Case of the Nets-Within-Nets Paradigm.,” in Service-Oriented Computing – ICSOC 2005, Third International Conference, Amsterdam, The Netherlands, December 12-15, 2005, Proceedings, 2005-12-13 2005, pp. 185-197.
    [Bibtex]
    @InProceedings{Alvarez2005a,
    Title = {Approaching {W}eb {S}ervice {C}oordination and {C}omposition by {M}eans of {P}etri {N}ets. {T}he {C}ase of the {N}ets-{W}ithin-{Nets} {P}aradigm.},
    Author = {P. \'Alvarez and J.A. {Ba\~{n}ares} and J. Ezpeleta},
    Booktitle = {Service-Oriented Computing - ICSOC 2005, Third International Conference, Amsterdam, The Netherlands, December 12-15, 2005, Proceedings},
    Year = {2005},
    Pages = {185-197},
    Publisher = {Springer},
    Volume = {3826},
    Crossref = {conf/icsoc/2005},
    Date = {2005-12-13},
    Description = {dblp},
    Ee = {http://dx.doi.org/10.1007/11596141_15},
    ISBN = {3-540-30817-2},
    Keywords = {dblp }
    }
  • [DOI] P. Álvarez, J. A. Bañares, and J. Ezpeleta, “Approaching Web Service Coordination and Composition by Means of Petri Nets. The Case of the Nets-Within-Nets Paradigm” in Service-Oriented Computing – ICSOC 2005: Third International Conference, Amsterdam, The Netherlands, December 12-15, 2005. Proceedings, B. Benatallah, F. Casati, and P. Traverso, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 185-197.
    [Bibtex]
    @InBook{Alvarez2005b,
    Title = {Approaching Web Service Coordination and Composition by Means of Petri Nets. The Case of the Nets-Within-Nets Paradigm},
    Author = {{\'A}lvarez, P. and Ba{\~{n}}ares, J. A. and Ezpeleta, J.},
    Editor = {Benatallah, Boualem and Casati, Fabio and Traverso, Paolo},
    Pages = {185--197},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2005},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {Service-Oriented Computing - ICSOC 2005: Third International Conference, Amsterdam, The Netherlands, December 12-15, 2005. Proceedings},
    Doi = {10.1007/11596141_15},
    ISBN = {978-3-540-32294-8},
    Url = {http://dx.doi.org/10.1007/11596141_15}
    }
  • P. Álvarez, J. A. Bañares, and J. Ezpeleta, “Third International Conference on Service Oriented Computing –ICSOC 2005.” Springer Verlag, 2005, pp. 185-197.
    [Bibtex]
    @InBook{Alvarez2005,
    Title = {Third International Conference on Service Oriented Computing --ICSOC 2005},
    Author = {P. \'Alvarez and J. A. {Ba\~{n}ares} and J. Ezpeleta},
    Chapter = {Approaching Web Service Coordination and Composition by Means of Petri Nets. The Case of the Nets-Within-Nets Paradigm},
    Pages = {185--197},
    Publisher = {Springer Verlag},
    Year = {2005},
    Number = {3826},
    Series = {Lecture Notes in Computer Science},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • S. Bernardi, J. Campos, S. Donatelli, and J. Merseguer, GSPN Compositional Semantics for UML Statecharts and Sequence Diagrams, 2005.
    [Bibtex]
    @Unpublished{BCDM-05,
    Title = {{GSPN} Compositional Semantics for {UML} Statecharts and Sequence Diagrams},
    Author = {S. Bernardi and J. Campos and S. Donatelli and J. Merseguer},
    Note = {Submitted for publication},
    Year = {2005},
    Abstract = {Software performance engineering (SPE) is proposed as a method for the performance evaluation of software systems early in the development process. The generic approach of the SPE consists of deriving performance models from UML specifications. This paper, following the SPE principles, addresses the UML StateCharts (SCs) and the Sequence Diagrams (SDs) as UML specifications, while performance models are specified with Generalized Stochastic Petri Nets. The proposed derivation, actually the authors interpretation of the SC and SD, provides these two kinds of UML diagrams with a formal semantics. The interpretation is based on the UML semi-formal semantics. A software fault tolerance mechanism is used as an example to illustrate how, following the proposal, the SC and the SD are automatically converted into GSPNs. Another contribution of the work is the consistency study among the SC and the SD, since they are used in a combined manner to obtain the target performance model. The approach presented in this paper allows to derive two kinds of performance models: one representing the behaviour of the whole system and another representing the particular execution described by a SD.}
    }
  • [DOI] E. Gómez Mart{‘i}nez and J. Merseguer, “A Software Performance Engineering Tool based on the UML-SPT,” in 2nd International Conference on the Quantitative Evaluation of Systems (QEST), 2005, pp. 247-248.
    [Bibtex]
    @InProceedings{GomezMartinez2005,
    Title = {A Software Performance Engineering Tool based on the {UML-SPT}},
    Author = {G{\'o}mez Mart{\'\i}nez, E. and Merseguer, J.},
    Booktitle = {2nd International Conference on the Quantitative Evaluation of Systems (QEST)},
    Year = {2005},
    Pages = {247-248},
    Publisher = {IEEE},
    Doi = {10.1109/QEST.2005.3}
    }
  • [DOI] J. Nogueras-Iso, F. J. Zarazaga-Soria, R. Béjar, P. J. Álvarez, and P. R. Muro-Medrano, “OGC Catalog Services: a key element for the development of Spatial Data Infrastructures,” Computers & Geosciences, vol. 31, iss. 2, pp. 199-209, 2005.
    [Bibtex]
    @Article{Nogueras-Iso2005,
    Title = {OGC Catalog Services: a key element for the development of Spatial Data Infrastructures},
    Author = {J. Nogueras-Iso and F.J. Zarazaga-Soria and R. B\'{e}jar and P.J. \'{A}lvarez and P.R. Muro-Medrano},
    Journal = {Computers \& Geosciences},
    Year = {2005},
    Note = {Geospatial Research in Europe: AGILE 2003},
    Number = {2},
    Pages = {199 - 209},
    Volume = {31},
    __markedentry = {[jcampos:]},
    Doi = {http://dx.doi.org/10.1016/j.cageo.2004.05.015},
    ISSN = {0098-3004},
    Keywords = {Catalogs, Metadata, Interoperability, Geographic information, OpenGIS, SDI},
    Url = {http://www.sciencedirect.com/science/article/pii/S0098300404001955}
    }
  • C. J. Pérez-Jiménez, J. Campos, and M. Silva, Approximate Throughput Computation of Deterministic Systems of Sequential Processes: Application to Manufacturing Systems, 2005.
    [Bibtex]
    @Unpublished{PJCS-05,
    Title = {Approximate Throughput Computation of Deterministic Systems of Sequential Processes: Application to Manufacturing Systems},
    Author = {C.J. P{\'e}rez-Jim{\'e}nez and J. Campos and M. Silva},
    Note = {Submitted for publication},
    Year = {2005},
    Abstract = {A general iterative technique for approximate throughput computation of stochastic live and bounded Deterministic Systems of Sequential Processes (DSSPs, a subclass of Petri nets) is presented. It generalizes a previous technique on stochastic weighted T-systems. The approach has two basic foundations. First, a deep understanding of the qualitative behaviour of DSSPs leads to a general decomposition technique. Second, after the decomposition phase, an iterative response time approximation method is applied for the throughput computation. We apply the obtained technique to the performance evaluation of manufacturing systems modelled with Petri nets. Experimental results generally have an error of less than 5 %. The state space is usually reduced by more than one order of magnitude; therefore, the analysis of otherwise intractable systems is possible.}
    }
  • J. R. R. Viqueira, P. Álvarez, J. Varela, and P. J. Saco, “Architecture of a Natural Disasters Management Framework and its application to Risk Assessment,” in 8th AGILE Conference on Geographic Information Science, 2005, pp. 189-196.
    [Bibtex]
    @InProceedings{Viqueira2005,
    Title = {Architecture of a Natural Disasters Management Framework and its application to Risk Assessment},
    Author = {J. R. R. Viqueira and P. \'Alvarez and J. Varela and P.J. Saco},
    Booktitle = {8th AGILE Conference on Geographic Information Science},
    Year = {2005},
    Pages = {189-196},
    __markedentry = {[jcampos:]}
    }
  • [DOI] M. Woodside, D. C. Petriu, D. B. Petriu, H. Shen, T. Israr, and J. Merseguer, “Performance by Unified Model Analysis (PUMA),” in Fifth International Workshop on Software and Performance (WOSP’05), Palma, Spain, 2005, pp. 1-12.
    [Bibtex]
    @InProceedings{Woodside2005,
    Title = {Performance by Unified Model Analysis ({PUMA})},
    Author = {Woodside, M. and Petriu, D.C. and Petriu, D.B. and Shen, H. and Israr, T. and Merseguer, J.},
    Booktitle = {Fifth International Workshop on Software and Performance {(WOSP'05)}},
    Year = {2005},
    Address = {Palma, Spain},
    Month = {July},
    Pages = {1-12},
    Publisher = {ACM},
    Comment = {References: 2010: Devaraj-IETsw-10 2007: BKR-WOSP-07, JTHL-ICSE-07, GMS-WOSP-07, LB-ECBS-07, DRW-ESEC-07, HL-ICSEA-07 2007: SLRW-QEST-07 2006: GMS-LNCS-06-4063,BGMO-LNCS-06-3938, DRW-ICSE-06, WKWNHHF-ICSE-06, DM-LNCS-06},
    Doi = {10.1145/1071021.1071022}
    }

2004

  • [DOI] S. Bernardi, A. Bobbio, and S. Donatelli, “Petri Nets and Dependability,” in Lectures on Concurrency and Petri Nets, Advances in Petri Nets, 2004, pp. 125-179.
    [Bibtex]
    @InProceedings{Bernardi2004e,
    Title = {Petri Nets and Dependability},
    Author = {Simona Bernardi and Andrea Bobbio and Susanna Donatelli},
    Booktitle = {Lectures on Concurrency and Petri Nets, Advances in Petri Nets},
    Year = {2004},
    Pages = {125--179},
    Doi = {10.1007/978-3-540-27755-2_4}
    }
  • [DOI] S. Bernardi and J. Campos, “On Performance Bounds for Interval Time Petri Nets,” in Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST’04), Enschede, The Netherlands, 2004, pp. 50-59.
    [Bibtex]
    @InProceedings{BC-QEST-04,
    Title = {On Performance Bounds for Interval Time {Petri} Nets},
    Author = {S. Bernardi and J. Campos},
    Booktitle = {Proceedings of the 1st International Conference on Quantitative Evaluation of Systems {(QEST'04)}},
    Year = {2004},
    Address = {Enschede, The Netherlands},
    Month = {September},
    Pages = {50-59},
    Publisher = {IEEE Computer Society},
    Abstract = {Interval time Petri Nets are Petri nets in which time intervals are associated to transitions. Their quantitative analysis basically 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 allow to obtain equivalent nets with a reduced state space or avoid the construction of the whole state space. The alternative method proposed here consists in computing performance bounds to partially characterize the quantitative behavior of interval time Petri Nets by exploiting their structural properties and/or by applying operational laws. The performance bound computation is not a new technique: it has been proposed for timed Petri nets. In this paper we present the results obtained from a preliminary investigation on the applicability of bounding techniques of timed Petri nets to interval time Petri Nets.},
    Doi = {10.1109/QEST.2004.1348019},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/bc-qest-04.pdf}
    }
  • [DOI] S. Bernardi and S. Donatelli, “Stochastic Petri Nets and Inheritance for Dependability Modelling,” in 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2004), 3-5 March 2004, Papeete, Tahiti, 2004, pp. 363-372.
    [Bibtex]
    @InProceedings{Bernardi2004b,
    Title = {Stochastic Petri Nets and Inheritance for Dependability Modelling},
    Author = {Simona Bernardi and Susanna Donatelli},
    Booktitle = {10th {IEEE} Pacific Rim International Symposium on Dependable Computing {(PRDC} 2004), 3-5 March 2004, Papeete, Tahiti},
    Year = {2004},
    Pages = {363--372},
    Doi = {10.1109/PRDC.2004.1276592}
    }
  • S. Bernardi, S. Donatelli, and G. Dondossola, “A class Diagram framework for collecting dependability requirements in automation systems,” in International Symposium on Leveraging Applications of Formal Methods, ISoLA 2004, October 30 – November 2, 2004, Paphos, Cyprus. Preliminary proceedings, 2004, pp. 276-283.
    [Bibtex]
    @InProceedings{Bernardi2004a,
    Title = {A class Diagram framework for collecting dependability requirements in automation systems},
    Author = {Simona Bernardi and Susanna Donatelli and Giovanna Dondossola},
    Booktitle = {International Symposium on Leveraging Applications of Formal Methods, ISoLA 2004, October 30 - November 2, 2004, Paphos, Cyprus. Preliminary proceedings},
    Year = {2004},
    Pages = {276--283}
    }
  • [DOI] S. Bernardi, S. Donatelli, and G. Dondossola, “Towards a Methodological Approach to Specification and Analysis of Dependable Automation Systems,” in Joint International Conferences on Formal Modelling and Analysis of Timed Systems (FORMATS) and Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTF), Grenoble, France, September 22-24, 2004, Proceedings, 2004, pp. 36-51.
    [Bibtex]
    @InProceedings{Bernardi2004,
    Title = {Towards a Methodological Approach to Specification and Analysis of Dependable Automation Systems},
    Author = {Simona Bernardi and Susanna Donatelli and Giovanna Dondossola},
    Booktitle = {Joint International Conferences on Formal Modelling and Analysis of Timed Systems (FORMATS) and Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTF), Grenoble, France, September 22-24, 2004, Proceedings},
    Year = {2004},
    Pages = {36--51},
    Doi = {10.1007/978-3-540-30206-3_5}
    }
  • S. Bernardi and D. C. Petriu, Comparting two UML Profile for Non-functional Requiment Annotations: the SPW and QoS Profiles, 2004.
    [Bibtex]
    @Unpublished{Bernardi2004d,
    Title = {{Comparting two UML Profile for Non-functional Requiment Annotations: the SPW and QoS Profiles}},
    Author = {Simona Bernardi and Dorina C. Petriu},
    Note = {International Workshop on Specification and Validation of UML models for Real Time and Embedded Systems (SVERTS), within the 7th International Conference on the Unified Modeling Language (UML'04), Lisbon (Portugal), October 11st},
    Year = {2004}
    }
  • [DOI] C. González-Buesa and J. Campos, “Solving the Mobile Robot Localization Problem Using String Matching Algorithms,” in Proceedings of the 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS’04), Sendai, Japan, 2004, pp. 2475-2480.
    [Bibtex]
    @InProceedings{GBC-IROS-04,
    Title = {Solving the Mobile Robot Localization Problem Using String Matching Algorithms},
    Author = {C. Gonz{\'a}lez-Buesa and J. Campos},
    Booktitle = {Proceedings of the 2004 {IEEE/RSJ} International Conference on Intelligent Robots and Systems {(IROS'04)}},
    Year = {2004},
    Address = {Sendai, Japan},
    Month = {September},
    Pages = {2475-2480},
    Abstract = {In this paper we address the mobile robot localization using some techniques borrowed from the Computational Biology community. The specific problem studied here is also known as the kidnapped robot problem. Our proposal is to solve this problem by string matching algorithms, which have experienced a large advance in the last years due to (for example) the Genoma Project. The paper uses three different algorithms to solve the mentioned problem and shows their advantages, such as the robustness of the results and the memory and time efficiency. These results are validated by real experimentation using panoramic images of indoor buildings, and compared and discussed with existing techniques that have been used over the same test-bed.},
    Doi = {10.1109/IROS.2004.1389780},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/gbc-iros-04.pdf}
    }
  • [DOI] J. P. López-Grao, J. Merseguer, and J. Campos, “From UML Activity Diagrams to Stochastic Petri Nets: Application to Software Performance Engineering,” in Proceedings of the Fourth International Workshop on Software and Performance (WOSP’04), Redwood City, California, USA, 2004, pp. 25-36.
    [Bibtex]
    @InProceedings{LGMC-WOSP04,
    Title = {From {UML} Activity Diagrams to Stochastic {Petri} Nets: Application to Software Performance Engineering},
    Author = {J.P. L{\'o}pez-Grao and J. Merseguer and J. Campos},
    Booktitle = {Proceedings of the Fourth International Workshop on Software and Performance {(WOSP'04)}},
    Year = {2004},
    Address = {Redwood City, California, USA},
    Month = {January},
    Note = {Also in ACM SIGSOFT Software Engineering Notes, Vol. 29, no. 1, January 2004.},
    Pages = {25-36},
    Publisher = {ACM},
    Abstract = {Over the last decade, the relevance of performance evaluation in the early stages of the software development life-cycle has been steadily rising. We honestly believe that the integration of formal models in the software engineering process is a must, in order to enable the application of well-known, powerful analysis techniques to software models. In previous papers the authors have stated a proposal for SPE, dealing with several UML diagram types.The proposal formalizes their semantics, and provides a method to translate them into (analyzable) GSPN models. This paper focuses on activity diagrams, which had not been dealt with so far. They will be incorporated in our SPE method, enhancing its expressivity by refining abstraction levels in the statechart diagrams. Performance requirements will be annotated according to the UML profile for schedulability, performance and time. Last but not least, our CASE tool prototype will be introduced. This tool deals with every model element from activity diagrams and ensures an automatic translation from ADs into GSPNs strictly following the process related in this paper.},
    Doi = {10.1145/974044.974048},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/lgmc-wosp04.pdf}
    }
  • M. A. Latre, P. Álvarez, R. Béjar, and P. R. Muro-Medrano, “Integrating legacy systems and the GIS elements of the Water Framework Directive into an Spatial Data Infrastructure,” in Proceedings of the 10th EC-GI & GIS Workshop ESDI: The State of the Art, 2004.
    [Bibtex]
    @InProceedings{Latre2004,
    Title = {Integrating legacy systems and the GIS elements of the Water Framework Directive into an Spatial Data Infrastructure},
    Author = {M. A. Latre and P. \'Alvarez and R. B\'ejar and P.R. Muro-Medrano},
    Booktitle = {Proceedings of the 10th EC-GI \& GIS Workshop ESDI: The State of the Art},
    Year = {2004},
    __markedentry = {[jcampos:]}
    }
  • [DOI] E. J. Mata, P. Álvarez, J. A. Bañares, and J. Rubio, “Towards an Efficient Rule-Based Coordination of Web Services” in Advances in Artificial Intelligence — IBERAMIA 2004: 9th Ibero-American Conference on AI, Puebla, Mexico, November 22-26, 2004. Proceedings, C. Lemaître, C. A. Reyes, and J. A. González, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 73-82.
    [Bibtex]
    @InBook{Mata2004,
    Title = {Towards an Efficient Rule-Based Coordination of Web Services},
    Author = {Mata, Eloy J. and {\'A}lvarez, Pedro and Ba{\~{n}}ares, Jos{\'e} A. and Rubio, Julio},
    Editor = {Lema{\^i}tre, Christian and Reyes, Carlos A. and Gonz{\'a}lez, Jes{\'u}s A.},
    Pages = {73--82},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2004},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {Advances in Artificial Intelligence -- IBERAMIA 2004: 9th Ibero-American Conference on AI, Puebla, Mexico, November 22-26, 2004. Proceedings},
    Doi = {10.1007/978-3-540-30498-2_8},
    ISBN = {978-3-540-30498-2},
    Url = {http://dx.doi.org/10.1007/978-3-540-30498-2_8}
    }
  • J. Merseguer, “On the use of UML State Machines for Software Performance Evaluation,” in Workshop on the usage of the UML profile for Scheduling, Performance and Time, SIVOES-SPT. Hold in conjunction with the 10TH IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2004, Toronto, Canada, 2004.
    [Bibtex]
    @InProceedings{Merseguer2004,
    Title = {On the use of {UML} State Machines for Software Performance Evaluation},
    Author = {Merseguer, J},
    Booktitle = {Workshop on the usage of the UML profile for Scheduling, Performance and Time, SIVOES-SPT. Hold in conjunction with the 10TH IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2004},
    Year = {2004},
    Address = {Toronto, Canada},
    Month = {May 25th},
    Comment = {References:TZ-OOSDRT-05}
    }
  • [DOI] J. Merseguer and J. Campos, “Software Performance Modelling Using UML and Petri Nets,” Lecture Notes in Computer Science, vol. 2965, pp. 265-289, 2004.
    [Bibtex]
    @Article{MC-LNCS-04,
    Title = {Software Performance Modelling Using {UML} and {Petri} Nets},
    Author = {J. Merseguer and J. Campos},
    Journal = {Lecture Notes in Computer Science},
    Year = {2004},
    Note = {Invited paper},
    Pages = {265-289},
    Volume = {2965},
    Abstract = {Software systems are today one of the most complex artifacts, they are simultaneously used by hundred-thousand of people sometimes in risk real time operations, such as auctions or electronic commerce. Nevertheless, it is a common practice to deploy them without the expected performance. Software Performance Engineering has emerged as a discipline to complement Software Engineering research in order to address this kind of problems. In this work, we survey some recent contributions in the field of Software Performance Engineering. The approach surveyed has as main features that it uses the UML diagrams to specify the functional and performance requeriments of the system and the stochastic Petri nets formalism to analyse it.},
    Booktitle = {Performance Tools and Applications to Networked Systems, Revised Tutorial Lectures from {MASCOTS} 2003},
    Doi = {10.1007/978-3-540-24663-3_13},
    Editor = {M.C. Calzarossa and E. Gelenbe},
    Publisher = {Springer-Verlag},
    Series = {Tutorials},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/mc-lncs-04.pdf}
    }
  • L. Recalde, M. Silva, J. Ezpeleta, and E. Teruel, “Petri nets and manufacturing systems: An examples–driven tour,” , vol. 3098, pp. 742-788, 2004.
    [Bibtex]
    @InCollection{Recalde2004,
    Title = {Petri nets and manufacturing systems: An examples--driven tour},
    Author = {L. Recalde and M. Silva and J. Ezpeleta and E. Teruel},
    Booktitle = {Lectures on Concurrency and Petri Nets. Advances in Petri Nets},
    Publisher = {Springer--Verlag},
    Year = {2004},
    Editor = {J. Desel, W. Reisig, G. Rozenberg},
    Pages = {742--788},
    Volume = {3098},
    Entrytype = {incollection},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }

2003

  • [DOI] P. Álvarez, J. A. Bañares, E. J. Mata, P. R. Muro-Medrano, and J. Rubio, “Generative Communication with Semantic Matching in Distributed Heterogeneous Environments” in Computer Aided Systems Theory – EUROCAST 2003: 9th International Workshop on Computer Aided Systems Theory Las Palmas de Gran Canaria, Spain, February 24-28, 2003 Revised Selected Papers, R. Moreno-Díaz and F. Pichler, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 231-242.
    [Bibtex]
    @InBook{Alvarez2003,
    Title = {Generative Communication with Semantic Matching in Distributed Heterogeneous Environments},
    Author = {{\'A}lvarez, Pedro and Ba{\~{n}}ares, Jos{\'e} A. and Mata, Eloy J. and Muro-Medrano, Pedro R. and Rubio, Julio},
    Editor = {Moreno-D{\'i}az, Roberto and Pichler, Franz},
    Pages = {231--242},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2003},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {Computer Aided Systems Theory - EUROCAST 2003: 9th International Workshop on Computer Aided Systems Theory Las Palmas de Gran Canaria, Spain, February 24-28, 2003 Revised Selected Papers},
    Doi = {10.1007/978-3-540-45210-2_22},
    ISBN = {978-3-540-45210-2},
    Url = {http://dx.doi.org/10.1007/978-3-540-45210-2_22}
    }
  • [DOI] P. Álvarez, J. A. Bañares, and P. R. Muro-Medrano, “An Architectural Pattern to Extend the Interaction Model between Web-Services: The Location-Based Service Context” in Service-Oriented Computing – ICSOC 2003: First International Conference, Trento, Italy, December 15-18, 2003. Proceedings, M. E. Orlowska, S. Weerawarana, M. P. Papazoglou, and J. Yang, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 271-286.
    [Bibtex]
    @InBook{Alvarez2003a,
    Title = {An Architectural Pattern to Extend the Interaction Model between Web-Services: The Location-Based Service Context},
    Author = {{\'A}lvarez, P. and Ba{\~{n}}ares, J. A. and Muro-Medrano, P. R.},
    Editor = {Orlowska, Maria E. and Weerawarana, Sanjiva and Papazoglou, Michael P. and Yang, Jian},
    Pages = {271--286},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2003},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {Service-Oriented Computing - ICSOC 2003: First International Conference, Trento, Italy, December 15-18, 2003. Proceedings},
    Doi = {10.1007/978-3-540-24593-3_19},
    ISBN = {978-3-540-24593-3},
    Url = {http://dx.doi.org/10.1007/978-3-540-24593-3_19}
    }
  • [DOI] P. Álvarez, J. A. Bañares, P. R. Muro-Medrano, J. Nogueras, and F. J. Zarazaga, “A Java Coordination Tool for Web-Service Architectures: The Location-Based Service Context” in Scientific Engineering for Distributed Java Applications: International Workshop, FIDJI 2002 Luxembourg-Kirchberg, Luxembourg, November 28–29, 2002 Revised Papers, N. Guelfi, E. Astesiano, and G. Reggio, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 1-14.
    [Bibtex]
    @InBook{Alvarez2003b,
    Title = {A Java Coordination Tool for Web-Service Architectures: The Location-Based Service Context},
    Author = {{\'A}lvarez, P. and Ba{\~{n}}ares, J.A. and Muro-Medrano, P.R. and Nogueras, J. and Zarazaga, F.J.},
    Editor = {Guelfi, Nicolas and Astesiano, Egidio and Reggio, Gianna},
    Pages = {1--14},
    Publisher = {Springer Berlin Heidelberg},
    Year = {2003},
    Address = {Berlin, Heidelberg},
    __markedentry = {[jcampos:]},
    Booktitle = {Scientific Engineering for Distributed Java Applications: International Workshop, FIDJI 2002 Luxembourg-Kirchberg, Luxembourg, November 28--29, 2002 Revised Papers},
    Doi = {10.1007/3-540-36520-6_1},
    ISBN = {978-3-540-36520-4},
    Url = {http://dx.doi.org/10.1007/3-540-36520-6_1}
    }
  • P. Álvarez, J. A. Bañares, R. Béjar, and M. A. Latre, “Extending OpenGIS services to gain access to real time data through a Web-Coordination service,” in 6th AGILE Conference on Geographic Information Science, 2003, pp. 189-196.
    [Bibtex]
    @InProceedings{Alvarez2003c,
    Title = {Extending OpenGIS services to gain access to real time data through a Web-Coordination service},
    Author = {P. \'Alvarez and J.A. Ba\~{n}ares and R. B\'ejar and M. A. Latre},
    Booktitle = {6th AGILE Conference on Geographic Information Science},
    Year = {2003},
    Pages = {189-196},
    __markedentry = {[jcampos:]}
    }
  • S. Bernardi, “Building Stochastic Petri Net models for the verification of complex software systems,” PhD Thesis, 2003.
    [Bibtex]
    @PhdThesis{Bernardi2003,
    Title = {{Building Stochastic Petri Net models for the verification of complex software systems}},
    Author = {Simona Bernardi},
    School = {{Dipartimento di Informatica, Universit\`a degli Studi di Torino (Italia)}},
    Year = {2003},
    Month = {April}
    }
  • [DOI] S. Bernardi and S. Donatelli, “Building Petri net scenarios for dependable automation systems,” in Proceedings of the 10th International Workshop on Petri Nets and Performance Models, PNPM 2003, Urbana-Champaign, IL, USA, September 2-5, 2003, 2003, pp. 72-81.
    [Bibtex]
    @InProceedings{Bernardi2003a,
    Title = {Building Petri net scenarios for dependable automation systems},
    Author = {Simona Bernardi and Susanna Donatelli},
    Booktitle = {Proceedings of the 10th International Workshop on Petri Nets and Performance Models, {PNPM} 2003, Urbana-Champaign, IL, USA, September 2-5, 2003},
    Year = {2003},
    Pages = {72--81},
    Doi = {10.1109/PNPM.2003.1231544}
    }
  • J. Ezpeleta, P. Gascón, and N. Porta, “COMPAS: un compilador para un lenguaje imperativo con aserciones embebidas,” Novática, iss. 164, pp. 47-51, 2003.
    [Bibtex]
    @Article{Ezpeleta2003,
    Title = {COMPAS: un compilador para un lenguaje imperativo con aserciones embebidas},
    Author = {J. Ezpeleta and P. Gasc\'{o}n and N. Porta},
    Journal = {Nov\'{a}tica},
    Year = {2003},
    Month = {May},
    Number = {164},
    Pages = {47--51},
    Entrytype = {article},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. Ezpeleta and R. Valk, “A polynomial solution for deadlock avoidance in assembly systems modelled with Petri nets,” , pp. 1-8, 2003.
    [Bibtex]
    @InProceedings{Ezpeleta2003a,
    Title = {A polynomial solution for deadlock avoidance in assembly systems modelled with Petri nets},
    Author = {J. Ezpeleta and R. Valk},
    Booktitle = {Proceedings of the Multiconference on Computational Engineering in Systems Applications (CESA 2003)},
    Year = {2003},
    Address = {Lille (France)},
    Month = {July},
    Pages = {1--8},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • A. González-Uzábal, C. Galé, and J. Campos, “Desarrollo de una herramienta de optimización binivel utilizando CPLEX y MATLAB y generación de problemas de prueba,” in Actas del 27 Congreso Nacional de Estadística e Investigación Operativa, Lleida, Spain, 2003, pp. 2931-2944.
    [Bibtex]
    @InProceedings{GUGC-SEIO03,
    Title = {Desarrollo de una herramienta de optimizaci\'on binivel utilizando {CPLEX} y {MATLAB} y generaci\'on de problemas de prueba},
    Author = {A. Gonz{\'a}lez-Uz{\'a}bal and C. Gal{\'e} and J. Campos},
    Booktitle = {Actas del 27 Congreso Nacional de Estad\'{\i}stica e Investigaci\'on Operativa},
    Year = {2003},
    Address = {Lleida, Spain},
    Month = {April},
    Note = {In Spanish},
    Organization = {Sociedad de Estad\'{\i}stica e Investigaci\'on Operativa de Espa\~na y Departament de Matem\`atica de la Universidad de Lleida},
    Pages = {2931-2944},
    Publisher = {Edicions de la Universitat de Lleida},
    Abstract = {En este trabajo se presenta el desarrollo de una herramienta para resolver problemas de optimizaci\'on binivel y en particular de un nivel, tanto con objetivos lineales como lineales fraccionarios, implementada en CPLEX y en MATLAB. La herramienta permite seleccionar entre varios algoritmos de resoluci\'on y obtener medidas de evaluaci\'on del rendimiento de cada uno. Se presenta tambi\'en un m\'etodo para la generaci\'on autom\'atica de problemas binivel de prueba que ayude a evaluar este tipo de herramientas. Mediante una serie de transformaciones de la matriz de coeficientes tecnol\'ogicos y la funci\'on objetivo de segundo nivel, se asegura la factibilidad del problema y que la soluci\'on del problema binivel no sea la trivial.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/gugc-seio03.pdf}
    }
  • J. Merseguer, “Software Performance Engineering based on UML and Petri nets,” PhD Thesis, Spain, 2003.
    [Bibtex]
    @PhdThesis{Merseguer2003,
    Title = {Software Performance Engineering based on {UML} and {P}etri nets},
    Author = {Merseguer, J.},
    School = {University of Zaragoza},
    Year = {2003},
    Address = {Spain},
    Month = {March},
    Comment = {References:BernardiPhD,DPPS-ISCIS04}
    }
  • J. Merseguer and J. Campos, “Exploring Roles for the UML Diagrams in Software Performance Engineering,” in Proceedings of the 2003 International Conference on Software Engineering Research and Practice (SERP’03), Las Vegas, Nevada, USA, 2003, pp. 43-47.
    [Bibtex]
    @InProceedings{MC-SERP03,
    Title = {Exploring Roles for the {UML} Diagrams in Software Performance Engineering},
    Author = {J. Merseguer and J. Campos},
    Booktitle = {Proceedings of the 2003 International Conference on Software Engineering Research and Practice {(SERP'03)}},
    Year = {2003},
    Address = {Las Vegas, Nevada, USA},
    Month = {June},
    Pages = {43-47},
    Publisher = {CSREA Press},
    Abstract = {It is not an overstatement to say that the gap between software design and performance evaluation techniques has caused the misuse of the last ones by software engineers. The UML profile for schedulability, performance and time arose from the intention to close both fields, software engineering and performance analysis. Nevertheless the gap remains, since it is difficult for software engineers to devise which parts of their designs are suitable to represent performance requirements. The profile has started to study this problem from a scenarios viewpoint. In this work, we explore other viewpoints to deal with performance requirements at software design level.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/mc-serp03.pdf}
    }
  • J. Merseguer, J. Campos, and E. Mena, “A Pattern-Based Approach to Model Software Performance Using UML and Petri Nets: Application to Agent-Based Systems,” in Proceedings of the 7th World Multiconference on Systemics, Cybernetics and Informatics, Orlando, Florida, USA, 2003, pp. 307-313.
    [Bibtex]
    @InProceedings{MCM-SCI03,
    Title = {A Pattern-Based Approach to Model Software Performance Using {UML} and {Petri} Nets: Application to Agent-Based Systems},
    Author = {J. Merseguer and J. Campos and E. Mena},
    Booktitle = {Proceedings of the 7th World Multiconference on Systemics, Cybernetics and Informatics},
    Year = {2003},
    Address = {Orlando, Florida, USA},
    Month = {July},
    Pages = {307-313},
    Publisher = {IIIS Press},
    Volume = {IX},
    Abstract = {Software design and implementation using mobile agents are nowadays involved in a scepticism halo. There are researchers who question its utility because it could be a new technology that does provide new skills but it could introduce new problems. Security and performance are the most critical aspects for this new kind of software. In this paper we present a formal approach to analyse performance for this class of systems, which is integrated in the early stages of the software development process. We propose to model the software system in a pragmatic way using as a design technique the well-known design patterns; from these models, the corresponding formal performance model, in terms of Petri nets, is obtained semi-automatically by applying a set of translation rules. Therefore, the formal performance model is obtained as a by-product of the software life-cycle, preserving the benefits of the software design techniques. Finally, the formal performance model is analysed, using analytical techniques, in order to study the performance of the system. Moreover, another benefit of the proposal is that it is possible to predict the behaviour of the system without the necessity of implementing it. To illustrate the proposal, we apply it to a software retrieval service system designed using mobile agents.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/mcm-sci03.pdf}
    }
  • [DOI] J. Merseguer, J. Campos, and E. Mena, “Analysing Internet Software Retrieval Systems: Modeling and Performance Comparison,” Wireless Networks: The Journal of Mobile Communication, Computation and Information, vol. 9, iss. 3, pp. 223-238, 2003.
    [Bibtex]
    @Article{MCM-WINET03,
    Title = {Analysing Internet Software Retrieval Systems: Modeling and Performance Comparison},
    Author = {J. Merseguer and J. Campos and E. Mena},
    Journal = {Wireless Networks: The Journal of Mobile Communication, Computation and Information},
    Year = {2003},
    Month = {May},
    Number = {3},
    Pages = {223-238},
    Volume = {9},
    Abstract = {Nowadays, there exist web sites that allow users to retrieve and install software in an easy way. The performance of these sites may be poor if they are used in wireless networks; the reason is the inadequate use of the net resources that they need. If this kind of systems are designed using mobile agent technology the previous problem might be avoided. In this paper, we present a comparison between the performance of a software retrieval system especially designed to be used in a wireless network and the performance of a software retrieval system similar to the well-known Tucows.com web site. In order to compare performance, we make use of a software performance process enriched with formal techniques. The process has as important features that it uses UML as a design notation and it uses stochastic Petri nets as formal model. Petri nets provide a formal semantics for the system and a performance model.},
    Doi = {10.1023/A:1022825210932},
    Publisher = {Kluwer Academic Publishers},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/mcm-winet03.pdf}
    }
  • D. Moldt and J. Ezpeleta, “A Proposal for Flexible Testing of Deadlock Control Strategies in Resource Allocation Systems,” , pp. 586-595, 2003.
    [Bibtex]
    @InProceedings{Moldt2003,
    Title = {A Proposal for Flexible Testing of Deadlock Control Strategies in Resource Allocation Systems},
    Author = {D. Moldt and J. Ezpeleta},
    Booktitle = {Proceedings of the International Conference on Computational Intelligence for Modelling Control and Automation (CIMCA03)},
    Year = {2003},
    Address = {Vienna, Austria},
    Month = {February},
    Pages = {586--595},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. Tricas and J. Ezpeleta, “Some results on siphon computation for deadlock prevention in resource allocation systems modelled with Petri nets,” , pp. 16-29, 2003.
    [Bibtex]
    @InProceedings{Tricas2003,
    Title = {Some results on siphon computation for deadlock prevention in resource allocation systems modelled with Petri nets},
    Author = {F. Tricas and J. Ezpeleta},
    Booktitle = {Proceedings of the 2003 IEEE Int. Conf. on Emerging Technologies and Factory Automation (ETFA03)},
    Year = {2003},
    Address = {Lisbon (Portugal)},
    Month = {September},
    Pages = {16--29},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }

2002

  • [DOI] S. Bernardi, S. Donatelli, and J. Merseguer, “From UML Sequence Diagrams and Statecharts to analysable Petri Net models,” in Proceedings of the Third International Workshop on Software and Performance (WOSP2002), Rome, Italy, 2002, pp. 35-45.
    [Bibtex]
    @InProceedings{Bernardi2002,
    Title = {From {UML} Sequence Diagrams and Statecharts to analysable {P}etri Net models},
    Author = {Bernardi, S. and Donatelli, S. and Merseguer, J.},
    Booktitle = {Proceedings of the Third International Workshop on Software and Performance (WOSP2002)},
    Year = {2002},
    Address = {Rome, Italy},
    Month = {July},
    Pages = {35-45},
    Publisher = {ACM},
    Comment = {References: 2007: KLSR-RealTime-07, Pustina-Wosp-07, WD-TASE-07, W-LNCS-4486-07, BB-IST-07 S-LNCS-4486-07, RKK-LNCS-4615-07, ILCh-LNCS-4473-07, LLChK-RTS-07, BLChH-ICIES-07 2006: Garousi-Thesis-06, EDGMPW-LNCS-3844-06,P-JSS-06, SPGM-LNCS-3844-06,EDGMPW-LNCS-3844-06, TZ-PEMT-06 BLCh-NET-06, AM-ICSEA-06, DM-LNCS-06, KLP-LNCS-4229-06 2005: Crane-Thesis-05, KAM-ENTCS-05, WK-CN-05,IZK-COTS-05,JILS-EDOC-05, AI-JSS-05,LGF-TSE-05, GHKM-EPEW-05, A-WOSP-05,RW-FMOODS-05, EFMSS-SDL-05,LHBZZ-SDL-05, GP-WOSP-05,JH-05,Cortellessa-TSE-05,BMIS-TSE-05, 2004: BCF-ISCIS-04, WK-SATNAC-04,JH-QEST-04,CGHKS-04,DPE-WOSP-04, PG-WICSA-04, Marzolla-PhD,BCF-ISCIS-04, LH-TCST-04,BFW-UML-04,WP-SIVOES-04,DFB-04,HLTLFS-TSE-04, 2003: XWP-TOOLS-03,PW-Real-03,SE-ENTCS-03,JHK-03,DiMarco-PHD, CDD-AOSD-03 No encontrados: Cooper-Dai-Deng-03},
    Crossref = {WOSP02},
    Doi = {10.1145/584369.584376},
    ISBN = {1-58113-563-7}
    }
  • P. Álvarez, J. A. Bañares, P. R. Muro-Medrano, and F. J. Zarazaga, “Integration of location based services for Field support in CRM systems,” GeoInformatics, vol. 5, iss. July/August, pp. 36-39, 2002.
    [Bibtex]
    @Article{Alvarez2002,
    Title = {Integration of location based services for Field support in CRM systems},
    Author = {P. \'Alvarez and J.A. Ba\~{n}ares and P.R. Muro-Medrano and F.J. Zarazaga},
    Journal = {GeoInformatics},
    Year = {2002},
    Number = {July/August},
    Pages = {36--39},
    Volume = {5},
    __markedentry = {[jcampos:]}
    }
  • [DOI] P. Ballarini, S. Bernardi, and S. Donatelli, “Validation and Evaluation of a Software Solution for Fault Tolerant Distributed Synchronization,” in 2002 International Conference on Dependable Systems and Networks (DSN 2002), 23-26 June 2002, Bethesda, MD, USA, Proceedings, 2002, pp. 773-784.
    [Bibtex]
    @InProceedings{Ballarini2002,
    Title = {Validation and Evaluation of a Software Solution for Fault Tolerant Distributed Synchronization},
    Author = {Paolo Ballarini and Simona Bernardi and Susanna Donatelli},
    Booktitle = {2002 International Conference on Dependable Systems and Networks {(DSN} 2002), 23-26 June 2002, Bethesda, MD, USA, Proceedings},
    Year = {2002},
    Pages = {773--784},
    Doi = {10.1109/DSN.2002.1029023}
    }
  • J. Campos, J. Casanovas, J. M. Colom, G. Martín, J. Martínez, A. Pont, R. Puigjaner, A. Robles, and M. R. Sancho, Informe sobre la adaptación de los estudios de TIC a la Declaración de BoloniaBarcelona, Spain: , 2002.
    [Bibtex]
    @Unpublished{CCCMMPPRS-02,
    Title = {Informe sobre la adaptaci\'on de los estudios de {TIC} a la {D}eclaraci\'on de {B}olonia},
    Author = {J. Campos and J. Casanovas and J.M. Colom and G. Mart\'{i}n and J. Mart\'{i}nez and A. Pont and R. Puigjaner and A. Robles and M.R. Sancho},
    Note = {In Spanish},
    Year = {2002},
    Address = {Barcelona, Spain},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cccmmpprs-02.pdf}
    }
  • J. Ezpeleta and L. Recalde, “A Deadlock Avoidance Approach for Non Sequential Resource Allocation Systems,” , 2002.
    [Bibtex]
    @InProceedings{Ezpeleta2002,
    Title = {A Deadlock Avoidance Approach for Non Sequential Resource Allocation Systems},
    Author = {J. Ezpeleta and L. Recalde},
    Booktitle = {Proc of the Int Conference on Systems Man and Cybernetics},
    Year = {2002},
    Address = {Hammamet, Tunisia},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. Ezpeleta, F. Tricas, F. García—-Vallés, and J. M. Colom, “Bankers–like approaches to deadlock avoidance in concurrent systems,” IEEE Transactions on Robotics and Automation, vol. 18, iss. 4, pp. 621-625, 2002.
    [Bibtex]
    @Article{Ezpeleta2002a,
    Title = {Bankers--like approaches to deadlock avoidance in concurrent systems},
    Author = {J. Ezpeleta and F. Tricas and F. Garc\'{i}a----Vall\'{e}s and J.M. Colom},
    Journal = {IEEE Transactions on Robotics and Automation},
    Year = {2002},
    Month = {August},
    Number = {4},
    Pages = {621--625},
    Volume = {18},
    Entrytype = {article},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. P. López-Grao, J. Merseguer, and J. Campos, “On the Use of Formal Models in Software Performance Evaluation,” in Actas de las X Jornadas de Concurrencia, Jaca, Spain, 2002, pp. 367-387.
    [Bibtex]
    @InProceedings{LGMC-02b,
    Title = {On the Use of Formal Models in Software Performance Evaluation},
    Author = {J.P. L{\'o}pez-Grao and J. Merseguer and J. Campos},
    Booktitle = {Actas de las {X} Jornadas de Concurrencia},
    Year = {2002},
    Address = {Jaca, Spain},
    Month = {June},
    Pages = {367-387},
    Publisher = {Universidad de Zaragoza},
    Abstract = {Importance of performance evaluation at first stages of the software development life-cycle has been progressively rising. We believe that the need for integration of formal models in the software engineering process is a must in order to apply well-known analysis techniques to software models. In previous papers it has been stated our proposal of extension of UML semantics for some diagram types and a complete method to translate them into GSPN models. Here we will focus on activity diagrams: a new translation method for them will be presented, while we explain their link with other UML diagrams such as statecharts so as to amplify the expressivity at system description. Last but not least, our CASE tool prototype will be introduced. As it will be seen, every modeling aspect for these diagrams will be covered and, thanks to it, the translation process will be automatically performed.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/lgmc-02b.pdf}
    }
  • J. P. López-Grao, J. Merseguer, and J. Campos, “Performance Engineering Based on UML and SPNs: A Software Performance Tool,” in Proceedings of the Seventeenth International Symposium on Computer and Information Sciences, Orlando, Florida, USA, 2002, pp. 405-409.
    [Bibtex]
    @InProceedings{LGMC-02c,
    Title = {Performance Engineering Based on {UML} and {SPNs}: A Software Performance Tool},
    Author = {J.P. L{\'o}pez-Grao and J. Merseguer and J. Campos},
    Booktitle = {Proceedings of the Seventeenth International Symposium on Computer and Information Sciences},
    Year = {2002},
    Address = {Orlando, Florida, USA},
    Month = {October},
    Organization = {University of Central Florida},
    Pages = {405-409},
    Publisher = {CRC Press},
    Abstract = {The increasing relevance of UML as a semi-formal modelling paradigm has entailed the need for an adjustment of the classical performance evaluation methods within the scope of the new working environment. Under these circumstances, a formal semantics for the UML language and a strong mathematical substratum are required in order to be able to compute performance estimates and validate logical properties in the first stages of the software life-cycle. We believe that stochastic Petri nets are specially suited for this aim. A compositional approach for the translation of several UML diagrams into analyzable Petri net models has there fore been considered in previous papers. Following this ap proach, we will focus here in the depiction of a model case study from the perspective of our new performance-oriented CASE tool.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/lgmc-02c.pdf}
    }
  • [DOI] J. Merseguer, S. Bernardi, J. Campos, and S. Donatelli, “A Compositional Semantics for UML State Machines Aimed at Performance Evaluation,” in Proceedings of the 6th International Workshop on Discrete Event Systems, Zaragoza, Spain, 2002, pp. 295-302.
    [Bibtex]
    @InProceedings{MBCD-wodes02,
    Title = {A Compositional Semantics for {UML} State Machines Aimed at Performance Evaluation},
    Author = {J. Merseguer and S. Bernardi and J. Campos and S. Donatelli},
    Booktitle = {Proceedings of the 6th International Workshop on Discrete Event Systems},
    Year = {2002},
    Address = {Zaragoza, Spain},
    Editor = {M. Silva and A. Giua and J.M. Colom},
    Month = {October},
    Pages = {295-302},
    Publisher = {IEEE Computer Society Press},
    Abstract = {Unified Modeling Language (UML) is gaining widespread acceptance as an effective way to describe the behaviour of systems. As such it has also attracted the attention of researchers that are interested in deriving, automatically, performance evaluation models from system's descriptions. A required step to automatically produce a performance model (as any executable model) is that the semantics of the description language is formally defined. Among the various models of UML we concentrate on States Machines and we build a semantics for them in terms of Generalized Stochastic Petri Nets, a well established modelling formalism for the performance evaluation of distributed systems. The paper introduces rules that allow to derive from a description of a system, expressed as a set of State Machines, an executable GSPN model. The semantics is compositional since the executable GSPN model is obtained by composing, using standard Petri Net operators, the GSPN models of the single State Machines, and each GSPN model is obtained by composition of submodels for State Machine basic features such as internal and outgoing transitions, states, actions, and events.},
    Doi = {10.1109/WODES.2002.1167702},
    Institution = {Departamento de Inform\'atica e Ingenier\'{\i}a de Sistemas, Universidad de Zaragoza},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/mbcd-wodes02.pdf}
    }
  • Actas de las X Jornadas de Concurrencia, J. Campos, J. Ezpeleta, J. Júlvez, J. Merseguer, C. J. Pérez-Jiménez, and F. Tricas, Eds., Zaragoza: Ed. Kronos. ISBN 84-88502-98-2, 2002. [Publisher URL]
    [Bibtex]
    @Book{JC-02,
    Title = {Actas de las {X} Jornadas de Concurrencia},
    Editor = {J. Campos and J. Ezpeleta and J. J{\'u}lvez and J. Merseguer and C.J. P{\'e}rez-Jim{\'e}nez and F. Tricas},
    Publisher = {Ed. Kronos. ISBN 84-88502-98-2},
    Year = {2002},
    Address = {Zaragoza},
    Month = {June},
    Url = {http://webdiis.unizar.es/jjcc02/}
    }

2001

  • P. Álvarez, J. A. Bañares, R. Béjar, S. Blasco, and M. A. Latre, “Integration of MapServer capabilities in an Automatic Vehicle Monitoring System to extend access through the Internet,” in 4th AGILE Conference on Geographic Information Science. GI in EUROPE: Integrative, Interoperable, Interactive, 2001, pp. 676-682.
    [Bibtex]
    @InProceedings{Alvarez2001,
    Title = {Integration of MapServer capabilities in an Automatic Vehicle Monitoring System to extend access through the Internet},
    Author = {P. \'Alvarez and J.A. Ba\~{n}ares and R. B\'ejar and S. Blasco and M.A. Latre},
    Booktitle = {4th AGILE Conference on Geographic Information Science. GI in EUROPE: Integrative, Interoperable, Interactive},
    Year = {2001},
    Pages = {676-682},
    __markedentry = {[jcampos:]}
    }
  • P. Álvarez, J. A. Bañares, R. Béjar, M. A. Latre, and P. Fernández, “LBS for Fleet Tracking and Management Services through the Internet,” in EC-GIS 2001, 7th European Commission GI & GIS Workshop, Managing the Mosaic, 2001.
    [Bibtex]
    @InProceedings{Alvarez2001a,
    Title = {LBS for Fleet Tracking and Management Services through the Internet},
    Author = {P. \'Alvarez and J.A. Ba\~{n}ares and R. B\'ejar and M. A. Latre and P. Fern\'andez},
    Booktitle = {EC-GIS 2001, 7th European Commission GI \& GIS Workshop, Managing the Mosaic},
    Year = {2001},
    __markedentry = {[jcampos:]}
    }
  • [DOI] S. Bernardi and G. Balbo, “Concurrent Generalized Petri Nets: Regenerative Conditions,” in Proceedings of the 9th International Workshop on Petri Nets and Performance Models, PNPM 2001, Aachen, Germany, September 11-14, 2001, 2001, pp. 125-134.
    [Bibtex]
    @InProceedings{Bernardi2001b,
    Title = {Concurrent Generalized Petri Nets: Regenerative Conditions},
    Author = {Simona Bernardi and Gianfranco Balbo},
    Booktitle = {Proceedings of the 9th International Workshop on Petri Nets and Performance Models, {PNPM} 2001, Aachen, Germany, September 11-14, 2001},
    Year = {2001},
    Pages = {125--134},
    Doi = {10.1109/PNPM.2001.953362}
    }
  • [DOI] S. Bernardi and S. Donatelli, “Performance Validation of Fault-Tolerance Software: A Compositional Approach,” in 2001 International Conference on Dependable Systems and Networks (DSN 2001) (formerly: FTCS), 1-4 July 2001, Göteborg, Sweden, Proceedings, 2001, pp. 379-388.
    [Bibtex]
    @InProceedings{Bernardi2001a,
    Title = {Performance Validation of Fault-Tolerance Software: {A} Compositional Approach},
    Author = {Simona Bernardi and Susanna Donatelli},
    Booktitle = {2001 International Conference on Dependable Systems and Networks {(DSN} 2001) (formerly: FTCS), 1-4 July 2001, G{\"{o}}teborg, Sweden, Proceedings},
    Year = {2001},
    Pages = {379--388},
    Doi = {10.1109/DSN.2001.941422}
    }
  • [DOI] S. Bernardi, S. Donatelli, and A. Horváth, “Implementing compositionality for stochastic Petri nets,” STTT, vol. 3, iss. 4, pp. 417-430, 2001.
    [Bibtex]
    @Article{Bernardi2001,
    Title = {{Implementing compositionality for stochastic Petri nets}},
    Author = {Simona Bernardi and Susanna Donatelli and Andr{\'{a}}s Horv{\'{a}}th},
    Journal = {{STTT}},
    Year = {2001},
    Number = {4},
    Pages = {417--430},
    Volume = {3},
    Doi = {10.1007/s100090100065}
    }
  • J. Campos, “Evaluación de Prestaciones de Sistemas Concurrentes Modelados con Redes de Petri,” in Actas de la XI Escuela de Verano de Informática de la Universidad de Castilla-La Mancha, Universidad de Castilla-La Mancha, Albacete, Spain, 2001, pp. 141-156.
    [Bibtex]
    @InProceedings{Cam-EVI-01,
    Title = {Evaluaci\'on de Prestaciones de Sistemas Concurrentes Modelados con Redes de {Petri}},
    Author = {J. Campos},
    Booktitle = {Actas de la {XI} Escuela de Verano de Inform\'atica de la Universidad de Castilla-La Mancha},
    Year = {2001},
    Address = {Universidad de Castilla-La Mancha, Albacete, Spain},
    Month = {July},
    Note = {In Spanish},
    Pages = {141-156},
    Publisher = {Departamento de Inform\'atica},
    Abstract = {Formal methods are the most suitable way to model and analyze several kinds of software systems. However, conventional methods are gaining placed in Software Engineering field because they can be easily applied in all the stages of the software life cycle. The combination of formal and conventional methods could be an interesting approach to describe and analyze some software aspects, as for example, the performance of the system. In this way, we make use of a software performance process enriched with formal techniques. The process has as important features that it uses UML as a design notation and it uses stochastic Petri nets as formal model. Petri nets provide a formal semantics for the system and a performance model, while UML supplies the framework and tools to document the system. The process is used in this article to present a performance comparison between software retrieval systems. Nowadays, there exist web sites that allow users to retrieve and install software in an easy way. The performance of these sites may be poor if they are used in wireless networks; the reason is the inadequate use of the net resources they need. In this article, we show that if this kind of systems are designed using mobile agent technology the previous problem might be avoided.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cam-evi-01.pdf}
    }
  • J. Ezpeleta, R.Novoa, and M. A. Barea, “Una herramienta para el estudio de técnicas de de análisis sintáctico,” Novática, iss. 151, pp. 53-56, 2001.
    [Bibtex]
    @Article{Ezpeleta2001,
    Title = {Una herramienta para el estudio de t\'{e}cnicas de de an\'{a}lisis sint\'{a}ctico},
    Author = {J. Ezpeleta and R.Novoa and M.A. Barea},
    Journal = {Nov\'{a}tica},
    Year = {2001},
    Month = {May},
    Number = {151},
    Pages = {53--56},
    Entrytype = {article},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • [DOI] J. Merseguer, J. Campos, and E. Mena, “A Performance Engineering Case Study: Software Retrieval System,” Lecture Notes in Computer Science, vol. 2047, pp. 317-332, 2001.
    [Bibtex]
    @Article{MCM-LNCS-01,
    Title = {A Performance Engineering Case Study: Software Retrieval System},
    Author = {J. Merseguer and J. Campos and E. Mena},
    Journal = {Lecture Notes in Computer Science},
    Year = {2001},
    Pages = {317-332},
    Volume = {2047},
    Abstract = {This chapter presents a case study in performance engineering. The case study consists of a Software Retrieval System based on agents. The system is modelled in a pragmatic way using the Unified Modeling Language and in a formal way using stochastic Petri Nets. Once the system has been modelled, performance figures are obtained from the formal model. Finally, some concluding remarks are obtained from our experience in the software performance process.},
    Address = {Heidelberg},
    Booktitle = {Performance Engineering. State of the Art and Current Trends},
    Doi = {10.1007/3-540-45156-0_20},
    Editor = {R. Dumke and C. Rautenstrauch and A. Schmietendorf and A. Scholz},
    Publisher = {Springer-Verlag},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/mcm-lncs-01.pdf}
    }
  • [DOI] J. Merseguer, J. Campos, and E. Mena, “Performance Analysis of Internet Based Software Retrieval Systems Using Petri Nets,” in Proceedings of the 4th ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, within the 7th International Conference on Mobile Computing and Networking, Rome, Italy, 2001, pp. 47-56.
    [Bibtex]
    @InProceedings{MCM-MSWiM-01,
    Title = {Performance Analysis of Internet Based Software Retrieval Systems Using {Petri} Nets},
    Author = {J. Merseguer and J. Campos and E. Mena},
    Booktitle = {Proceedings of the 4th {ACM} International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems, within the 7th International Conference on Mobile Computing and Networking},
    Year = {2001},
    Address = {Rome, Italy},
    Editor = {M. Meo and T. Dahlberg and L. Donatiello},
    Month = {July},
    Pages = {47-56},
    Publisher = {ACM},
    Abstract = {Nowadays, there exist web sites that allow users the retrieval and installation of software in an easy way. The performance of this task may be poor because of an inadequate use of the net resources. If these kind of systems were designed using mobile agent technology this problem might be avoided. In this paper, we present a comparison between the performance of a software retrieval system designed using mobile agents and the performance of a software retrieval system similar to the well-known Tucows or Download.com web sites. In order to compare performance, we make use of a software performance process enriched with formal techniques. The process has as important features that it uses UML as a design notation and it uses Petri nets as formal model. Petri nets provide a formal semantic for the system and a performance model.},
    Doi = {10.1145/381591.381604},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/mcm-mswim-01.pdf}
    }
  • J. Merseguer, J. Campos, and E. Mena, “Web-Based Versus Mobile Agent-Based Software Retrieval Systems: Performance Comparison,” in Actas de las IX Jornadas de Concurrencia, Sitges, Spain, 2001, pp. 299-312.
    [Bibtex]
    @InProceedings{MCM-JJCC-01,
    Title = {Web-Based Versus Mobile Agent-Based Software Retrieval Systems: Performance Comparison},
    Author = {J. Merseguer and J. Campos and E. Mena},
    Booktitle = {Actas de las {IX} Jornadas de Concurrencia},
    Year = {2001},
    Address = {Sitges, Spain},
    Month = {June},
    Pages = {299-312},
    Publisher = {Universitat Ramon Llull},
    Abstract = {Nowadays, there exist web sites that allow users to retrieve and install software in an easy way. The performance of these sites may be poor if they are used in wireless networks; the reason is the inadequate use of the net resources they need. If this kind of systems are designed using mobile agent technology the previous problem might be avoided. In this paper, we present a comparison between the performance of a software retrieval system especially designed to be used in wireless networks (e.g., mobile computers) and the performance of a software retrieval system similar to the well-known Tucows.com or Download.com web sites. In order to compare performance, we make use of a software performance process enriched with formal techniques. The process has as important features that it uses UML as a design notation and it uses stochastic Petri nets as formal model. Petri nets provide a formal semantics for the system and a performance model.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/mcm-jjcc-01.pdf}
    }
  • J. A. Bañares, P. Álvarez, R. Béjar, S. Blasco, and P. R. Muro-Medrano, “Enhancing Field Service Support in CRM Systems with LBS,” in EC-GIS 2001, 7th European Commission GI & GIS Workshop, Managing the Mosaic, 2001.
    [Bibtex]
    @InProceedings{Banares2001a,
    Title = {Enhancing Field Service Support in CRM Systems with LBS},
    Author = {J.A. Ba\~{n}ares and P. \'Alvarez and R. B\'ejar and S. Blasco and P.R. Muro-Medrano},
    Booktitle = {EC-GIS 2001, 7th European Commission GI \& GIS Workshop, Managing the Mosaic},
    Year = {2001},
    __markedentry = {[jcampos:]}
    }
  • J. A. Bañares, P. Álvarez, O. Cantán, P. Fernández, M. Casanovas, and P. R. Muro-Medrano, “Integration of location-based services for Field support in CRM,” in 4th AGILE Conference on Geographic Information Science. GI in EUROPE: Integrative, Interoperable, Interactive, 2001, pp. 501-508.
    [Bibtex]
    @InProceedings{Banares2001,
    Title = {Integration of location-based services for Field support in CRM},
    Author = {J.A. Ba\~{n}ares and P. \'Alvarez and O. Cant\'an and P. Fern\'andez and M. Casanovas and P. R. Muro-Medrano},
    Booktitle = {4th AGILE Conference on Geographic Information Science. GI in EUROPE: Integrative, Interoperable, Interactive},
    Year = {2001},
    Pages = {501-508},
    __markedentry = {[jcampos:]}
    }
  • [DOI] F. J. Zarazaga-Soria, P. Álvarez, J. A. Bañares, J. Nogueras, J. Valiño, and P. R. Muro-Medrano, “Examples of vehicle location systems using CORBA-based distributed real-time GPS data and services,” Computers, Environment and Urban Systems, vol. 25, iss. 3, pp. 293-305, 2001.
    [Bibtex]
    @Article{Zarazaga-Soria2001,
    Title = {Examples of vehicle location systems using CORBA-based distributed real-time GPS data and services},
    Author = {F.J. Zarazaga-Soria and P. \'{A}lvarez and J.A. Ba\~{n}ares and J. Nogueras and J. Vali\~{n}o and P.R. Muro-Medrano},
    Journal = {Computers, Environment and Urban Systems},
    Year = {2001},
    Number = {3},
    Pages = {293 - 305},
    Volume = {25},
    __markedentry = {[jcampos:]},
    Doi = {http://dx.doi.org/10.1016/S0198-9715(00)00027-2},
    ISSN = {0198-9715},
    Keywords = {Vehicle location systems, Distributed systems, Real-time GPS, CORBA},
    Url = {http://www.sciencedirect.com/science/article/pii/S0198971500000272}
    }

2000

  • J. Campos, “Petri Nets,” Departamento de Informática e Ingeniería de Sistemas, Universidad de Zaragoza, Internal Report , 2000.
    [Bibtex]
    @TechReport{C-RR-00-00,
    Title = {{Petri} Nets},
    Author = {J. Campos},
    Institution = {Departamento de Inform\'atica e Ingenier\'{\i}a de Sistemas},
    Year = {2000},
    Address = {Universidad de Zaragoza},
    Month = {February},
    Type = {Internal Report},
    Abstract = {A brief introduction (3 pages) to the topic for an Encyclopedia.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/c-rr-00-00.pdf}
    }
  • F. García–Vallés, J. M. Colom, and J. Ezpeleta, “Comment on “Deadlock Avoidance Policy for Petri–Net Modeling of Flexible Manufacturing Systems with Shared Resources”,” IEEE Transactions on Automatic Control, vol. 45, iss. 9, pp. 1760-1761, 2000.
    [Bibtex]
    @Article{F.Garcia-Valles2000a,
    Title = {Comment on ``Deadlock Avoidance Policy for Petri--Net Modeling of Flexible Manufacturing Systems with Shared Resources''},
    Author = {F. Garc\'{i}a--Vall\'{e}s and J.M. Colom and J. Ezpeleta},
    Journal = {IEEE Transactions on Automatic Control},
    Year = {2000},
    Month = {September},
    Number = {9},
    Pages = {1760--1761},
    Volume = {45},
    Entrytype = {article},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. García–Vallés, F. Tricas, J. M. Colom, and J. Ezpeleta, “Structuraly Safe Net Systems,” , pp. 441-448, 2000.
    [Bibtex]
    @InProceedings{Garcia-Valles2000,
    Title = {Structuraly Safe Net Systems},
    Author = {F. Garc\'{i}a--Vall\'{e}s and F. Tricas and J.M. Colom and J. Ezpeleta},
    Booktitle = {Discrete Event Systems: Analysis and Control. Proc. of the Workshop On Discrete Event Systems 2000},
    Year = {2000},
    Address = {Ghent, Belgium},
    Editor = {R. Boel and G. Stremersch},
    Month = {August},
    Pages = {441--448},
    Publisher = {Kluwer Academic Publishers},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. García–Vallés, F. Tricas, J. Ezpeleta, and J. M. Colom, “Structurally Safe Net Systems,” , pp. 441-448, 2000.
    [Bibtex]
    @InProceedings{F.Garcia-Valles2000,
    Title = {Structurally Safe Net Systems},
    Author = {F. Garc\'{i}a--Vall\'{e}s and F. Tricas and J. Ezpeleta and J.M. Colom},
    Booktitle = {Discrete Event Systems. Analysis and Control (WODES 2000)},
    Year = {2000},
    Address = {Belgium},
    Editor = {R. Boel, G. Stremersch},
    Month = {August},
    Pages = {441--448},
    Publisher = {Kluwer Academic Press},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • M. A. Latre, R. Béjar, P. Fernández, P. Álvarez, and P. R. Muro-Medrano, “Trying Java technology in a Geologic-Mining Information System distributed over an inter and intranet environment,” in Telegeo ‘2000. Second International Symposium on Telegeoprocessing, 2000.
    [Bibtex]
    @InProceedings{Latre2000,
    Title = {Trying Java technology in a Geologic-Mining Information System distributed over an inter and intranet environment},
    Author = {M. A. Latre and R. B\'ejar and P. Fern\'andez and P. \'Alvarez and P. R. Muro-Medrano},
    Booktitle = {Telegeo ‘2000. Second International Symposium on Telegeoprocessing},
    Year = {2000},
    __markedentry = {[jcampos:]}
    }
  • [DOI] J. Merseguer, J. Campos, and E. Mena, “A Pattern-Based Approach to Model Software Performance,” in Proceedings of the Second International Workshop on Software and Performance, Ottawa, Canada, 2000, pp. 137-142.
    [Bibtex]
    @InProceedings{MCM-WOSP-00,
    Title = {A Pattern-Based Approach to Model Software Performance},
    Author = {J. Merseguer and J. Campos and E. Mena},
    Booktitle = {Proceedings of the Second International Workshop on Software and Performance},
    Year = {2000},
    Address = {Ottawa, Canada},
    Month = {September},
    Pages = {137-142},
    Publisher = {ACM},
    Abstract = {The use of the object-oriented paradigm in the software industry is nowadays a reality. Approximations like frameworks, components, workflows or patterns are gaining place, sometimes to complement object-oriented development. Like the object-oriented paradigm of these approaches make special emphasis on the reuse of the software as a way to increase productivity. But the performance of software systems is not as good as desired. Thus, techniques to predict it are subject of research. Software Performance Engineering is concerned with these problems. Here we present an approach to reuse performance models developed in the early stages of the software development process. The approach has as a goal the use of formal models to predict performance.},
    Doi = {10.1145/350391.350421},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/mcm-wosp-00.pdf}
    }
  • J. Merseguer, J. Campos, and E. Mena, “Evaluating Performance on Mobile Agents Software Design,” in Actas de las VIII Jornadas de Concurrencia, Cuenca, Spain, 2000, pp. 291-307.
    [Bibtex]
    @InProceedings{MCM-JJCC-00,
    Title = {Evaluating Performance on Mobile Agents Software Design},
    Author = {J. Merseguer and J. Campos and E. Mena},
    Booktitle = {Actas de las VIII Jornadas de Concurrencia},
    Year = {2000},
    Address = {Cuenca, Spain},
    Editor = {D. Cazorla},
    Month = {June},
    Pages = {291-307},
    Publisher = {Universidad de Castilla-la Mancha},
    Abstract = {Software design and implementation using mobile agents are nowadays involved in a scepticism halo. There exist researchers who question its utility because it could be a new technology which no new skills but could introduce new problems. Security and performance are the most critical aspects for this new kind of software. In this contribution we present a formal approach to analyze performance for this class of systems. Our approach is integrated in the early stages of the software development process. In this way, it is possible to predict expected behaviour without the necessity of carry out the complete implementation phase. To show the approach, we model a software retrieval service system in a pragmatic way, after the corresponding formal model is obtained and analyzed in order to study performance.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/mcm-jjcc-00.pdf}
    }
  • J. Merseguer, J. Campos, and E. Mena, “Performance Evaluation for the Design of Agent-Based Systems: A Petri Net Approach,” in Proceedings of the Workshop on Software Engineering and Petri Nets, within the 21st International Conference on Application and Theory of Petri Nets, Aarhus, Denmark, 2000, pp. 1-20.
    [Bibtex]
    @InProceedings{MCM-SEPN-00,
    Title = {Performance Evaluation for the Design of Agent-Based Systems: A {Petri} Net Approach},
    Author = {J. Merseguer and J. Campos and E. Mena},
    Booktitle = {Proceedings of the Workshop on Software Engineering and Petri Nets, within the 21st International Conference on Application and Theory of Petri Nets},
    Year = {2000},
    Address = {Aarhus, Denmark},
    Editor = {Mauro Pezz{\'e} and Sol M. Shatz},
    Month = {June},
    Pages = {1-20},
    Publisher = {University of Aarhus},
    Abstract = {Software design and implementation using mobile agents are nowadays involved in a scepticism halo. There exist researchers who question its utility because it is a new technology that could provide no new skills but it could introduce new problems. Security and performance are the most critical aspects for this new kind of software. In this contribution we present a formal approach to analyze performance for this class of systems. Our approach is integrated in the early stages of the software development process. In this way, it is possible to predict expected behaviour without the necessity to carry out the complete implementation phase. To show the approach, we model a software retrieval service system in a pragmatic way, after the corresponding formal model is obtained and analyzed in order to study performance.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/mcm-sepn-00.pdf}
    }
  • F. Tricas, J. M. Colom, and J. Ezpeleta, “Some Improvements to the Banker�s Algorithm Based on the Process Structure,” , pp. 2853-2858, 2000.
    [Bibtex]
    @InProceedings{F.Tricas2000a,
    Title = {Some Improvements to the Banker�s Algorithm Based on the Process Structure},
    Author = {F. Tricas and J.M. Colom and J. Ezpeleta},
    Booktitle = {Proceedings of the 2000 IEEE International Conference on Robotics \& Automation (ICRA�2000).},
    Year = {2000},
    Address = {San Francisco, California},
    Month = {April},
    Organization = {IEEE Robotics and Automation Society},
    Pages = {2853--2858},
    Publisher = {IEEE},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. Tricas and J. Ezpeleta, “A Partial Approach to the Problem of Deadlocks in Processes with Resour ces,” , pp. 135-150, 2000.
    [Bibtex]
    @InProceedings{Tricas2000,
    Title = {A Partial Approach to the Problem of Deadlocks in Processes with Resour ces},
    Author = {F. Tricas and J. Ezpeleta},
    Booktitle = {citeFarwerMoldtStehr},
    Year = {2000},
    Pages = {135--150},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. Tricas, F. García–Vallés, J. M. Colom, and J. Ezpeleta, “An Iterative Method for Deadlock Prevention in FMS,” , pp. 139-148, 2000.
    [Bibtex]
    @InProceedings{F.Tricas2000,
    Title = {An Iterative Method for Deadlock Prevention in FMS},
    Author = {F. Tricas and F. Garc\'{i}a--Vall\'{e}s and J.M. Colom and J. Ezpeleta},
    Booktitle = {Discrete Event Systems. Analysis and Control (WODES 2000)},
    Year = {2000},
    Address = {Belgium},
    Editor = {R. Boel, G. Stremersch},
    Month = {August},
    Pages = {139--148},
    Publisher = {Kluwer Academic Press},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. Tricas, F. García–Vallés, J. M. Colom, and J. Ezpeleta, “An Iterative Method for Deadlock Prevention in FMS,” , pp. 139-148, 2000.
    [Bibtex]
    @InProceedings{Tricas2000a,
    Title = {An Iterative Method for Deadlock Prevention in FMS},
    Author = {F. Tricas and F. Garc\'{i}a--Vall\'{e}s and J.M. Colom and J. Ezpeleta},
    Booktitle = {Discrete Event Systems: Analysis and Control. Proc. of the Workshop On Discrete Event Systems 2000},
    Year = {2000},
    Address = {Ghent, Belgium},
    Editor = {R. Boel and G. Stremersch},
    Month = {August},
    Pages = {139--148},
    Publisher = {Kluwer Academic Publishers},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. J. Zarazaga, P. Álvarez, J. Guillo, and V. J. R. López, “Use Cases of vehicle location systems based on distributed real-time GPS data,” in Telegeo ‘2000. Second International Symposium on Telegeoprocessing, 2000.
    [Bibtex]
    @InProceedings{Zarazaga2000,
    Title = {Use Cases of vehicle location systems based on distributed real-time GPS data},
    Author = {F.J. Zarazaga and P. \'Alvarez and J. Guillo and R. L\'opez, J. Vali\~{n}o},
    Booktitle = {Telegeo ‘2000. Second International Symposium on Telegeoprocessing},
    Year = {2000},
    __markedentry = {[jcampos:]}
    }
  • F. J. Zarazaga, R.López, J. Nogueras, O. Cantán, P. Álvarez, and P.R.Muro-Medrano, “Cataloguing and recovering distributed geospatial data, a Java approach to build the OpenGIS Catalog Services,” in EC-GIS 2000, 6th European Commission GI and GIS Workshop, 2000.
    [Bibtex]
    @InProceedings{Zarazaga2000b,
    Title = {Cataloguing and recovering distributed geospatial data, a Java approach to build the OpenGIS Catalog Services},
    Author = {F.J. Zarazaga and R.L\'opez and J. Nogueras and O. Cant\'an and P. \'Alvarez and P.R.Muro-Medrano},
    Booktitle = {EC-GIS 2000, 6th European Commission GI and GIS Workshop},
    Year = {2000},
    __markedentry = {[jcampos:]}
    }
  • F. J. Zarazaga, R.López, J. Nogueras, O. Cantán, P. Álvarez, and P.R.Muro-Medrano, “First Steps to Set Up Java Components for the OpenGIS Catalog Services and its Software Infrastructure,” in 3rd AGILE Conference on Geographic Information Science, 2000.
    [Bibtex]
    @InProceedings{Zarazaga2000a,
    Title = {First Steps to Set Up Java Components for the OpenGIS Catalog Services and its Software Infrastructure},
    Author = {F.J. Zarazaga and R.L\'opez and J. Nogueras and O. Cant\'an and P. \'Alvarez and P.R.Muro-Medrano},
    Booktitle = {3rd AGILE Conference on Geographic Information Science},
    Year = {2000},
    __markedentry = {[jcampos:]}
    }

1999

  • J. Campos, “PNPM’99-PAPM’99-NSMC’99 Tutorial: Properties and Bounds on P/T Nets,” in Tutorials of the 8th International Workshop on Petri Nets and Performance Models, 7th International Workshop on Process Algebra and Performance Modelling, and 3rd International Meeting on Numerical Solution of Markov Chains, Zaragoza, Spain, 1999.
    [Bibtex]
    @InProceedings{C-Zaragoza-99,
    Title = {{PNPM'99-PAPM'99-NSMC'99 Tutorial}: Properties and Bounds on {P/T} Nets},
    Author = {J. Campos},
    Booktitle = {Tutorials of the 8th International Workshop on Petri Nets and Performance Models, 7th International Workshop on Process Algebra and Performance Modelling, and 3rd International Meeting on Numerical Solution of Markov Chains},
    Year = {1999},
    Address = {Zaragoza, Spain},
    Month = {September},
    Abstract = {A complementary approach to exact or approximation techniques for the analysis of timed or stochastic Petri net models is the computation of bounds for their performance measures. Performance bounds are useful in the preliminary phases of the design of a system, in which many parameters are not known accurately. Several alternatives for those parameters should be quickly evaluated, and rejected those that are clearly bad. Exact (and even approximate) solutions would be computationally very expensive. Bounds become useful in these instances since they usually require much less computation effort. In this tutorial, net-driven techniques for the computation of bounds for the main performance indices of timed Petri net models are considered. Special attention is given tothe intimate relationship between qualitative and quantitative aspects of Petri nets. In particular, the intensive use of structure theory of net models allows to obtain very efficient computation techniques.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/c-zaragoza-99.pdf}
    }
  • [DOI] J. Campos, S. Donatelli, and M. Silva, “Structured Solution of Asynchronously Communicating Stochastic Modules,” IEEE Transactions on Software Engineering, vol. 25, iss. 2, pp. 147-165, 1999.
    [Bibtex]
    @Article{CDS-TSE-99,
    Title = {Structured Solution of Asynchronously Communicating Stochastic Modules},
    Author = {J. Campos and S. Donatelli and M. Silva},
    Journal = {IEEE Transactions on Software Engineering},
    Year = {1999},
    Month = {March},
    Number = {2},
    Pages = {147-165},
    Volume = {25},
    Abstract = {Asynchronously Communicating Stochastic Modules (SAM) are Petri nets that can be seen as a set of modules that communicate through buffers, so they are not (yet another) Petri net subclass, but they complement a net with a structured view. This paper considers the problem of exploiting the compositionality of the view to generate the state space and to find the steady-state probabilities of a stochastic extension of SAM in a net-driven, efficient way. Essentially, we give an expression of an auxiliary matrix, G, which is a supermatrix of the infinitesimal generator of a SAM. G is a tensor algebra [Davio 1981] expression of matrices of the size of the components for which it is possible to numerically solve the characteristic steady-state solution equation pi.G = 0, without the need to explicitly compute G. Therefore, we obtain a method that computes the steady-state solution of a SAM without ever explicitly computing and storing its infinitesimal generator, and therefore without computing and storing the reachability graph of the system. Some examples of application of the technique are presented and compared to previous approaches.},
    Doi = {10.1109/32.761442},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cds-tse-99.pdf}
    }
  • [DOI] C. J. Pérez-Jiménez and J. Campos, “On State Space Decomposition for the Numerical Analysis of Stochastic Petri Nets,” in Proceedings of the 8th International Workshop on Petri Nets and Performance Models, Zaragoza, Spain, 1999, pp. 32-41.
    [Bibtex]
    @InProceedings{PJC-PNPM99,
    Title = {On State Space Decomposition for the Numerical Analysis of Stochastic {Petri} Nets},
    Author = {C.J. P{\'e}rez-Jim{\'e}nez and J. Campos},
    Booktitle = {Proceedings of the 8th International Workshop on Petri Nets and Performance Models},
    Year = {1999},
    Address = {Zaragoza, Spain},
    Month = {September},
    Pages = {32-41},
    Publisher = {IEEE Computer Society Press},
    Abstract = {Net-driven decomposition techniques are considered in this paper in order to reduce the state explosion problem for the computation of performance indices of stochastic Petri nets. Basically, the idea is to represent (or partially represent) in a decomposed manner the reachability graph of the model so it can be used for exact and/or approximated performance analysis. In that way, the complete storing of the graph is avoided and, for the case of approximate analysis, the solution of the isomorphous continuous time Markov chain is substituted by the solution of smaller components. The techniques are applied to a couple of non-trivial models.},
    Doi = {10.1109/PNPM.1999.796530},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pjc-pnpm99.pdf}
    }
  • C. J. Pérez-Jiménez and J. Campos, “On State Space Decomposition for the Numerical Analysis of Stochastic Petri Nets,” in Actas de las VII Jornadas de Concurrencia, Gandía, Spain, 1999, pp. 249-268.
    [Bibtex]
    @InProceedings{PJC-JJCC99,
    Title = {On State Space Decomposition for the Numerical Analysis of Stochastic {Petri} Nets},
    Author = {C. J. P{\'e}rez-Jim{\'e}nez and J. Campos},
    Booktitle = {Actas de las VII Jornadas de Concurrencia},
    Year = {1999},
    Address = {Gand{\'{\i}}a, Spain},
    Editor = {J.M. Bernab{\'e}u and F.D. Mu{\~n}oz},
    Month = {June},
    Pages = {249-268},
    Publisher = {Universidad Polit{\'e}cnica de Valencia},
    Abstract = {Stochastic Petri nets is a well-known formalism adequate for the design, validation, and performance evaluation of discrete event systems, computer systems, manufacturing systems, telecommunication networks, and so on. In this paper, we deal with three different techniques to decompose the state space of a general stochastic Petri net that can be used to decrease the time and memory requirements of numerical analysis algorithms. The presented techniques are based on the divide and conquer principle to compute from the original model several submodels. These submodels can be used for a functional analysis, structural analysis and performance evaluation (exact and approximate). In this paper we apply the techniques to approximate throughput computation.}
    }
  • F. Tricas, J. M. Colom, and J. Ezpeleta, “A solution to the problem of deadlocks in concurrent systems using Petri nets and integer linear programming,” , pp. 542-546, 1999.
    [Bibtex]
    @InProceedings{F.Tricas1999,
    Title = {A solution to the problem of deadlocks in concurrent systems using Petri nets and integer linear programming},
    Author = {F. Tricas and J.M. Colom and J. Ezpeleta},
    Booktitle = {Simulation in Industry},
    Year = {1999},
    Address = {Erlangen, Germany},
    Month = {October},
    Pages = {542--546},
    Publisher = {Society for Computer Simulation International},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. Tricas, J. M. Colom, and J. Ezpeleta, “A solution to the problem of deadlocks in concurrent systems using Petri nets and integer linear programming,” , pp. 542-546, 1999.
    [Bibtex]
    @InProceedings{Tricas1999,
    Title = {A solution to the problem of deadlocks in concurrent systems using Petri nets and integer linear programming},
    Author = {F. Tricas and J.M. Colom and J. Ezpeleta},
    Booktitle = {Proc. of the 11th European Simulation Symposium},
    Year = {1999},
    Address = {Erlangen, Germany},
    Editor = {G. Horton and D. Moller and U. Rude},
    Month = {October},
    Organization = {The society for Computer Simulation Int.},
    Pages = {542--546},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. Tricas and J. Ezpeleta, “A Petri Net Solution to the Problem of Deadlocks in Systems of Processes with Resources.,” , pp. 1047-1056, 1999.
    [Bibtex]
    @InProceedings{Tricas1999a,
    Title = {A Petri Net Solution to the Problem of Deadlocks in Systems of Processes with Resources.},
    Author = {F. Tricas and J. Ezpeleta},
    Booktitle = {Proc. of the 7th IEEE Int. Conf. on Emerging Technologies and Factory Automation (ETFA)},
    Year = {1999},
    Address = {Barcelona},
    Month = {October},
    Pages = {1047--1056},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }

1998

  • J. Campos, “Performance Bounds” in Performance Models for Discrete Event Systems with Synchronizations: Formalisms and Analysis Techniques, G. Balbo and M. Silva, Eds., Zaragoza, Spain: Editorial KRONOS, 1998, pp. 587-635.
    [Bibtex]
    @InCollection{C-MATCH17-98,
    Title = {Performance Bounds},
    Author = {J. Campos},
    Booktitle = {Performance Models for Discrete Event Systems with Synchronizations: Formalisms and Analysis Techniques},
    Publisher = {Editorial KRONOS},
    Year = {1998},
    Address = {Zaragoza, Spain},
    Chapter = {17},
    Editor = {G. Balbo and M. Silva},
    Month = {September},
    Pages = {587-635},
    Abstract = {A complementary approach to exact or approximation techniques for the analysis of queueing network models is the computation of bounds for their performance measures. Performance bounds are useful in the preliminary phases of the design of a system, in which many parameters are not known accurately. Several alternatives for those parameters should be quickly evaluated, and rejected those that are clearly bad. Exact (and even approximate) solutions would be computationally very expensive. Bounds become useful in these instances since they usually require much less computation effort. In this chapter, we concentrate in net-driven techniques for the computation of bounds for the main performance indices of timed Petri net models. Previous works on bounds computation for classical queueing networks are not included here and the interested reader is referred to the bibliographic remarks in Section 17.5. The presented techniques are characterized by their interest in stressing the intimate relationship between qualitative and quantitative aspects of Petri nets. In particular, the intensive use of structure theory of net models allows to obtain very efficient computation techniques. The organization of the chapter is the following. In Section 17.1, a general approach for the computation of upper and lower bounds for arbitrary linear functions of average marking of places and throughput of transitions of both timed Place/Transition nets and timed Well-Formed Coloured nets is presented. Section 17.2 includes a more intuitive approach for the computation of throughput upper bounds, even if it is valid only for restricted Petri net subclasses. The relation of this technique with the general approach and the attainability of the bound for a particular subclass of nets is included. In Section 17.3, two possible improvements of upper and lower throughput bounds are presented using implicit places and liveness bounds of transitions, respectively. All the bounds computed in Sections 17.1, 17.2 and 17.3 are insensitive to the timing probability distributions since they are based only on the knowledge of the average service times. Section 17.4 includes a brief overview of three additional techniques for the improvement of the bounds. Since some additional assumptions on the form of the probability distribution functions associated to the service of transitions or on the conflict resolution policies are done, the obtained bounds are non-insensitive. Finally, some bibliographic remarks are included in Section 17.5.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/c-match17-98.pdf}
    }
  • J. Campos, “Performance Measures and Basic Properties” in Performance Models for Discrete Event Systems with Synchronizations: Formalisms and Analysis Techniques, G. Balbo and M. Silva, Eds., Zaragoza, Spain: Editorial KRONOS, 1998, pp. 285-304.
    [Bibtex]
    @InCollection{C-MATCH8-98,
    Title = {Performance Measures and Basic Properties},
    Author = {J. Campos},
    Booktitle = {Performance Models for Discrete Event Systems with Synchronizations: Formalisms and Analysis Techniques},
    Publisher = {Editorial KRONOS},
    Year = {1998},
    Address = {Zaragoza, Spain},
    Chapter = {8},
    Editor = {G. Balbo and M. Silva},
    Month = {September},
    Pages = {285-304},
    Abstract = {A goal of performance modelling with timed Petri nets (TPN's) is the estimation of some quantifiable performance measures of the system under consideration by the simulation or analysis of the model of the system behaviour. In order to do that, responsiveness and utilization performance measures of the system must be described in terms of average values of operational quantities defined on the TPN model, like the average marking of a place or the firing frequency of a transition. In Section 8.1, the usual average performance indices for TPN models are derived operationally from the basic observable events that were defined in Chapter 3. Sections 8.2 and 8.3 are devoted to exploit the operational approach for the definition of performance measures. In Section 8.2, operational analysis techniques are used to partially characterize the behaviour of TPN models. Classical operational laws, like Little's law are stated in Petri net terms. Additionally, some operational inequalities are derived that are typical of the presence of synchronization and that have not been considered before in the framework of queueing networks models. Section 8.3 illustrates another aspect of the deep gap, from the analytical point of view, existing between classical monoclass product-form queueing networks and TPN's. While in Gordon-Newell networks the vector of visit ratios to the stations can be easily (efficiently) computed from the routing information, in the case of bounded TPN's the computability of such index is a quite complex problem. This problem leads to a classification of net models attending to the dependency of the visit ratios on the net structure and the probabilistic routing, on the initial marking, and on the firing time of transitions. Since few operational analysis techniques can presently be used to compute the performance indices of interest, the classical approach based on stochastic processes must be considered. Section 8.4 introduces also the definition of performance parameters on the TPN model as expected values of the random variables that characterize the behaviour of the model, under some stochastic assumptions. As the reader surely knows, under ergodicity conditions the average (operationally defined) performance indices are equal to the expected (stochastically defined) indices, thus the techniques that will be presented later on for the computation of expected values will be useful to compute the average performance measures of interest. Some bibliographic remarks are summarized in Section 8.5.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/c-match8-98.pdf}
    }
  • J. Campos, “Response Time Approximation for Stochastic Marked Graphs” in Performance Models for Discrete Event Systems with Synchronizations: Formalisms and Analysis Techniques, G. Balbo and M. Silva, Eds., Zaragoza, Spain: Editorial KRONOS, 1998, pp. 797-817.
    [Bibtex]
    @InCollection{C-MATCH23-98,
    Title = {Response Time Approximation for Stochastic Marked Graphs},
    Author = {J. Campos},
    Booktitle = {Performance Models for Discrete Event Systems with Synchronizations: Formalisms and Analysis Techniques},
    Publisher = {Editorial KRONOS},
    Year = {1998},
    Address = {Zaragoza, Spain},
    Chapter = {23},
    Editor = {G. Balbo and M. Silva},
    Month = {September},
    Pages = {797-817},
    Abstract = {A general iterative technique for approximate throughput computation of strongly connected stochastic marked graphs (SMG's) is presented in this Chapter. We consider SMG's with time and marking independent exponentially distributed service times associated with transitions. The approach has two basic foundations. First, it is deeply based on qualitative theory of MG's. More precisely, given an arbitrary cut (subset of places producing a net partition), a structural decomposition technique is developed that allows us to split a strongly connected MG into two aggregated subsystems and a basic skeleton system. And what is more important, the behaviours of the subsystems, including steps, language of firing sequences and reachable markings, are equivalent to the whole system behaviour (projected on the corresponding subsets of nodes). Second, after the decomposition phase, an iterative response time approximation method is applied for the computation of the throughput. Experimental results on several examples generally have an error of less than 3%. The state space is usually reduced by more than one order of magnitude; therefore the analysis of otherwise intractable systems is possible. The Chapter is organized as follows. In Section 23.1, some fundamental properties on MG's and implicit places are presented. Section 23.2 includes the structural decomposition of MG's used in the rest of the Chapter. The iterative technique for approximate throughput computation is described in Section 23.3. Section 23.4 includes several application examples to illustrate the introduced technique. Finally, some bibliographic remarks are included in Section 23.5.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/c-match23-98.pdf}
    }
  • J. Ezpeleta, F. García, and J. M. Colom, “A Class of Well Structured Petri Nets for Flexible Manufacturing Systems,” , vol. 1420, pp. 65-83, 1998.
    [Bibtex]
    @InBook{Ezpeleta1998,
    Title = {A {C}lass of {W}ell {S}tructured {P}etri {N}ets for {F}lexible {M}anufacturing {S}ystems},
    Author = {J. Ezpeleta and F. Garc\'{i}a and J.M. Colom},
    Editor = {Jorg Desel and Manuel Silva},
    Pages = {65-83},
    Publisher = {Springer Verlag},
    Year = {1998},
    Address = {Lisbon, Portugal},
    Month = {June},
    Volume = {1420},
    Entrytype = {inbook}
    }
  • J. Ezpeleta, F. García, and J. M. Colom, “A Class of Well Structured Petri Nets for Flexible Manufacturing Systems,” , vol. 1420, pp. 65-83, 1998.
    [Bibtex]
    @InBook{J.Ezpeleta1998,
    Title = {A Class of Well Structured Petri Nets for Flexible Manufacturing Systems},
    Author = {J. Ezpeleta and F. Garc\'{i}a and J.M. Colom},
    Editor = {Jorg Desel and Manuel Silva},
    Pages = {65--83},
    Publisher = {Springer Verlag},
    Year = {1998},
    Address = {Lisbon, Portugal},
    Month = {June},
    Volume = {1420},
    Entrytype = {inbook},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. García, F. Tricas, J. Ezpeleta, and J. M. Colom, “Optimal Control of Discrete Event Systems,” , pp. 88-93, 1998.
    [Bibtex]
    @InProceedings{F.Garcia1998,
    Title = {Optimal Control of Discrete Event Systems},
    Author = {F. Garc\'{i}a and F. Tricas and J. Ezpeleta and J.M. Colom},
    Booktitle = {International Workshop on Discrete Event Systems (WODES�98)},
    Year = {1998},
    Address = {Cagliari, Italy},
    Month = {August},
    Pages = {88--93},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. García–Vallés, F. Tricas, J. M. Colom, and J. Ezpeleta, “Optimal control of discrete event systems,” , 1998.
    [Bibtex]
    @InProceedings{Garcia-Valles1998,
    Title = {Optimal control of discrete event systems},
    Author = {F. Garc\'{i}a--Vall\'{e}s and F. Tricas and J.M. Colom and J. Ezpeleta},
    Booktitle = {Proc. of the Int. Workshop on Discrete Event Systems(WODES98)},
    Year = {1998},
    Month = {August},
    Organization = {IEE Control},
    Publisher = {IEE},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • C. J. Pérez-Jiménez and J. Campos, “A Response Time Approximation Technique for Stochastic General P/T Systems,” in Proceedings of the 2nd IMACS International Multiconference on Computational Engineering in Systems Applications (CESA’98), Hammamet, Tunisia, 1998.
    [Bibtex]
    @InProceedings{PJC-98,
    Title = {A Response Time Approximation Technique for Stochastic General {P/T} Systems},
    Author = {C.J. P{\'e}rez-Jim{\'e}nez and J. Campos},
    Booktitle = {Proceedings of the 2nd IMACS International Multiconference on Computational Engineering in Systems Applications (CESA'98)},
    Year = {1998},
    Address = {Hammamet, Tunisia},
    Month = {April},
    Abstract = {Stochastic Petri nets is a well-known formalism adequate for the design, validation, and performance evaluation of discrete event and manufacturing systems. In this paper, we deal with steady-state throughput approximation of complex concurrent systems modelled with stochastic Petri nets. More precisely, we generalize to arbitrary stochastic P/T systems a response time approximation technique that was firstly proposed for special net subclasses. The presented technique is based on the divide and conquer principle and it is achieved in two steps. The first one, a net-driven decomposition of the model into several subsystems and the second one, an iterative solution algorithm that computes a throughput approximation of the original model transitions based on the solution of the embedded continuous time Markov chain of the subsystems. Experimental results on several examples generally have an error of less than 5%, and the state space is usually reduced by more than one order of magnitude.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pjc-98.pdf}
    }
  • J. Romero, J. Merseguer, and O. Barberá J.M.and Pastor, “Una Herramienta de Generación Automática de Software,” in Actas de IDEAS–98 — I Workshop Iberoamericano en Ingeniería de Requisitos y Ambientes Software, Porto Alegre, Brasil, 1998, pp. 157-169.
    [Bibtex]
    @InProceedings{Romero1998,
    Title = {Una Herramienta de Generaci\'{o}n Autom\'{a}tica de Software},
    Author = {Romero,J. and Merseguer,J. and Barber\'{a},J.M.and Pastor,O.},
    Booktitle = {Actas de IDEAS--98 -- I Workshop Iberoamericano en Ingenier\'{i}a de Requisitos y Ambientes Software},
    Year = {1998},
    Address = {Porto Alegre, Brasil},
    Month = {April},
    Pages = {157--169}
    }
  • M. Silva and J. Campos, “Introduction to Net-Driven Decomposition Techniques” in Performance Models for Discrete Event Systems with Synchronizations: Formalisms and Analysis Techniques, G. Balbo and M. Silva, Eds., Zaragoza, Spain: Editorial KRONOS, 1998, pp. 693-718.
    [Bibtex]
    @InCollection{SC-MATCH20-98,
    Title = {Introduction to Net-Driven Decomposition Techniques},
    Author = {M. Silva and J. Campos},
    Booktitle = {Performance Models for Discrete Event Systems with Synchronizations: Formalisms and Analysis Techniques},
    Publisher = {Editorial KRONOS},
    Year = {1998},
    Address = {Zaragoza, Spain},
    Chapter = {20},
    Editor = {G. Balbo and M. Silva},
    Month = {September},
    Pages = {693-718},
    Abstract = {As stated in previous chapters, a fundamental question in the use of stochastic Petri net models for performance evaluation, even under Markovian stochastic interpretation, is the so called state explosion problem. A general approach to deal with (computational) complexity is to use a divide and conquer strategy, what requires the definition of a decomposition method and the subsequent composition of partial results to get the full solution. On the other hand, the trade-off between computational cost and accuracy of the solution leads to the use of approximation or bounding techniques (for instance, throughput bounds can be computed in polynomial time on the number of transitions and places, see Chapter 17). In this context, a pragmatic compromise to be handled by the analyzer of a system concerns the definition of faithful models, that may be very complex to exactly analyse (what may lead to the use of approximation or just bounding techniques), or simplified models, for which exact analysis can be, eventually, accomplished. Divide and conquer strategies can be used with exact, approximate, or bounding techniques. The techniques for performance evaluation present in the literature consider either implicit or explicit decomposition of net models. In [7] (see Chapter 17), an implicit decomposition into P-semiflows is used for computing throughput bounds for arbitrary pdf of time durations. In [19] (see Chapter 12), a decomposition into disjoint modules (usually subnets generated by P-semiflows) is defined by the analyzer or provided by model construction; the computational technique uses directly the information provided by the modules to compute exact global limit probability distribution vector. In [8], a decomposition into modules (connected through buffers) should also be provided. In this case, the modules are complemented with an abstract view of their environment in the full model, and the approximate solution is computed through an iterative technique looking for a fixed point (details will be presented in Chapter 23). In the sequel of this Chapter and in a general context, components will refer to (eventually) complemented modules. They are just the elements used to build the full solution. In order to get efficient techniques, the decomposition and, eventually, complementation process should be net-driven (i.e., derived at net level). For this, we shall use PN's structure theory concepts and techniques (e.g., P-semiflows, implicit places, etc.). The Chapter is organised as follows. The main ideas behind net-driven decompositions of PN's are introduced in Section 20.1: the conservative and consistent components (Section 20.1.1), an example of implicit search technique into conservative components (Section 20.1.2), an explicit decomposition of nets, designating the modules to be used (Section 20.1.3), and the complementation of modules to get components (that include information from the environment), using implicit places (Section 20.1.4). A taxonomy for net-driven decomposition techniques is proposed in Section 20.2, providing a framework for the consideration of a significant number of performance evaluation methods. Several representative examples of techniques present in the literature are briefly overviewed and classified according with the classification criteria. Some concluding remarks are included in Section 20.3.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/sc-match20-98.pdf}
    }
  • M. Silva and J. Campos, “Performance Evaluation of DEDS with Conflicts and Synchronizations: Net-Driven Decomposition Techniques,” in Proceedings of the 4th International Workshop on Discrete Event Systems, Cagliari, Italy, 1998, pp. 398-413.
    [Bibtex]
    @InProceedings{SC-wodes98,
    Title = {Performance Evaluation of {DEDS} with Conflicts and Synchronizations: Net-Driven Decomposition Techniques},
    Author = {M. Silva and J. Campos},
    Booktitle = {Proceedings of the 4th International Workshop on Discrete Event Systems},
    Year = {1998},
    Address = {Cagliari, Italy},
    Month = {August},
    Pages = {398-413},
    Publisher = {IEE Control},
    Abstract = {A fundamental question in performance evaluation, even under Markovian interpretation, is the so called state explosion problem, what arises if no closed solution exists (e.g., a product-form). In order to deal with computationally complex problems, divide and conquer strategies are sometimes successful. Here we focus on the applicability of net structure theory to the decomposition phase. A taxonomy using two criteria allows to situate many performance evaluation techniques in the literature. The solution or composition phase may employ techniques as different as Kronecker algebra, response time approximation or bottleneck analysis.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/sc-wodes98.pdf}
    }
  • F. Tricas, F. García, J. M. Colom, and J. Ezpeleta, “A Structural Approach to the Problem of Deadlock Prevention in Processes with Resources,” , pp. 273-278, 1998.
    [Bibtex]
    @InProceedings{F.Tricas1998,
    Title = {A Structural Approach to the Problem of Deadlock Prevention in Processes with Resources},
    Author = {F. Tricas and F. Garc\'{i}a and J.M. Colom and J. Ezpeleta},
    Booktitle = {International Workshop on Discrete Event Systems (WODES�98)},
    Year = {1998},
    Address = {Cagliari, Italy},
    Month = {August},
    Pages = {273--278},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • F. Tricas, F. García–Vallés, J. M. Colom, and J. Ezpeleta, “A Structural Approach to the Problem of Deadlock Prevention in Processes with Resources,” , pp. 273-278, 1998.
    [Bibtex]
    @InProceedings{Tricas1998,
    Title = {A Structural Approach to the Problem of Deadlock Prevention in Processes with Resources},
    Author = {F. Tricas and F. Garc\'{i}a--Vall\'{e}s and J.M. Colom and J. Ezpeleta},
    Booktitle = {Proc. of the Int. Workshop on Discrete Event Systems(WODES98)},
    Year = {1998},
    Month = {August},
    Organization = {IEE Control},
    Pages = {273--278},
    Publisher = {IEE},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }

1997

  • B. Baynat and J. Campos, “PNPM’97 Tutorial: Approximate Methods Based on Net-Driven Decompositions,” in Tutorials of the 7th International Workshop on Petri Nets and Performance Models, Saint Malo, France, 1997.
    [Bibtex]
    @InProceedings{BC-StMalo-97,
    Title = {{PNPM'97 Tutorial}: Approximate Methods Based on Net-Driven Decompositions},
    Author = {B. Baynat and J. Campos},
    Booktitle = {Tutorials of the 7th International Workshop on Petri Nets and Performance Models},
    Year = {1997},
    Address = {Saint Malo, France},
    Month = {June},
    Abstract = {A major drawback for the practical use of stochastic Petri net models lies in the state explosion problem originated when the exact solution of the associated continuous time Markov chain is achieved. This tutorial presents some ideas an examples on approximation techniques that try to overcome the state explosion problem within a divide and conquer strategy and with a strong exploitation of structural (qualitative) knowledge of the underlying Petri net model for both the decomposition and the solution phases.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/bc-stmalo-97.pdf}
    }
  • [DOI] J. Campos, S. Donatelli, and M. Silva, “Structured Solution of Stochastic DSSP Systems,” in Proceedings of the 7th International Workshop on Petri Nets and Performance Models, Saint Malo, France, 1997, pp. 91-100.
    [Bibtex]
    @InProceedings{CDS-StMalo-97,
    Title = {Structured Solution of Stochastic {DSSP} Systems},
    Author = {J. Campos and S. Donatelli and M. Silva},
    Booktitle = {Proceedings of the 7th International Workshop on Petri Nets and Performance Models},
    Year = {1997},
    Address = {Saint Malo, France},
    Month = {June},
    Pages = {91-100},
    Publisher = {IEEE Computer Society Press},
    Abstract = {Deterministically Synchronized Sequential Processes (DSSP) are essentially states machines that communicate, may be in complex forms but under some restricted patterns, through buffer places; their definition is compositional by nature. This paper considers the problem of exploiting this compositionality to generate the state space and to find the steady state probabilities of a stochastic extension of DSSP in a net-driven, efficient way. Essentially, we give an expresion of an auxiliary matrix, G, which is a supermatrix of the infinitesimal generator of a DSSP. G is a tensor algebra expression of matrices of the size of the components for which it is possible to numerically solve the characteristic equation pi.G = 0, without the need to explicitly compute G. Therefore, we obtain a method that computes the steady state solution of a DSSP without ever explicitly computing and storing its infinitesimal generator, and therefore without computing and storing the reachability graph of the system.},
    Doi = {10.1109/PNPM.1997.595540},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cds-stmalo-97.pdf}
    }
  • J. Merseguer and J. Romero, “La herencia en el modelo orientado a objetos, del análisis a la implementación,” Sólo Programadores, iss. 34, pp. 21-30, 1997.
    [Bibtex]
    @Article{Merseguer1997,
    Title = {La herencia en el modelo orientado a objetos, del an\'{a}lisis a la implementaci\'{o}n},
    Author = {Merseguer, J. and Romero, J.},
    Journal = {S\'{o}lo Programadores},
    Year = {1997},
    Note = {ISSN: 1134--4792 Dep\'{o}sito Legal: M--26827--1994},
    Number = {34},
    Pages = {21--30},
    Publisher = {Tower Communications}
    }
  • O. Pastor, E. Insfrán, V. Pelechano, J. Romero, and J. Merseguer, “OO-METHOD: An OOSoftware Production Environment Combining Conventional and Formal Methods,” in Advanced Information Systems Engineering, 9th International Conference CAiSE’97, Barcelona, Catalonia, Spain, 1997, pp. 145-159.
    [Bibtex]
    @InProceedings{Pastor1997,
    Title = {{OO-METHOD}: An {OO}Software Production Environment Combining Conventional and Formal Methods},
    Author = {Pastor, O. and Insfr{\'a}n, E. and Pelechano, V. and Romero, J. and Merseguer, J.},
    Booktitle = {Advanced Information Systems Engineering, 9th International Conference CAiSE'97},
    Year = {1997},
    Address = {Barcelona, Catalonia, Spain},
    Month = {June},
    Pages = {145-159},
    Publisher = {Antoni Oliv{\'e}, Joan Antoni Pastor (Eds.). Lecture Notes in Computer Science, Vol. 1250, Springer},
    Comment = {Referencias (estas ref. no est en Merse.bib): 1997: Lozano-97, 1998: Troll-Grau-98, 1999: Seffah-ECOOP-99,SLR-RE-99 2002: Escalona-OOIS-02, Perez-Eur-02, Perez-DBMR-02,Carsi-ID-02, Silva-ICSM-02,CMR-ECOOP-02 PGPR-IST-02,CNMCV-DBI-02, PCR-EurAsia-02 2003: CMC-EDTDM-03 2004: Escalona-JWE-04 2005: CCZ-EAAI-05 2006: MT-CADUI-06 },
    ISBN = {3-540-63107-0}
    }

1996

  • J. Ezpeleta and J. M. Colom, “Automatic Synthesis of Colored Petri Nets for the Control of FMS,” IEEE Transactions on Robotics and Automation, 1996.
    [Bibtex]
    @Article{Ezpeleta1996,
    Title = {Automatic {S}ynthesis of {C}olored {P}etri {N}ets for the {C}ontrol of {FMS}},
    Author = {J. Ezpeleta and J.M. Colom},
    Journal = {IEEE Transactions on Robotics and Automation},
    Year = {1996},
    Month = {December},
    Entrytype = {article}
    }
  • J. Ezpeleta and J. M. Colom, “Automatic Synthesis of Colored Petri Nets for the Control of FMS,” IEEE Transactions on Robotics and Automation, 1996.
    [Bibtex]
    @Article{Ezpeleta1996a,
    Title = {Automatic Synthesis of Colored Petri Nets for the Control of FMS},
    Author = {J. Ezpeleta and J.M. Colom},
    Journal = {IEEE Transactions on Robotics and Automation},
    Year = {1996},
    Month = {December},
    Note = {(To appear)},
    Entrytype = {article},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • C. J. Pérez-Jiménez, J. Campos, and M. Silva, “Approximate Throughput Computation of a Class of Cooperating Sequential Processes,” in Proceedings of the Rensselaer’s Fifth International Conference on Computer Integrated Manufacturing and Automation Technology (CIMAT’96), Grenoble, France, 1996, pp. 382-389.
    [Bibtex]
    @InProceedings{PJCS-96b,
    Title = {Approximate Throughput Computation of a Class of Cooperating Sequential Processes},
    Author = {C.J. P{\'e}rez-Jim{\'e}nez and J. Campos and M. Silva},
    Booktitle = {Proceedings of the Rensselaer's Fifth International Conference on Computer Integrated Manufacturing and Automation Technology (CIMAT'96)},
    Year = {1996},
    Address = {Grenoble, France},
    Month = {May},
    Pages = {382-389},
    Abstract = {We concentrate on a family of Discrete Event Dynamic Systems (DEDS), modelled with Petri nets and obtained from a simple modular design principle, that include in a controlled way primitives to deal with concurrency, decisions, synchronization, blocking, and bulk movements of jobs. Many assembly systems with complex behaviours at the machine level can be described with the class of DEDS under study. We present a structure based decomposition technique and use a fixed-point search iterative process based on response time preservation of subsystems to approximate the throughput. An extensive battery of numerical experiments has shown that the error is less than 3%, and that the state space is usually reduced by more than one order of magnitude.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pjcs-96b.pdf}
    }
  • C. J. Pérez-Jiménez, J. Campos, and M. Silva, “On Approximate Performance Evaluation of Manufacturing Systems Modelled with Weighted T-Systems,” in Proceedings of the IMACS/IEEE-SMC Multiconference on Computational Engineering in Systems Applications (CESA’96), Lille, France, 1996, pp. 201-207.
    [Bibtex]
    @InProceedings{PJCS-96c,
    Title = {On Approximate Performance Evaluation of Manufacturing Systems Modelled with Weighted {T}-Systems},
    Author = {C.J. P{\'e}rez-Jim{\'e}nez and J. Campos and M. Silva},
    Booktitle = {Proceedings of the IMACS/IEEE-SMC Multiconference on Computational Engineering in Systems Applications (CESA'96)},
    Year = {1996},
    Address = {Lille, France},
    Month = {July},
    Pages = {201-207},
    Abstract = {Approximate throughput computation of a class of discrete event systems (DES) modelled with stochastic weighted T-systems is considered. Stochastic weighted T-systems are the weighted extension of well known stochastic marked graphs Petri net subclass and are usually presented as a useful model to deal with bulk consumptions or productions of resources in manufacturing systems working on a cyclic basis. The iterative response time approximation technique that we present is deeply based on a previous structural decomposition and aggregation of the net model. Experimental results on several examples generally have and error of less than 5%. The state space is usually reduced by more than one order of magnitude; therefore, the analysis of otherwise intractable systems is possible.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pjcs-96c.pdf}
    }
  • [DOI] C. J. Pérez-Jiménez, J. Campos, and M. Silva, “State Machine Reduction for the Approximate Performance Evaluation of Manufacturing Systems Modelled with Cooperating Sequential Processes,” in Proceedings of the 1996 IEEE International Conference on Robotics and Automation, Minneapolis, Minnesota, USA, 1996, pp. 1159-1165.
    [Bibtex]
    @InProceedings{PJCS-96a,
    Title = {State Machine Reduction for the Approximate Performance Evaluation of Manufacturing Systems Modelled with Cooperating Sequential Processes},
    Author = {C.J. P{\'e}rez-Jim{\'e}nez and J. Campos and M. Silva},
    Booktitle = {Proceedings of the 1996 IEEE International Conference on Robotics and Automation},
    Year = {1996},
    Address = {Minneapolis, Minnesota, USA},
    Month = {April},
    Pages = {1159-1165},
    Abstract = {We concentrate on a family of discrete event systems obtained from a simple modular design principle that include in a controlled way primitives to deal with concurrency, decisions, synchronization, blocking, and bulk movements of jobs. Due to the functional complexity of such systems, reliable throughput approximation algorithms must be deeply supported on a structure based decomposition technique. We present a decomposition technique and a fixed-point search iterative process based on response time preservation of subsystems. An extensive battery of numerical experiments has shown that the error is less than 3%, and that the state space is usually reduced by more than one order of magnitude.},
    Doi = {10.1109/ROBOT.1996.506864},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pjcs-96a.pdf}
    }
  • O. Pastor, J. M. Barberá, J. Merseguer, J. Romero, and E. Insfran, “Descripción de la Herramienta CASE OO–Method,” Instituto Tecnológico de Informática, Universidad Politécnica de Valencia 1996.
    [Bibtex]
    @TechReport{Pastor1996,
    Title = {Descripci\'{o}n de la Herramienta CASE OO--Method},
    Author = {Pastor, O. and Barber\'{a}, J.M. and Merseguer, J. and Romero, J. and Insfran, E},
    Institution = {Instituto Tecnol\'{o}gico de Inform\'{a}tica, Universidad Polit\'{e}cnica de Valencia},
    Year = {1996},
    Month = {March},
    Note = {ITI--DT 96--1},
    Pages = {47}
    }

1995

  • J. Campos, Estructuras de Datos y Algoritmos, Pedro Cerbuna, 12, Zaragoza, Spain: Prensas Universitarias de Zaragoza, 1995. [Publisher URL]
    [Bibtex]
    @Book{EDA-book-95,
    Title = {Estructuras de Datos y Algoritmos},
    Author = {J. Campos},
    Publisher = {Prensas Universitarias de Zaragoza},
    Year = {1995},
    Address = {Pedro Cerbuna, 12, Zaragoza, Spain},
    Note = {In Spanish},
    Series = {Colecci{\'o}n Textos Docentes},
    Abstract = {La abstracci\'on de acciones es la base de la metodolog\'{\i}a de dise\~no descendente por refinamientos sucesivos, \'util para la resoluci\'on de peque\~nos problemas de tratamiento de informaci\'on. Sin embargo, para afrontar la construcci\'on de programas en media y gran escala es necesaria una metodolog\'{\i}a de dise\~no modular, que permita la partici\'on del trabajo en unidades de programa que puedan ser desarrolladas independientemente del resto. El prop\'osito de estos apuntes es presentar los principios b\'asicos de una metodolog\'{\i}a de dise\~no modular basada en la abstracci\'on de datos. Este material ha sido elaborado para servir como soporte de la asignatura Estructuras de datos y algoritmos, que se imparte en el tercer semestre de los estudios de Ingenier\'{\i}a Inform\'atica en el Centro Polit\'ecnico Superior de la Universidad de Zaragoza. Los alumnos que cursan dicha asignatura han seguido previamente dos semestres de programaci\'on en los que han debido aprender a especificar formalmente y dise\~nar programas en peque\~na escala, utilizando tipos de datos sencillos (como los predefinidos en un lenguaje de programaci\'on de la familia del Pascal); los alumnos conocen t\'ecnicas de dise\~no recursivo e iterativo, as\'{\i} como las herramientas b\'asicas para poder medir la eficiencia de los algoritmos (atendiendo a su tiempo de ejecuci\'on). No obstante, el material presentado puede ser \'util tambi\'en para un segundo nivel en todos aquellos planes de estudios en los que se incluyan dos cursos de programaci\'on de computadores. Pueden encontrarse en las librer\'{\i}as varios trabajos (muchos de ellos ya cl\'asicos) con t\'{\i}tulos similares o iguales a \'este. Sin embargo, y \'esta es la raz\'on para la existencia de uno nuevo, la aproximaci\'on al tema que se pretende desarrollar es bien diferente. De hecho, el t\'{\i}tulo que el autor habr\'{\i}a elegido, en caso de no haber optado por mantener el nombre de la asignatura antes mencionada, hubiese sido m\'as bien "Tipos abstractos de datos y algoritmos" o mejor "Introducci\'on a la programaci\'on con tipos abstractos de datos". La diferencia estriba en el \'enfasis que se pretende dar en las p\'aginas que siguen a la especificaci\'on formal de los tipos (de ah\'{\i} el t\'ermino "tipos abstractos de datos") como herramienta fundamental para el dise\~no modular de programas, en lugar de limitarse a presentar las estructuras de datos necesarias para representar los valores de los tipos definidos. El comentario anterior no debe hacer pensar al lector que el material que sigue es original del autor. Nada m\'as lejos de la realidad. \'Unicamente nos hemos limitado a enlazar las excelentes aproximaciones existentes en la literatura a la definici\'on y conceptos relacionados con los tipos abstractos de datos y su especificaci\'on algebraica (v\'eanse, por ejemplo, los dos \'ultimos cap\'{\i}tulos de la obra de Ricardo Pe\~na titulada Dise\~no de Programas. Formalismo y Abstracci\'on) con los trabajos m\'as cl\'asicos sobre estructuras de datos y algoritmos de manipulaci\'on (como, por ejemplo, Estructuras de Datos y Algoritmos, de Aho, Hopcroft y Ullman). Los apuntes est\'an estructurados en lecciones, agrupadas en grandes temas. En el primero de ellos, titulado "Tipos abstractos de datos", se presentan los conceptos fundamentales sobre los tipos abstractos de datos, su especificaci\'on formal (algebraica) y su utilizaci\'on en el dise\~no modular de programas. El segundo tema, "Tipos de datos lineales", introduce tres de los tipos abstractos lineales m\'as representativos y \'utiles en programaci\'on: las pilas, las colas y las listas con acceso por posici\'on. Para cada nuevo tipo presentado se incluyen su especificaci\'on formal, una o varias soluciones para la representaci\'on de sus valores, la implementaci\'on de las operaciones m\'as importantes, su coste computacional y algunos ejemplos de aplicaci\'on. El tercer tema, titulado "\'Arboles y esquemas algor\'{\i}tmicos", incluye los detalles sobre algunos de los tipos de \'arboles m\'as frecuentemente utilizados, como los \'arboles binarios, \'arboles ordenados, \'arboles de b\'usqueda, mont\'{\i}culos, ..., y ejemplos de aplicaci\'on. Adem\'as se introducen los algoritmos de vuelta atr\'as y las heur\'{\i}sticas voraces. Los dos \'ultimos temas, sobre "Tipos de datos funcionales" (o tablas) e "Introducci\'on a los grafos", no se desarrollan con la misma extensi\'on que los anteriores por razones diferentes. En el caso de las tablas, tras las definiciones formales convenientes, se hace hincapi\'e en la representaci\'on mediante tablas dispersas basadas en la utilizaci\'on de una funci\'on de localizaci\'on (hashing, en ingl\'es) y en las tablas multidimensionales representadas mediante estructuras de listas m\'ultiples, pues otras representaciones posibles basadas en listas lineales o \'arboles de b\'usqueda no precisan mayor explicaci\'on tras el estudio de los temas previos. En cuanto a los grafos, los alumnos de Ingenier\'{\i}a Inform\'atica (a quienes va dirigida preferentemente esta obra) han cursado previamente una asignatura titulada "Matem\'atica discreta", en la que se les ha presentado el concepto de grafo y una buena colecci\'on de algoritmos para su manipulaci\'on. Por ello, y atendiendo a razones de completitud, se presentan s\'olo las especificaciones formales y varias alternativas de representaci\'on, junto a algunas consideraciones sobre el efecto que la elecci\'on de la representaci\'on tiene en el coste de los algoritmos de manipulaci\'on. Por \'ultimo, un comentario sobre las notaciones empleadas y los lenguajes de programaci\'on que pueden servir como soporte de pr\'acticas. Para la especificaci\'on algebraica de tipos abstractos, se utiliza una sintaxis similar a la del lenguaje OBJ, pero en espa\~nol. En cuanto a los m\'odulos, estructuras de datos y algoritmos, se emplea una notaci\'on algor\'{\i}tmica, tambi\'en en espa\~nol, que consiste en una extensi\'on modular de la notaci\'on utilizada en los apuntes sobre Introducci\'on a la programaci\'on, elaborados por Javier Mart\'{\i}nez y Javier Campos como soporte a la asignatura de igual nombre existente en el curriculum de Ingenier\'{\i}a Inform\'atica del CPS. En cuanto al lenguaje de programaci\'on soporte de las pr\'acticas, el autor desaconseja la utilizaci\'on de las extensiones modulares de Pascal (incluido el Modula 2), pues carecen de la posibilidad de definir tipos opacos y tipos gen\'ericos, siendo ambos mecanismos fundamentales en la metodolog\'{\i}a desarrollada. As\'{\i}, un lenguaje apropiado resulta ser el Ada, dotado de la posibilidad de definici\'on de tipos opacos y tipos gen\'ericos, con una sintaxis y sem\'antica bien pensadas y una dificultad de aprendizaje similar al Pascal, si se limita su presentaci\'on a la parte secuencial. Otras alternativas pueden encontrarse en lenguajes de programaci\'on orientados a objetos (como, por ejemplo, C++), dada la cercan\'{\i}a de los conceptos de "clase" y "tipo abstracto de dato".},
    Url = {http://puz.unizar.es/catalogo/detalle.php?l=467}
    }
  • [DOI] J. Campos, J. M. Colom, H. Jungnitz, and M. Silva, “Approximate Throughput Computation of Stochastic Marked Graphs” in Quantitative Methods in Parallel Systems, F. Baccelli, A. Jean-Marie, and I. Mitrani, Eds., Springer, 1995, pp. 175-188.
    [Bibtex]
    @InCollection{CCHS-QMIPSbook-95,
    Title = {Approximate Throughput Computation of Stochastic Marked Graphs},
    Author = {J. Campos and J.M. Colom and H. Jungnitz and M. Silva},
    Booktitle = {Quantitative Methods in Parallel Systems},
    Publisher = {Springer},
    Year = {1995},
    Editor = {F. Baccelli and A. Jean-Marie and I. Mitrani},
    Pages = {175-188},
    Series = {Esprit Basic Research Series},
    Abstract = {A general iterative technique for approximate throughput computation of stochastic strongly connected marked graphs is presented. It generalizes a previous technique based on net decomposition through a single input-single output cut, allowing the split of the model through any cut. The approach has two basic foundations. First, a deep understanding of the qualitative behaviour of marked graphs leads to a general decomposition technique. Second, after the decomposition phase, an iterative response time approximation method is applied for the computation of the throughput. Experimental results on several examples generally have an error of less than 3%. The state space is usually reduced by more than one order of magnitude; therefore the analysis of otherwise intractable systems is possible.},
    Doi = {10.1007/978-3-642-79917-4_12}
    }
  • [DOI] G. Chiola, C. Anglano, J. Campos, J. M. Colom, and M. Silva, “Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds” in Quantitative Methods in Parallel Systems, F. Baccelli, A. Jean-Marie, and I. Mitrani, Eds., Springer, 1995, pp. 161-174.
    [Bibtex]
    @InCollection{CACCM-QMIPSbook-95,
    Title = {Operational Analysis of Timed {Petri} Nets and Application to the Computation of Performance Bounds},
    Author = {G. Chiola and C. Anglano and J. Campos and J.M. Colom and M. Silva},
    Booktitle = {Quantitative Methods in Parallel Systems},
    Publisher = {Springer},
    Year = {1995},
    Editor = {F. Baccelli and A. Jean-Marie and I. Mitrani},
    Pages = {161-174},
    Series = {Esprit Basic Research Series},
    Abstract = {We use operational analysis techniques to partially characterize the behaviour of timed Petri nets under very weak assumptions on their timing semantics. New operational inequalities are derived that are typical of the presence of synchronization and that were therefore not considered in queueing network models. We show an interesting application of the operational laws to the statement and the efficient solution of problems related to the estimation of performance bounds insensitive to the timing probability distributions. The results obtained generalize and improve in a clear setting results that were derived in the last few years for several different subclasses of timed Petri nets. In particular the extension to Well-Formed Coloured nets appears straightforward and allows an efficient exploitation of models symmetries.},
    Doi = {10.1007/978-3-642-79917-4_11}
    }
  • J. Ezpeleta, J. M. Colom, and J. Martínez, “A Petri net based deadlock prevention policy for flexible manufacturing systems,” IEEE Transactions on Robotics and Automation, vol. 11, iss. 2, pp. 173-184, 1995.
    [Bibtex]
    @Article{J.Ezpeleta1995,
    Title = {A Petri net based deadlock prevention policy for flexible manufacturing systems},
    Author = {J. Ezpeleta and J.M. Colom and J. Mart\'{i}nez},
    Journal = {IEEE Transactions on Robotics and Automation},
    Year = {1995},
    Month = {April},
    Number = {2},
    Pages = {173--184},
    Volume = {11},
    Entrytype = {article},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • C. J. Pérez-Jiménez, J. Campos, and M. Silva, “On Approximate Throughput Computation of Deterministic Systems of Sequential Processes,” in Actas de las IV Jornadas de Concurrencia, El Escorial, Spain, 1995, pp. 156-171.
    [Bibtex]
    @InProceedings{PJCS-95,
    Title = {On Approximate Throughput Computation of Deterministic Systems of Sequential Processes},
    Author = {C.J. P{\'e}rez-Jim{\'e}nez and J. Campos and M. Silva},
    Booktitle = {Actas de las IV Jornadas de Concurrencia},
    Year = {1995},
    Address = {El Escorial, Spain},
    Month = {June},
    Pages = {156-171},
    Publisher = {Universidad Complutense de Madrid},
    Abstract = {We concentrate on a family of discrete event systems obtained from a simple modular design principle that include in a controlled way primitives to deal with concurrency, decisions, synchronization, blocking, and bulk movements of jobs. Due to the functional complexity of such systems, reliable throughput approximation algorithms must be deeply supported on a structure based decomposition technique. We present two complementary decomposition techniques and a fixed-point search iterative process based on response time preservation of subsystems. An extensive battery of numerical experiments has shown that the error is less than 3%, and that the state space is usually reduced by more than one order of magnitude.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/pjcs-95.pdf}
    }
  • [DOI] M. Silva and J. Campos, “Structural Performance Analysis of Stochastic Petri Nets,” in Proceedings of the IEEE International Computer Performance and Dependability Symposium, Erlangen, Germany, 1995, pp. 61-70.
    [Bibtex]
    @InProceedings{SC-Erlangen-95,
    Title = {Structural Performance Analysis of Stochastic {Petri} Nets},
    Author = {M. Silva and J. Campos},
    Booktitle = {Proceedings of the IEEE International Computer Performance and Dependability Symposium},
    Year = {1995},
    Address = {Erlangen, Germany},
    Month = {April},
    Note = {Invited paper},
    Pages = {61-70},
    Publisher = {IEEE-Computer Society Press},
    Abstract = {Structure performance analysis theory and techniques is an essay to avoid the computational complexity problem associated to Markovian and discrete event simulation techniques. Even if a finished conceptual and technical framework is not yet available, important benefits have been obtained not only from performance but also from correctness analysis point of view. In this survey we overview some of the achievements developed by the authors and collaborators towards a structure theory for performance evaluation of net based models. Concepts and techniques for the computation of performance bounds and approximate and exact evaluation are described in a semi-formal/illustrative way through a selected collection of examples.},
    Doi = {10.1109/IPDS.1995.395816},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/sc-erlangen-95.pdf}
    }
  • [DOI] E. Teruel, M. Silva, J. M. Colom, and J. Campos, “Functional and Performance Analysis of Cooperating Sequential Processes” in Quantitative Methods in Parallel Systems, F. Baccelli, A. Jean-Marie, and I. Mitrani, Eds., Springer, 1995, pp. 52-65.
    [Bibtex]
    @InCollection{TSCC-QMIPSbook-95,
    Title = {Functional and Performance Analysis of Cooperating Sequential Processes},
    Author = {E. Teruel and M. Silva and J.M. Colom and J. Campos},
    Booktitle = {Quantitative Methods in Parallel Systems},
    Publisher = {Springer},
    Year = {1995},
    Editor = {F. Baccelli and A. Jean-Marie and I. Mitrani},
    Pages = {52-65},
    Series = {Esprit Basic Research Series},
    Abstract = {This paper presents some results concerning the functional and performance analysis of sequential proceses connected through buffers using structural analysis techniques, mainly linear algebraic ones. From the functional point of view the following properties are considered: boundedness, deadlock-freeness, liveness and the existence of home states. From the performance point of view the considered properties are marking ergodicity, computation of visit ratios and computation of insensitive throughput bounds.},
    Doi = {10.1007/978-3-642-79917-4_4},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/tscc-qmipsbook-95.pdf}
    }

1994

  • F. Baccelli, G. Balbo, R. J. Boucherie, J. Campos, and G. Chiola, “Annotated Bibliography on Stochastic Petri Nets” in Performance Evaluation of Parallel and Distributed Systems: Solution Methods, O. J. Boxma and G. M. Koole, Eds., Amsterdam: Centrum voor Wiskunde en Informatica, 1994, vol. 105, pp. 25-44.
    [Bibtex]
    @InCollection{BBBCC-QMIPS-94,
    Title = {Annotated Bibliography on Stochastic {Petri} Nets},
    Author = {F. Baccelli and G. Balbo and R.J. Boucherie and J. Campos and G. Chiola},
    Booktitle = {Performance Evaluation of Parallel and Distributed Systems: Solution Methods},
    Publisher = {Centrum voor Wiskunde en Informatica},
    Year = {1994},
    Address = {Amsterdam},
    Editor = {O.J. Boxma and G.M. Koole},
    Pages = {25-44},
    Series = {Tract},
    Volume = {105},
    Abstract = {An annotated bibliography on stochastic Petri nets is given.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/bbbcc-qmips-94.pdf}
    }
  • J. Campos, J. M. Colom, H. Jungnitz, and M. Silva, “A General Iterative Technique for Approximate Throughput Computation of Stochastic Marked Graphs” in Performance Evaluation of Parallel and Distributed Systems: Solution Methods, O. J. Boxma and G. M. Koole, Eds., Amsterdam: Centrum voor Wiskunde en Informatica, 1994, vol. 106, pp. 265-283.
    [Bibtex]
    @InCollection{CCJS-QMIPS-94,
    Title = {A General Iterative Technique for Approximate Throughput Computation of Stochastic Marked Graphs},
    Author = {J. Campos and J.M. Colom and H. Jungnitz and M. Silva},
    Booktitle = {Performance Evaluation of Parallel and Distributed Systems: Solution Methods},
    Publisher = {Centrum voor Wiskunde en Informatica},
    Year = {1994},
    Address = {Amsterdam},
    Editor = {O.J. Boxma and G.M. Koole},
    Pages = {265-283},
    Series = {Tract},
    Volume = {106},
    Abstract = {A general iterative technique for approximate throughput computation of stochastic strongly connected marked graphs is presented. It generalizes a previous technique based on net decomposition through a single input-single output cut, allowing the split of the model through any cut. The approach has two basic foundations. First, a deep understanding of the qualitative behaviour of marked graphs leads to a general decomposition technique. Second, after the decomposition phase, an iterative response time approximation method is applied for the computation of the throughput. Experimental results on several examples generally have an error of less than 3%. The state space is usually reduced by more than one order of magnitude; therefore the analysis of otherwise intractable systems is possible.}
    }
  • [DOI] J. Campos, J. M. Colom, H. Jungnitz, and M. Silva, “Approximate Throughput Computation of Stochastic Marked Graphs,” IEEE Transactions on Software Engineering, vol. 20, iss. 7, pp. 526-535, 1994.
    [Bibtex]
    @Article{CCJS-TSE-94,
    Title = {Approximate Throughput Computation of Stochastic Marked Graphs},
    Author = {J. Campos and J.M. Colom and H. Jungnitz and M. Silva},
    Journal = {IEEE Transactions on Software Engineering},
    Year = {1994},
    Month = {July},
    Number = {7},
    Pages = {526-535},
    Volume = {20},
    Abstract = {A general iterative technique for approximate throughput computation of stochastic strongly connected marked graphs is presented. It generalizes a previous technique based on net decomposition through a single input-single output cut, allowing the split of the model through any cut. The approach has two basic foundations. First, a deep understanding of the qualitative behaviour of marked graphs leads to a general decomposition technique. Second, after the decomposition phase, an iterative response time approximation method is applied for the computation of the throughput. Experimental results on several examples generally have an error of less than 3%. The state space is usually reduced by more than one order of magnitude; therefore the analysis of otherwise intractable systems is possible.},
    Doi = {10.1109/32.297941},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/ccjs-tse-94.pdf}
    }
  • J. Campos, J. M. Colom, M. Silva, and E. Teruel, “Functional and Performance Analysis of Cooperating Sequential Processes” in Performance Evaluation of Parallel and Distributed Systems: Solution Methods, O. J. Boxma and G. M. Koole, Eds., Amsterdam: Centrum voor Wiskunde en Informatica, 1994, vol. 106, pp. 233-251.
    [Bibtex]
    @InCollection{CCST-QMIPS-94,
    Title = {Functional and Performance Analysis of Cooperating Sequential Processes},
    Author = {J. Campos and J.M. Colom and M. Silva and E. Teruel},
    Booktitle = {Performance Evaluation of Parallel and Distributed Systems: Solution Methods},
    Publisher = {Centrum voor Wiskunde en Informatica},
    Year = {1994},
    Address = {Amsterdam},
    Editor = {O.J. Boxma and G.M. Koole},
    Pages = {233-251},
    Series = {Tract},
    Volume = {106},
    Abstract = {This paper presents some results concerning the functional and performance analysis of sequential proceses connected through buffers using structural analysis techniques, mainly linear algebraic ones. From the functional point of view the following properties are considered: boundedness, deadlock-freeness, liveness and the existence of home states. From the performance point of view the considered properties are marking ergodicity, computation of visit ratios and computation of insensitive throughput bounds.}
    }
  • G. Chiola, C. Anglano, J. Campos, J. M. Colom, and M. Silva, “Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds” in Performance Evaluation of Parallel and Distributed Systems: Solution Methods, O. J. Boxma and G. M. Koole, Eds., Amsterdam: Centrum voor Wiskunde en Informatica, 1994, vol. 106, pp. 197-213.
    [Bibtex]
    @InCollection{CACCS-QMIPS-94,
    Title = {Operational Analysis of Timed {Petri} Nets and Application to the Computation of Performance Bounds},
    Author = {G. Chiola and C. Anglano and J. Campos and J.M. Colom and M. Silva},
    Booktitle = {Performance Evaluation of Parallel and Distributed Systems: Solution Methods},
    Publisher = {Centrum voor Wiskunde en Informatica},
    Year = {1994},
    Address = {Amsterdam},
    Editor = {O.J. Boxma and G.M. Koole},
    Pages = {197-213},
    Series = {Tract},
    Volume = {106},
    Abstract = {We use operational analysis techniques to partially characterize the behaviour of timed Petri nets under very weak assumptions on their timing semantics. New operational inequalities are derived that are typical of the presence of synchronization and that were therefore not considered in queueing network models. We show an interesting application of the operational laws to the statement and the efficient solution of problems related to the estimation of performance bounds insensitive to the timing probability distributions. The results obtained generalize and improve in a clear setting results that were derived in the last few years for several different subclasses of timed Petri nets. In particular the extension to Well-Formed Coloured nets appears straightforward and allows an efficient exploitation of models symmetries.}
    }
  • [DOI] E. Teruel, M. Silva, J. M. Colom, and J. Campos, “Functional and Performance Analysis of Cooperating Sequential Processes,” Lecture Notes in Control and Information Sciences, vol. 199, pp. 169-175, 1994.
    [Bibtex]
    @Article{TSCC-LNCIS-94,
    Title = {Functional and Performance Analysis of Cooperating Sequential Processes},
    Author = {E. Teruel and M. Silva and J.M. Colom and J. Campos},
    Journal = {Lecture Notes in Control and Information Sciences},
    Year = {1994},
    Pages = {169-175},
    Volume = {199},
    Abstract = {A class of Petri nets suitable for modelling sequential processes cooperating by means of message passing is presented. Some functional (boundedness, liveness, home states) and performance (ergodicity, computation of visit ratios and throughput bounds) aspects are considered from a structure theory perspective.},
    Address = {London},
    Booktitle = {Analysis and Optimization of Systems: Discrete Event Systems},
    Doi = {10.1007/BFb0033545},
    Editor = {G. Cohen and J.P. Quadrat},
    Publisher = {Springer-Verlag}
    }

1993

  • G. Balbo, M. Silva, G. Chiola, J. Campos, and others, “The Timed (Coloured) Petri Net Formalism: Position Paper” in Workshop on Formalisms, Principles, and State-of-the-Art, Erlangen, Germany: Arbeitsberichte des Instituts für Mathematische Maschinen und Datenverarbeitung (Informatik), 1993, vol. 14, pp. 3-60.
    [Bibtex]
    @InCollection{State-of-the-art-93,
    Title = {The Timed (Coloured) {Petri} Net Formalism: Position Paper},
    Author = {G. Balbo and M. Silva and G. Chiola and J. Campos and others},
    Booktitle = {Workshop on Formalisms, Principles, and State-of-the-Art},
    Publisher = {Arbeitsberichte des Instituts f{\"u}r Mathematische Maschinen und Datenverarbeitung (Informatik)},
    Year = {1993},
    Address = {Erlangen, Germany},
    Pages = {3-60},
    Series = {Band 26},
    Volume = {14},
    Abstract = {This paper presents the point of view of the groups of the universities of Torino and Zaragoza on the timed Petri net formalism. Coloured and non coloured models are covered at the same time, the latter making sense in case of systems without symmetries. We argue that Petri net formalisms allow more freedom than other established formalisms in the choices regarding the trade off between structural model complexity and interpretation of the graph. Some considerations are made on coloured Petri nets that could suggest them as a superior modelling formalism. The main comparison term that we selected are BCMP type queueing networks.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/state-of-the-art-93.pdf}
    }
  • [DOI] J. Campos, J. M. Colom, H. Jungnitz, and M. Silva, “A General Iterative Technique for Approximate Throughput Computation of Stochastic Marked Graphs,” in Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France, 1993, pp. 138-147.
    [Bibtex]
    @InProceedings{CCJS-Toulouse-93,
    Title = {A General Iterative Technique for Approximate Throughput Computation of Stochastic Marked Graphs},
    Author = {J. Campos and J.M. Colom and H. Jungnitz and M. Silva},
    Booktitle = {Proceedings of the 5th International Workshop on Petri Nets and Performance Models},
    Year = {1993},
    Address = {Toulouse, France},
    Month = {October},
    Pages = {138-147},
    Publisher = {IEEE-Computer Society Press},
    Abstract = {A general iterative technique for approximate throughput computation of stochastic strongly connected marked graphs is presented. It generalizes a previous technique based on net decomposition through a single input-single output cut, allowing the split of the model through any cut. The approach has two basic foundations. First, a deep understanding of the qualitative behaviour of marked graphs leads to a general decomposition technique. Second, after the decomposition phase, an iterative response time approximation method is applied for the computation of the throughput. Experimental results on several examples generally have an error of less than 3%. The state space is usually reduced by more than one order of magnitude; therefore the analysis of otherwise intractable systems is possible.},
    Doi = {10.1109/PNPM.1993.393427},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/ccjs-toulouse-93.pdf}
    }
  • J. Campos, B. F. Plo, and M. San Miguel, “Boundedness on Stochastic Petri Nets,” Revista Matemática de la Universidad Complutense de Madrid, vol. 6, iss. 1, pp. 123-136, 1993.
    [Bibtex]
    @Article{CPSM-RMUCM-93,
    Title = {Boundedness on Stochastic {Petri} Nets},
    Author = {J. Campos and B.F. Plo and San Miguel, M.},
    Journal = {Revista Matem{\'a}tica de la Universidad Complutense de Madrid},
    Year = {1993},
    Number = {1},
    Pages = {123-136},
    Volume = {6},
    Abstract = {Stochastic Petri nets generalize the notion of queueing systems and are a useful model in performance evaluation of parallel and distributed systems. We give necessary and sufficient conditions for the boundedness of a stochastic process related to these nets.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cpsm-rmucm-93.pdf}
    }
  • [DOI] J. Campos and M. Silva, “Embedded Product-Form Queueing Networks and the Improvement of Performance Bounds for Petri Net Systems,” Performance Evaluation, vol. 18, iss. 1, pp. 3-19, 1993.
    [Bibtex]
    @Article{CS-PE-93,
    Title = {Embedded Product-Form Queueing Networks and the Improvement of Performance Bounds for {Petri} Net Systems},
    Author = {J. Campos and M. Silva},
    Journal = {Performance Evaluation},
    Year = {1993},
    Month = {July},
    Number = {1},
    Pages = {3-19},
    Volume = {18},
    Abstract = {This paper addresses the computation of upper bounds for the steady-state throughput of stochastic Petri net systems with immediate and generally distributed timed transitions. It is achieved through the use of a kind of decomposition of the whole net system. Results are obtained deeply bridging stochastic Petri net theory to untimed Petri net and queueing network theories. Previous results are improved by considering some embedded product-form queueing networks (generated by the support of some left annullers of the incidence matrix of the net). The obtained results for the case of live and bounded free choice systems are of special interest. In this case, the subnets generated by the minimal left annullers of the incidence matrix always have a topology of product-form closed monoclass queueing networks.},
    Doi = {10.1016/0166-5316(93)90024-O},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cs-pe-93.pdf}
    }
  • [DOI] G. Chiola, C. Anglano, J. Campos, J. M. Colom, and M. Silva, “Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds,” in Proceedings of the 5th International Workshop on Petri Nets and Performance Models, Toulouse, France, 1993, pp. 128-137.
    [Bibtex]
    @InProceedings{CACCS-Toulouse-93,
    Title = {Operational Analysis of Timed {Petri} Nets and Application to the Computation of Performance Bounds},
    Author = {G. Chiola and C. Anglano and J. Campos and J.M. Colom and M. Silva},
    Booktitle = {Proceedings of the 5th International Workshop on Petri Nets and Performance Models},
    Year = {1993},
    Address = {Toulouse, France},
    Month = {October},
    Pages = {128-137},
    Publisher = {IEEE-Computer Society Press},
    Abstract = {We use operational analysis techniques to partially characterize the behaviour of timed Petri nets under very weak assumptions on their timing semantics. New operational inequalities are derived that are typical of the presence of synchronization and that were therefore not considered in queueing network models. We show an interesting application of the operational laws to the statement and the efficient solution of problems related to the estimation of performance bounds insensitive to the timing probability distributions. The results obtained generalize and improve in a clear setting results that were derived in the last few years for several different subclasses of timed Petri nets. In particular the extension to Well-Formed Coloured nets appears straightforward and allows an efficient exploitation of models symmetries.},
    Doi = {10.1109/PNPM.1993.393428},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/caccs-toulouse-93.pdf}
    }
  • G. Chiola, J. Campos, J. M. Colom, and M. Silva, “Operational Analysis of Timed Petri Nets,” in Proceedings of the 16th International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance’93), Roma, Italy, 1993.
    [Bibtex]
    @InProceedings{CCCS-Roma-93,
    Title = {Operational Analysis of Timed {Petri} Nets},
    Author = {G. Chiola and J. Campos and J.M. Colom and M. Silva},
    Booktitle = {Proceedings of the 16th International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance'93)},
    Year = {1993},
    Address = {Roma, Italy},
    Month = {September},
    Abstract = {Operational analysis is a conceptually very simple way of deriving mathematical equations relating measurable quantities in queueing systems [DB 78]. In [DC 92] the reader can find some nice examples of how the application of operational analysis techniques can help in explaining and proving fundamental results in queueing network analysis. Here we apply operational analysis techniques to derive linear equations and inequalities relating interesting performance measures in timed Petri net models. The main conceptual difference between queueing and Petri net models is the presence of a synchronization primitive in the latter. New operational inequalities are derived for synchronization elements that have no counterpart in operational laws for queueing networks. In addition to the mathematical interest of these derivations, the results can be immediately used for the computation of performance bounds based on linear programming techniques.}
    }
  • J. Ezpeleta, J. M. Couvreur, and M. Silva, “A new technique for finding a generating family of siphons, traps and st–components,” , vol. 674, pp. 126-147, 1993.
    [Bibtex]
    @InCollection{J.Ezpeleta1993,
    Title = {A new technique for finding a generating family of siphons, traps and st--components},
    Author = {J. Ezpeleta and J.M. Couvreur and M. Silva},
    Booktitle = {Advances in Petri Nets},
    Publisher = {Springer--Verlag},
    Year = {1993},
    Address = {Berlin},
    Editor = {G. Rozenberg},
    Pages = {126--147},
    Volume = {674},
    Entrytype = {incollection},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. Ezpeleta, J. M. Couvreur, and M. Silva, “A New Technique for Finding a Generating Family of Siphons, Traps and ST–Components. Application to Coloured Petri Nets,” , vol. 674, pp. 126-147, 1993.
    [Bibtex]
    @InCollection{Ezpeleta1993,
    Title = {A New Technique for Finding a Generating Family of Siphons, Traps and ST--Components. Application to Coloured Petri Nets},
    Author = {J. Ezpeleta and J. M. Couvreur and M. Silva},
    Booktitle = {Advances in Petri Nets 1993},
    Publisher = {Springer},
    Year = {1993},
    Editor = {G. Rozenberg},
    Pages = {126--147},
    Volume = {674},
    Entrytype = {incollection},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. Ezpeleta and S. Haddad, “A distributed algorithm for ressource management,” , pp. 15-26, 1993.
    [Bibtex]
    @InProceedings{Ezpeleta1993a,
    Title = {A distributed algorithm for ressource management},
    Author = {J. Ezpeleta and S. Haddad},
    Booktitle = {Proceedings of the International Conference on Distributed and Decentralized Systems},
    Year = {1993},
    Address = {Palma de Mallorca, Spain},
    Month = {September},
    Pages = {15--26},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. Ezpeleta and J. Martínez, “Synthesis of live models for a class of FMS,” , pp. 557-563, 1993.
    [Bibtex]
    @InProceedings{Ezpeleta1993b,
    Title = {Synthesis of live models for a class of FMS},
    Author = {J. Ezpeleta and J. Mart\'{i}nez},
    Booktitle = {IEEE International Conference on Robotics and Automation},
    Year = {1993},
    Address = {Atlanta (Georgia)},
    Month = {May},
    Pages = {557--563},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. Ezpeleta, J. Martínez, and J. M. Colom, “Synthesis of live high level models for a class of FMS,” , pp. 589-594, 1993.
    [Bibtex]
    @InProceedings{J.Ezpeleta1993a,
    Title = {Synthesis of live high level models for a class of FMS},
    Author = {J. Ezpeleta and J. Mart\'{i}nez and J.M. Colom},
    Booktitle = {Proceedings of the International Conference on Systems, Man and Cybernetics. Systems Engineering in the Service of Humans (IEEE/SMC93)},
    Year = {1993},
    Address = {Le Touquet, France},
    Month = {October},
    Pages = {589--594},
    Publisher = {IEEE Computer Society Press},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • [DOI] A. Ramírez, J. Campos, and M. Silva, “On Optimal Scheduling in DEDS,” in Proceedings of the 1993 IEEE International Conference on Robotics and Automation, Atlanta, USA, 1993, pp. 821-826.
    [Bibtex]
    @InProceedings{RCS-Atlanta-93,
    Title = {On Optimal Scheduling in {DEDS}},
    Author = {A. Ram{\'{\i}}rez and J. Campos and M. Silva},
    Booktitle = {Proceedings of the 1993 IEEE International Conference on Robotics and Automation},
    Year = {1993},
    Address = {Atlanta, USA},
    Month = {May},
    Pages = {821-826},
    Abstract = {In this paper we present the Local Optimality (LO) property for Discrete Event Dynamic Systems modeled using Petri Nets (PN's). If a system is divided into independent subsystems and if the optimal behaviour of these subsystems guarantees the optimal behaviour of whole system, then this system possesses the LO property. The main advantage of this approach is that we can find an optimal schedule for this class of systems in less time, because we are determining the optimal behaviour of small problems. A characterization of systems exhibiting the LO property is given, as well as one procedure to divide them into subsystems.},
    Doi = {10.1109/ROBOT.1993.292246},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/rcs-atlanta-93.pdf}
    }
  • M. Silva and J. Campos, “Performance Models Based on Petri Nets,” in Proceedings of the IMACS/IFAC Second International Symposium on Mathematical and Intelligent Models in System Simulation, 1993, p. xiv-xxi.
    [Bibtex]
    @InProceedings{SC-Brussels-93,
    Title = {Performance Models Based on {Petri} Nets},
    Author = {M. Silva and J. Campos},
    Booktitle = {Proceedings of the IMACS/IFAC Second International Symposium on Mathematical and Intelligent Models in System Simulation},
    Year = {1993},
    Month = {April},
    Note = {Invited paper},
    Pages = {xiv-xxi},
    Publisher = {Brussels, Belgium},
    Abstract = {Petri Nets (PNs) is a well suited formalism to model and analyze parallel and distributed discrete event dynamic systems. Provided with adequate timed interpretation, PNs allow to build performance models in which true concurrence can be described together with synchronization and sharing phenomena. This survey paper gives a fast overview of some major topics related to net performance models, obtained through stochastically timed interpretation of PNs. Analysis of net models, pointing out the importance of the logical and performance perspectives, and some relations between queueing networks and PN models are briefly considered.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/sc-brussels-93.pdf}
    }

1992

  • [DOI] J. Campos, G. Chiola, J. M. Colom, and M. Silva, “Properties and Performance Bounds for Timed Marked Graphs,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 39, iss. 5, pp. 386-401, 1992.
    [Bibtex]
    @Article{CCCS-CAS-92,
    Title = {Properties and Performance Bounds for Timed Marked Graphs},
    Author = {J. Campos and G. Chiola and J.M. Colom and M. Silva},
    Journal = {IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications},
    Year = {1992},
    Month = {May},
    Number = {5},
    Pages = {386-401},
    Volume = {39},
    Abstract = {A class of synchronized queueing networks with deterministic routing is identified to be equivalent to a subclass of timed Petri nets called marked graphs. First some structural and behavioral properties of marked graphs are recalled and used to show interesting properties of this class of performance models. In particular, ergodicity is derived from boundedness and liveness of the underlying Petri net representation, which can be efficiently computed in polynomial time on the net structure. In case of unbounded (i.e., non-strongly-connected) marked graphs, ergodicity is computed as a function of the average transition firing delays. Then the problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic marked graphs is studied. In particular, 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 distribution functions (thus including both the deterministic and the stochastic cases). The benefits of interleaving qualitative and quantitative analysis of marked graph models are shown.},
    Doi = {10.1109/81.139289},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cccs-cas-92.pdf}
    }
  • J. Campos, J. M. Colom, and M. Silva, “Improving Throughput Upper Bounds for Net Based Models of Manufacturing Systems” in Robotics and Flexible Manufacturing Systems, J. C. Gentina and S. G. Tzafestas, Eds., Amsterdam, The Netherlands: Elsevier Science Publishers B.V. (North-Holland), 1992, pp. 281-294.
    [Bibtex]
    @InCollection{CCS-RFMS-92,
    Title = {Improving Throughput Upper Bounds for Net Based Models of Manufacturing Systems},
    Author = {J. Campos and J.M. Colom and M. Silva},
    Booktitle = {Robotics and Flexible Manufacturing Systems},
    Publisher = {Elsevier Science Publishers B.V. (North-Holland)},
    Year = {1992},
    Address = {Amsterdam, The Netherlands},
    Editor = {J.C. Gentina and S.G. Tzafestas},
    Pages = {281-294},
    Abstract = {This paper addresses the improvement of throughput upper bounds for live and bounded stochastic Petri nets, presented by the authors in previous works. The introduction of a greater amount of structural information, traps and implicit places, allows to improve the bounds using linear programming problems defined on the net structure, on the routing probabilities, and on the mean service time of transitions. The obtained bounds can be applied for the analysis of manufacturing systems modelled by means of stochastic Petri nets. An example is presented and evaluated using the introduced techniques.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/ccs-rfms-92.pdf}
    }
  • [DOI] J. Campos and M. Silva, “Structural Techniques and Performance Bounds of Stochastic Petri Net Models,” Lecture Notes in Computer Science, vol. 609, pp. 352-391, 1992.
    [Bibtex]
    @Article{CS-LNCS-92,
    Title = {Structural Techniques and Performance Bounds of Stochastic {Petri} Net Models},
    Author = {J. Campos and M. Silva},
    Journal = {Lecture Notes in Computer Science},
    Year = {1992},
    Pages = {352-391},
    Volume = {609},
    Abstract = {In this paper we overview some recent results obtained by the authors and collaborators on the performance bounds analysis of some stochastic Petri net systems. The mathematical model can be seen either as a result of the addition of a particular random timing interpretation to an "autonomous'' Petri net or as a generalization of classical queueing networks with the addendum of a general synchronization primitive. It constitutes an adequate tool for both the validation of logical properties and the evaluation of performance measures of concurrent and distributed systems. Qualitative and quantitative understandings of Petri net models are stressed here making special emphasis on structural techniques for the analysis of logical and performance properties. Important aspects from the performance point of view, such as relative throughput of stations (transitions), and number of servers present at them, are related to Petri net concepts like P- or T-semiflows or liveness bounds of transitions. For the particularly interesting case of Markovian Petri net systems, some improvements of the bounds can be achieved. Marked graphs and free choice are net subclasses for which the obtained results have special quality, therefore an additional attention is focussed on them.},
    Address = {Berlin},
    Booktitle = {Advances in Petri Nets 1992},
    Doi = {10.1007/3-540-55610-9_178},
    Editor = {G. Rozenberg},
    Publisher = {Springer-Verlag},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cs-lncs-92.pdf}
    }
  • J. Ezpeleta and J. Martínez, “Formal specification and validation in production plants,” , pp. 64-73, 1992.
    [Bibtex]
    @InProceedings{Ezpeleta1992,
    Title = {Formal specification and validation in production plants},
    Author = {J. Ezpeleta and J. Mart\'{i}nez},
    Booktitle = {Procs. of Ressenlaers 3rd International Conference on Computer Integrated Manufacturing},
    Year = {1992},
    Address = {Troy (New York) USA},
    Month = {May},
    Pages = {64--73},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. Ezpeleta and J. Martínez, “Petri Nets as a specification language for manufacturing systems,” , pp. 427-436, 1992.
    [Bibtex]
    @InCollection{Ezpeleta1992a,
    Title = {Petri Nets as a specification language for manufacturing systems},
    Author = {J. Ezpeleta and J. Mart\'{i}nez},
    Booktitle = {Robotics and Flexible Manufacturing Systems},
    Publisher = {Elsevier Science Publishers (North--Holland)},
    Year = {1992},
    Address = {Amsterdam, The Netherlands},
    Editor = {J.C. Gentina and A.G. Tzafestas},
    Pages = {427--436},
    Entrytype = {incollection},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • P. R. Muro, J. Ezpeleta, and J. L. Villarroel, “A rule–Petri net integrated approach for the modeling and analysis of manufacturing systems,” , pp. 349-358, 1992.
    [Bibtex]
    @InProceedings{P.R.Muro1992,
    Title = {A rule--Petri net integrated approach for the modeling and analysis of manufacturing systems},
    Author = {P.R. Muro and J. Ezpeleta and J.L. Villarroel},
    Booktitle = {Robotics and Flexible Manufacturing Sytems},
    Year = {1992},
    Address = {Amsterdam, The Netherlands},
    Editor = {S.G. Tzafestas and J.C. Gentina},
    Pages = {349--358},
    Publisher = {Elsevier Science Publishers (North--Holland)},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • M. Silva, J. M. Colom, and J. Campos, “Linear Algebraic Techniques for the Analysis of Petri Nets” in Recent Advances in Mathematical Theory of Systems, Control, Networks, and Signal Processing II, Tokyo, Japan: Mita Press, 1992, pp. 35-42.
    [Bibtex]
    @InCollection{SCC-Mita-91,
    Title = {Linear Algebraic Techniques for the Analysis of {Petri} Nets},
    Author = {M. Silva and J.M. Colom and J. Campos},
    Booktitle = {Recent Advances in Mathematical Theory of Systems, Control, Networks, and Signal Processing II},
    Publisher = {Mita Press},
    Year = {1992},
    Address = {Tokyo, Japan},
    Pages = {35-42},
    Abstract = {One of the indigenous techniques for the analysis of Petri Net system models is based on its non-negative state equation, bridging convex goemetry and linear programming theories to the theory of Petri Nets. This invited survey briefly overviews some recent developments in the use of linear algebraic techniques for the qualitative (i.e., logical) and quantitative (i.e., performance) analysis of Petri Net system models, dealing with properties like deadlock-freeness, structural liveness or throughput bounds.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/scc-mita-91.pdf}
    }

1991

  • J. Campos, “Performance Analysis of Live and Bounded Free Choice Systems” in Design Methods Based on Nets, E. Best and J. Esparza, Eds., Sankt Augustin, Germany: , 1991, pp. 38-48.
    [Bibtex]
    @InCollection{C-DEMON-91,
    Title = {Performance Analysis of Live and Bounded Free Choice Systems},
    Author = {J. Campos},
    Booktitle = {Design Methods Based on Nets},
    Year = {1991},
    Address = {Sankt Augustin, Germany},
    Editor = {E. Best and J. Esparza},
    Month = {September},
    Pages = {38-48},
    Series = {GMD-Studien Nr. 198},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/c-demon-91.pdf}
    }
  • [DOI] J. Campos, G. Chiola, and M. Silva, “Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector,” IEEE Transactions on Software Engineering, vol. 17, iss. 2, pp. 117-125, 1991.
    [Bibtex]
    @Article{CCS-TSE-91,
    Title = {Ergodicity and Throughput Bounds of {Petri} Nets with Unique Consistent Firing Count Vector},
    Author = {J. Campos and G. Chiola and M. Silva},
    Journal = {IEEE Transactions on Software Engineering},
    Year = {1991},
    Month = {February},
    Number = {2},
    Pages = {117-125},
    Volume = {17},
    Abstract = {This paper addresses ergodicity and throughput bounds characterizations for a subclass of timed and stochastic Petri nets, interleaving qualitative and quantitative theories. The considered nets represent an extension of the well known subclass of marked graphs, defined as having a unique consistent firing count vector, independently of the stochastic interpretation of the net model. In particular, persistent and mono-T-semiflow nets subclasses are considered. Upper and lower throughput bounds are computed using linear programming problems defined on the incidence matrix of the underlying net. The bounds proposed here depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases). From a different perspective, the considered subclasses of stochastic nets can be viewed as special classes of synchronized queueing networks, thus the proposed bounds can be applied to these networks.},
    Doi = {10.1109/32.67593},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/ccs-tse-91.pdf}
    }
  • [DOI] J. Campos, G. Chiola, and M. Silva, “Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks,” IEEE Transactions on Automatic Control, vol. 36, iss. 12, pp. 1368-1382, 1991.
    [Bibtex]
    @Article{CCS-TAC-91,
    Title = {Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks},
    Author = {J. Campos and G. Chiola and M. Silva},
    Journal = {IEEE Transactions on Automatic Control},
    Year = {1991},
    Month = {December},
    Number = {12},
    Pages = {1368-1382},
    Volume = {36},
    Abstract = {Several proposals exist for the introduction of synchronization constraints into Queueing Networks (QN). We show that many monoclass QN with synchronizations can naturally be modelled with a subclass of Petri Nets (PN) called Free Choice nets (FC), for which a wide gamut of qualitative behavioural and structural results have been derived. We use some of these net theoretic results to characterize the ergodicity, boundedness and liveness of closed Free Choice Synchronized Queueing Networks (FCSQN). Moreover we define upper and lower throughput bounds based on the mean value of the service times, without any assumption on the probability distributions (thus including both the deterministic and the stochastic cases). We show that monotonicity properties exist between the throughput bounds and the parameters of the model in terms of population and service times. We propose (theoretically polynomial and practically linear complexity) algorithms for the computation of these bounds, based on linear programming problems defined on the incidence matrix of the underlying FC net. Finally, using classical laws from queueing theory, we provide bounds for mean queue lengths and response time.},
    Doi = {10.1109/9.106153},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/ccs-tac-91.pdf}
    }
  • J. Campos and J. M. Colom, “A Reachable Throughput Upper Bound for Live and Safe Free Choice Nets,” in Proceedings of the Twelfth International Conference on Application and Theory of Petri Nets, Gjern, Denmark, 1991, pp. 237-256.
    [Bibtex]
    @InProceedings{CC-Gjern-91,
    Title = {A Reachable Throughput Upper Bound for Live and Safe Free Choice Nets},
    Author = {J. Campos and J.M. Colom},
    Booktitle = {Proceedings of the Twelfth International Conference on Application and Theory of Petri Nets},
    Year = {1991},
    Address = {Gjern, Denmark},
    Month = {June},
    Organization = {EATCS},
    Pages = {237-256},
    Publisher = {IBM Deutschland},
    Abstract = {This paper addresses the computation of upper bounds for the throughput of transitions of live and safe deterministically or stochastically timed free choice nets. The obtained results are extensions of the marked graph case, presented by the authors in previous works. Polynomial complexity algorithms are derived using linear programming techniques. The obtained values are tight in the sense that, with the only knowledge of the net topology, the mean service times of transitions, and the routing rates at conflicts, is not possible to improve the bounds.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cc-gjern-91.pdf}
    }
  • J. Campos, J. M. Colom, and M. Silva, “Improving Throughput Upper Bounds for Net Based Models,” in Proceedings of the IMACS-IFAC International Symposium on Modeling and Control of Technological Systems, Lille, France, 1991, pp. 573-582.
    [Bibtex]
    @InProceedings{CCS-Lille-91,
    Title = {Improving Throughput Upper Bounds for Net Based Models},
    Author = {J. Campos and J.M. Colom and M. Silva},
    Booktitle = {Proceedings of the IMACS-IFAC International Symposium on Modeling and Control of Technological Systems},
    Year = {1991},
    Address = {Lille, France},
    Month = {May},
    Pages = {573-582},
    Abstract = {This paper addresses the improvement of throughput upper bounds for live and bounded stochastic Petri nets, presented by the authors in previous works. The introduction of a greater amount of structural information, traps and implicit places, allows to improve the bounds using linear programming problems defined on the net structure, on the routing probabilities, and on the mean service time of transitions. The obtained bounds can be applied for the analysis of manufacturing systems modelled by means of stochastic Petri nets. An example is presented and evaluated using the introduced techniques.}
    }
  • [DOI] J. Campos, B. Sánchez, and M. Silva, “Throughput Lower Bounds for Markovian Petri Nets: Transformation Techniques,” in Proceedings of the 4rd International Workshop on Petri Nets and Performance Models, Melbourne, Australia, 1991, pp. 322-331.
    [Bibtex]
    @InProceedings{CSS-Melbourne-91,
    Title = {Throughput Lower Bounds for {Markovian} {Petri} Nets: Transformation Techniques},
    Author = {J. Campos and B. S{\'a}nchez and M. Silva},
    Booktitle = {Proceedings of the 4rd International Workshop on Petri Nets and Performance Models},
    Year = {1991},
    Address = {Melbourne, Australia},
    Month = {December},
    Pages = {322-331},
    Publisher = {IEEE-Computer Society Press},
    Abstract = {This paper addresses the computation of lower bounds for the steady- state throughput of stochastic Petri nets with immediate and exponentially distributed service times of transitions. We try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing networks theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering some pessimistic transformation rules operating locally on the net structure, its initial marking, and stochastic interpretation. Special interest have the obtained results for the case of live and bounded free choice nets and live marked graphs systems.},
    Doi = {10.1109/PNPM.1991.238788},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/css-melbourne-91.pdf}
    }
  • [DOI] J. Campos and M. Silva, “Throughput Upper Bounds for Markovian Petri Nets: Embedded Subnets and Queueing Networks,” in Proceedings of the 4rd International Workshop on Petri Nets and Performance Models, Melbourne, Australia, 1991, pp. 312-321.
    [Bibtex]
    @InProceedings{CS-Melbourne-91,
    Title = {Throughput Upper Bounds for {Markovian} {Petri} Nets: Embedded Subnets and Queueing Networks},
    Author = {J. Campos and M. Silva},
    Booktitle = {Proceedings of the 4rd International Workshop on Petri Nets and Performance Models},
    Year = {1991},
    Address = {Melbourne, Australia},
    Month = {December},
    Pages = {312-321},
    Publisher = {IEEE-Computer Society Press},
    Abstract = {This paper addresses the computation of upper bounds for the steady-state throughput of stochastic Petri nets with immediate and exponentially distributed service times of transitions. We try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing network theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering the slowest embedded subnet (generated by the support of left annullers of the incidence matrix of the net). The obtained results for the case of live and bounded free choice nets are of special interest. For such nets, the subnets generated by the left annullers of the incidence matrix can be seen as embedded product-form closed monoclass queueing networks, and efficient algorithms exist for their analysis.},
    Doi = {10.1109/PNPM.1991.238789},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cs-melbourne-91.pdf}
    }
  • J. Ezpeleta and J. M. Couvreur, “A new technique for finding a generating family of siphons, traps and st–components. Application to colored Petri Nets,” , pp. 145-164, 1991.
    [Bibtex]
    @InProceedings{Ezpeleta1991,
    Title = {A new technique for finding a generating family of siphons, traps and st--components. Application to colored Petri Nets},
    Author = {J. Ezpeleta and J.M. Couvreur},
    Booktitle = {Proceedings of the 12th International Conference on Application and Theory of Petri Nets},
    Year = {1991},
    Address = {Aarhus, Denmark},
    Pages = {145--164},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. Ezpeleta and J. Martínez, “Petri Nets as a specification language for manufacturing systems,” , 1991.
    [Bibtex]
    @InProceedings{Ezpeleta1991a,
    Title = {Petri Nets as a specification language for manufacturing systems},
    Author = {J. Ezpeleta and J. Mart\'{i}nez},
    Booktitle = {Proceedings of the 13th IMACS World Congress on Computation and Applied Mathematics},
    Year = {1991},
    Address = {Dublin, Ireland},
    Month = {July},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. M. Luciañez, J. Merseguer, and J. M. Torralba, “Sistemas de ayuda a las decisiones. Metodología de desarrollo de aplicaciones,” in ACTAS DE LAS JORNADAS SOBRE TECNOLOGI’AS DE LA INFORMACIO’N PARA LA MODERNIZACIO’N DE LAS ADMINISTRACIONES PU’BLICAS (TECNIMAP–91), Valencia, Spain, 1991.
    [Bibtex]
    @InProceedings{Lucianez1991,
    Title = {Sistemas de ayuda a las decisiones. Metodolog\'{i}a de desarrollo de aplicaciones},
    Author = {Lucia\~nez, J.M. and Merseguer, J. and Torralba, J.M.},
    Booktitle = {ACTAS DE LAS JORNADAS SOBRE TECNOLOGI'AS DE LA INFORMACIO'N PARA LA MODERNIZACIO'N DE LAS ADMINISTRACIONES PU'BLICAS (TECNIMAP--91)},
    Year = {1991},
    Address = {Valencia, Spain},
    Month = {December},
    Note = {ISBN 84--7088--546--4},
    Publisher = {Ministerio Administraciones P\'{u}blicas}
    }
  • P. Muro, J. Ezpeleta, and J. L. Villarroel, “Knowledge based manufacturing modelling and analysis by integrating Petri nets,” , pp. 660-668, 1991.
    [Bibtex]
    @InProceedings{P.Muro1991,
    Title = {Knowledge based manufacturing modelling and analysis by integrating Petri nets},
    Author = {P. Muro and J. Ezpeleta and J.L. Villarroel},
    Booktitle = {Proceedings of the IMACS Symposium on Modelling and Control of Technologycal Systems},
    Year = {1991},
    Address = {Lille, France},
    Month = {May},
    Pages = {660--668},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • M. Silva, J. M. Colom, and J. Campos, “Linear Algebraic Techniques for the Analysis of Petri Nets,” in Proceedings of the International Symposium on the Mathematical Theory of Networks and Systems, Kobe, Japan, 1991, pp. 413-415.
    [Bibtex]
    @InProceedings{SCC-Kobe-91,
    Title = {Linear Algebraic Techniques for the Analysis of {Petri} Nets},
    Author = {M. Silva and J.M. Colom and J. Campos},
    Booktitle = {Proceedings of the International Symposium on the Mathematical Theory of Networks and Systems},
    Year = {1991},
    Address = {Kobe, Japan},
    Month = {June},
    Pages = {413-415},
    Abstract = {One of the indigenous techniques for the analysis of Petri Net system models is based on its non-negative state equation, bridging convex goemetry and linear programming theories to the theory of Petri Nets. This invited survey briefly overviews some recent developments in the use of linear algebraic techniques for the qualitative (i.e., logical) and quantitative (i.e., performance) analysis of Petri Net system models, dealing with properties like deadlock-freeness, structural liveness or throughput bounds.}
    }

1990

  • J. Campos, “Performance Bounds for Synchronized Queueing Networks,” PhD Thesis, Research Report GISI-RR-90-20, 1990.
    [Bibtex]
    @PhdThesis{Campos-thesis-90,
    Title = {Performance Bounds for Synchronized Queueing Networks},
    Author = {J. Campos},
    School = {Departamento de Ingenier{\'{\i}}a El{\'e}ctrica e Inform{\'a}tica, Universidad de Zaragoza, Spain},
    Year = {1990},
    Address = {Research Report GISI-RR-90-20},
    Month = {October},
    Abstract = {Product form queueing networks have long been used for the performance evaluation of computer systems. Their success has been due to their capability of naturally expressing sharing of resources and queueing, that are typical situations of traditional computer systems, as well as to their efficient solution algorithms, of polynomial complexity on the size of the model. Unfortunately, the introduction of synchronization constraints usually destroys the product form solution, so that general concurrent and distributed systems are not easily studied with this class of models. Petri nets have been proved specially adequate to model parallel and distributed systems. Moreover, they have a well-founded theory of analysis that allows to investigate a great number of qualitative properties of the system. In the original definition, Petri nets did not include the notion of time, and tried to model only the logical behaviour of systems by describing the causal relations existing among events. This approach showed its power in the specification and analysis of concurrent systems in a way independent of the concept of time. Nevertheless the introduction of a timing specification is essential if we want to use this class of models for the performance evaluation of distributed systems. One of the main problems in the actual use of timed and stochastic Petri net models for the quantitative evaluation of large systems is the explosion of the computational complexity of the analysis algorithms. In general, exact performance results are obtained from the numerical solution of a continuous time Markov chain, whose dimension is given by the size of the state space of the model. Structural computation of exact performance measures has been possible for some subclasses of nets such as those with state machine topology. These nets, under certain assumptions on the stochastic interpretation are isomorphic to Gordon and Newell's networks, in queueing theory terminology. In the general case, efficient methods for the derivation of performance measures are still needed. Two complementary approaches to the derivation of exact measures for the analysis of distributed systems are the utilization of approximation techniques and the computation of bounds. Approximate values for the performance parameters are in general more efficiently derived than the exact ones. On the other hand, "exactness'' only exists in theory! In other words, numerical algorithms must be applied in practice for the computation of exact values, therefore making errors is inevitable. Performance bounds are useful in the preliminary phases of the design of a system, in which many parameters are not known accurately. Several alternatives for those parameters should be quickly evaluated, and rejected those that are clearly bad. Exact (and even approximate) solutions would be computationally very expensive. Bounds become useful in these instances since they usually require much less computation effort. The computation of upper and lower bounds for the steady-state performance of timed and stochastic Petri nets is considered in this work. In particular, we study the throughput of transitions, defined as the average number of firings per time unit. For this measure we try to compute upper and lower bounds in polynomial time on the size of the net model, by means of proper linear programming problems defined from the incidence matrix of the net (in this sense, we develop structural techniques). These bounds depend only on the mean values and not on the higher moments of the probability distribution functions of the random variables that describe the timing of the system. The independence of the probability distributions can be viewed as a useful generalization of the performance results, since higher moments of the delays are usually unknown for real cases, and difficult to estimate and assess. From a different perspective, the obtained results can be applied to the analysis of queueing networks extended with some synchronization schemes. Monoclass queueing networks can be mapped on stochastic Petri nets. On the other hand, stochastic Petri nets can be interpreted as monoclass queueing networks augmented with synchronization primitives. Concerning the presentation of this manuscript, it should be mentioned that chapter 1 has been written with the object of giving the reader an outline of the stochastic Petri net model: its definition, terminology, basic properties, and related concepts, together with its deep relation with other classic stochastic network models. Chapter 2 is devoted to the presentation of the net subclasses considered in the rest of the work. The classification presented here is quite different from the one which is usual in the framework of Petri nets. The reason lies on the fact that our classification criterion, the computability of visit ratios for transitions, is introduced for the first time in the field of stochastic Petri nets in this work. The significance of that criterion is based on the important role that the visit ratios play in the computation of upper and lower bounds for the performance of the models. Nevertheless, classical important net subclasses are identified here in terms of the computability of their visit ratios from different parameters of the model. Chapter 3 is concerned with the computation of reachable upper and lower bounds for the most restrictive subclass of those presented in chapter 2: marked graphs. The explanation of this fact is easy to understand. The more simple is the model the more accessible will be the techniques an ideas for the development of good results. Chapter 4 provides a generalization for live and bounded free choice nets of the results presented in the previous chapter. Quality of obtained bounds is similar to that for strongly connected marked graphs: throughput lower bounds are reachable for bounded nets while upper bounds are reachable for 1-bounded nets. Chapter 5 considers the extension to other net subclasses, like mono-T-semiflow nets, FRT-nets, totally open deterministic systems of sequential processes, and persistent nets. The results are of diverse colours. For mono-T-semiflow nets and, therefore, for general FRT-nets, it is not possible (so far) to obtain reachable throughput bounds. On the other hand, for bounded ordinary persistent nets, tight throughput upper bounds are derived. Moreover, in the case of totally open deterministic systems of sequential processes the exact steady-state performance measures can be computed in polynomial time on the net size. In chapter 6 bounds for other interesting performance measures are derived from throughput bounds and from classical queueing theory laws. After that, we explore the introduction of more information from the probability distribution functions of service times in order to improve the bounds. In particular, for Coxian service delay of transitions it is possible to improve the throughput upper bounds of previous chapters which held for more general forms of distribution functions. This improvement shows to be specially fruitful for live and bounded free choice nets. Chapter 7 is devoted to case studies. Several examples taken from literature in the fields of distributed computing systems and manufacturing systems are modelled by means of stochastic Petri nets and evaluated using the techniques developed in previous chapters. Finally, some concluding remarks and considerations on possible extensions of the work are presented.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/campos-thesis-90.pdf}
    }
  • [DOI] J. Campos, J. M. Colom, and M. Silva, “Performance Evaluation of Repetitive Automated Manufacturing Systems,” in Proceedings of the Rensselaer’s Second International Conference on Computer Integrated Manufacturing, Rensselaer Polytechnic Institute, Troy, NY, USA, 1990, pp. 74-81.
    [Bibtex]
    @InProceedings{CCS-Rensselaer-90,
    Title = {Performance Evaluation of Repetitive Automated Manufacturing Systems},
    Author = {J. Campos and J.M. Colom and M. Silva},
    Booktitle = {Proceedings of the Rensselaer's Second International Conference on Computer Integrated Manufacturing},
    Year = {1990},
    Address = {Rensselaer Polytechnic Institute, Troy, NY, USA},
    Month = {May},
    Pages = {74-81},
    Publisher = {IEEE-Computer Society Press},
    Abstract = {Steady-state performance evaluation of some repetitive automated manufacturing systems modelled by means of stochastic or deterministic timed Petri nets is considered. Basically, concepts and techniques developed by the authors in other works are applied to repetitive manufacturing systems in this paper. Linear programming problems defined on the incidence matrix of the underlying Petri nets are used to compute tight upper and lower bounds for the performance measures of job-shop systems and decision-free kanban systems in polynomial time on the net structure. The results can be extended to other models in which some decisions are allowed, such as producer-consumer systems with mutual exclusion. Exact performance measures for a class of systems containing sequential processes can be computed in polynomial time.},
    Doi = {10.1109/CIM.1990.128074},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/ccs-rensselaer-90.pdf}
    }
  • J. Campos and M. Silva, “Steady-State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes” in Decentralized Systems, M. Cosnard and C. Girault, Eds., Amsterdam, The Netherlands: Elsevier Science Publishers B.V. (North-Holland), 1990, pp. 427-438.
    [Bibtex]
    @InCollection{CS-DS-90,
    Title = {Steady-State Performance Evaluation of Totally Open Systems of {Markovian} Sequential Processes},
    Author = {J. Campos and M. Silva},
    Booktitle = {Decentralized Systems},
    Publisher = {Elsevier Science Publishers B.V. (North-Holland)},
    Year = {1990},
    Address = {Amsterdam, The Netherlands},
    Editor = {M. Cosnard and C. Girault},
    Pages = {427-438},
    Abstract = {Totally open systems of Markovian sequential processes are defined as a subclass of stochastic Petri nets. They can be viewed as a generalization of a subclass of queueing networks in which complex sequential servers can be synchronized according to some particular schemes. Structural analysis of these nets is considered for avoiding the state explotion problem of the embedded Markov chain. Some qualitative properties interesting from a performance point of view are presented. In particular, a "potential ergodicity'' property is characterized by means of two structural properties: consistency and synchronic distance relation. Necessary and sufficient ergodicity conditions and the computation of steady-state performance measures are studied.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cs-ds-90.pdf}
    }
  • J. M. Colom, J. Campos, and M. Silva, “On liveness analysis through linear algebraic techniques,” in Proceedings of the Annual General Meeting of ESPRIT Basic Research Action 3148 Design Methods Based on Nets (DEMON), Paris, France, 1990.
    [Bibtex]
    @InProceedings{CCS-DEMON-90,
    Title = {On liveness analysis through linear algebraic techniques},
    Author = {J.M. Colom and J. Campos and M. Silva},
    Booktitle = {Proceedings of the Annual General Meeting of ESPRIT Basic Research Action 3148 Design Methods Based on Nets (DEMON)},
    Year = {1990},
    Address = {Paris, France},
    Month = {June},
    Abstract = {Proving properties of Place/Transition Nets through Linear Algebraic Techniques is very interesting because of the polynomial complexity of the algorithms used for this purpose. In this sense, many works have been devoted to the linear analysis of marking related properties (e.g. boundedness of the state space, mutual exclusions, etc.). Nevertheless, few results exist related to linear analysis of liveness properties. In this note, we investigate some applications of linear techniques to partial characterization of liveness properties. First, a necessary condition for structural liveness in structural bounded nets is presented. It is based on the rank of the incidence matrix. Finally, given an initial marking, some sufficient conditions for dead transitions and for deadlock-freeness are presented.},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/ccs-demon-90.pdf}
    }
  • J. Martínez and J. Ezpeleta, “Flexible manufacturing system,” , 1990.
    [Bibtex]
    @InProceedings{Martinez1990,
    Title = {Flexible manufacturing system},
    Author = {J. Mart\'{i}nez and J. Ezpeleta},
    Booktitle = {Proceedings of Design Methods Based on Nets, Esprit Basic Research Action 3148, W.G. 6},
    Year = {1990},
    Address = {Paris (France)},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }
  • J. Martínez and J. Ezpeleta, “The lift example,” , 1990.
    [Bibtex]
    @InProceedings{Martinez1990a,
    Title = {The lift example},
    Author = {J. Mart\'{i}nez and J. Ezpeleta},
    Booktitle = {Proceedings of Design Methods Based on Nets, Esprit Basic Research Action 3148, W.G. 6},
    Year = {1990},
    Address = {Paris (France)},
    Entrytype = {inproceedings},
    Owner = {ezpeleta},
    Timestamp = {2017.05.22}
    }

1989

  • [DOI] J. Campos, G. Chiola, J. M. Colom, and M. Silva, “Tight Polynomial Bounds for Steady-State Performance of Marked Graphs,” in Proceedings of the 3rd International Workshop on Petri Nets and Performance Models, Kyoto, Japan, 1989, pp. 200-209.
    [Bibtex]
    @InProceedings{CCCS-Kyoto-89,
    Title = {Tight Polynomial Bounds for Steady-State Performance of Marked Graphs},
    Author = {J. Campos and G. Chiola and J.M. Colom and M. Silva},
    Booktitle = {Proceedings of the 3rd International Workshop on Petri Nets and Performance Models},
    Year = {1989},
    Address = {Kyoto, Japan},
    Month = {December},
    Pages = {200-209},
    Publisher = {IEEE Computer Society Press},
    Abstract = {The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic Marked Graphs is studied. In particular, Linear Programming problems defined on the incidence matrix of the underlying Petri nets are used to compute tight (i.e., reachable) bounds for the throughput of transitions for live and bounded Marked Graphs with time associated with transitions. These bounds depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases). Connections between results and techniques typical of qualitative and quantitative analysis of Petri models are stressed.},
    Doi = {10.1109/PNPM.1989.68553},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/cccs-kyoto-89.pdf}
    }
  • [DOI] J. Campos, G. Chiola, and M. Silva, “Properties and Steady-State Performance Bounds for Petri Nets with Unique Repetitive Firing Count Vector,” in Proceedings of the 3rd International Workshop on Petri Nets and Performance Models, Kyoto, Japan, 1989, pp. 210-220.
    [Bibtex]
    @InProceedings{CCS-Kyoto-89,
    Title = {Properties and Steady-State Performance Bounds for {Petri} Nets with Unique Repetitive Firing Count Vector},
    Author = {J. Campos and G. Chiola and M. Silva},
    Booktitle = {Proceedings of the 3rd International Workshop on Petri Nets and Performance Models},
    Year = {1989},
    Address = {Kyoto, Japan},
    Month = {December},
    Pages = {210-220},
    Publisher = {IEEE Computer Society Press},
    Abstract = {The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic Petri nets is studied. In particular, Linear Programming problems defined on the incidence matrix of underlying Petri net are used to compute bounds for the throughput of transitions for live and bounded nets with a unique possibility of steady-state behaviour. These classes of nets are defined and their characteristics are studied. The bounds proposed here depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases); moreover they can be computed also for non-ergodic models. Connections between results and techniques typical of qualitative and quantitative analysis of Petri models are stressed.},
    Doi = {10.1109/PNPM.1989.68554},
    Url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/ccs-kyoto-89.pdf}
    }
  • J. Campos and M. Silva, “Steady-State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes,” in Proceedings of the Working Conference on Decentralized Systems, Lyon, France, 1989, pp. 559-585.
    [Bibtex]
    @InProceedings{CS-Lyon-89,
    Title = {Steady-State Performance Evaluation of Totally Open Systems of {Markovian} Sequential Processes},
    Author = {J. Campos and M. Silva},
    Booktitle = {Proceedings of the Working Conference on Decentralized Systems},
    Year = {1989},
    Address = {Lyon, France},
    Month = {December},
    Pages = {559-585},
    Publisher = {International Federation for Information Processing W.G.~10.3},
    Abstract = {Totally open systems of Markovian sequential processes are defined as a subclass of stochastic Petri nets. They can be viewed as a generalization of a subclass of queueing networks in which complex sequential servers can be synchronized according to some particular schemes. Structural analysis of these nets is considered for avoiding the state explotion problem of the embedded Markov chain. Some qualitative properties interesting from a performance point of view are presented. In particular, a "potential ergodicity'' property is characterized by means of two structural properties: consistency and synchronic distance relation. Necessary and sufficient ergodicity conditions and the computation of steady-state performance measures are studied.}
    }
  • ArgoSPE, \tt http://argospe.tigris.org.
    [Bibtex]
    @Unpublished{ArgoSPE,
    Title = {{\tt http://argospe.tigris.org}},
    Author = {{ArgoSPE}}
    }
  • The CSM to PN Translator.
    [Bibtex]
    @Misc{CSM2PN,
    Title = {{The CSM to PN Translator}},
    Note = {{\tt http://webdiis.unizar.es/\~{}jmerse/csm2pn.html}},
    Key = {CSM2PN}
    }