Publications

Export 663 results:
Sort by: Author Title [ Type (Desc)] Year
Journal Article
[1454] Julvez, J, DiCairano S, Bemporad A, Mahulea C.  2014.  Event-Driven Model Predictive Control of Timed Hybrid Petri Nets. International Journal of Robust and Nonlinear Control. 24(12)
[BuhMay97] Buhrman, H, Mayordomo E.  1997.  An excursion to the Kolmogorov random strings. Journal of Computer and System Sciences. 54:393-399.
0 icon
97_BM_JCSS.ps
[1452] Mahulea, C, Seatzu C, Cabasino MP, Silva M.  2012.  Fault Diagnosis of Discrete-Event Systems using Continuous Petri Nets. IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans. 42(4):970-984.
[DaLaLuMaFSD] Dai, JJ, Lathrop JI, Lutz JH, Mayordomo E.  2004.  Finite state dimension. Theoretical Computer Science. 310:1-33.
0 icon
fsd.ps
[HiLuMa05] Hitchcock, JM, Lutz JH, Mayordomo E.  2005.  The fractal geometry of complexity classes. SIGACT News. 36:24-38.
0 icon
fgcc.pdf
[RP-85-03] Alla, H, Ladet P.  1985.  Generalized Inverses and the Calculation of Symbolic Invariants for Colored Petri Nets. Technique et Science Informatique (TSI). 4:113-126.
[Cam-TII-10] Campos, J.  2010.  Guest Editorial: Special Section on Formal Methods in Manufacturing. IEEE Transactions on Industrial Informatics. 6(2):125-126.
application/pdf icon
10_Cam_TII.pdf
[RP-82-04] Silva, M.  1982.  Hacia una nueva concepción del análisis y diseño de los sistemas lógicos secuenciales. :51-57.
[1490] Silva, M.  2013.  Half a century after Carl Adam Petri's PhD thesis: a perspective on the field. Annual Reviews in Control. 37(2):191-219.
[1531] Fraca, E, Julvez J, Silva M.  2015.  Hybrid and Hybrid Adaptive Petri Nets: on the computation of a Reachability Graph. Nonlinear Analysis: Hybrid Systems. 16
[1297] Mayordomo, E, Lutz JH, Fortnow L.  2012.  Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
[MayKCCCHD] Mayordomo, E.  2002.  A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters. 84:1-3.
0 icon
02_May_IPL.ps
[MR-97] Merseguer, J, Romero J.  1997.  La herencia en el modelo orientado a objetos, del análisis a la implementación. :21-30.
[RP-83-03] Martínez, J, Silva M.  1983.  Lenguajes de Programación para el Control de Procesos Industriales. :127-137.
[RP-83-04] Silva, M.  1983.  Lenguajes de programación para robots industriales (Parte I). :35-48.
[RP-84-02] Silva, M.  1984.  Lenguajes de programación para robots industriales (Parte II). :39-53.
[1556] Kloetzer, M, Mahulea C.  2015.  LTL-based Planning in Environments with Probabilistic Observations. IEEE Transactions on Automation Science and Engineering. 12(4)
[LutMayMSDHL] Lutz, JH, Mayordomo E.  1994.  Measure stochasticity and the density of hard languages. SIAM Journal on Computing. 23:762-779.
0 icon
94_LM_SIAMJoC.ps
[BC-TSMC-13] Bernardi, S, Campos J.  2013.  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. 43(5):1167-1181.
[1434] Wang, L, Mahulea C, Julvez J, Silva M.  2012.  Minimum-time Decentralized Control of Choice-Free Continuous Petri Nets. Nonlinear Analysis: Hybrid Systems.
[1453] Wang, L, Mahulea C, Julvez J, Silva M.  2013.  Minimum-time Decentralized Control of Choice-Free Continuous Petri Nets. Nonlinear Analysis: Hybrid Systems. 7(1):39-53.
[1481] Requeno, JI, Colom JM.  2013.  Model checking software for phylogenetic trees using distribution and database methods. Journal of Integrative Bioinformatics. 10(3) Abstract
[ARReTeSi97] Recalde, L, Teruel E, Silva M.  1998.  Modeling and Analysis of Sequential Processes that Cooperate through Buffers. IEEE Trans on Robotics and Automation. 14:267-277.
[1525] Rodríguez, RJ, Bernardi S, Merseguer J.  2015.  Modelling Security of Critical Infrastructures: A Survivability Assessment. The Computer Journal. 58(10)
application/pdf icon
RMB-TCJ-14.pdf
[HerMay94] Hermo, M, Mayordomo E.  1994.  A note on polynomial size circuits with low resource bounded Kolmogorov complexity. Mathematical Systems Theory. 27:247-356.
0 icon
94_HM_MST.ps