Publications
[1454] Event-Driven Model Predictive Control of Timed Hybrid Petri Nets. International Journal of Robust and Nonlinear Control. 24(12)
.
2014.
[BuhMay97] An excursion to the Kolmogorov random strings. Journal of Computer and System Sciences. 54:393-399.
.
1997.
[1452] 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.
.
2012.
[DaLaLuMaFSD] Finite state dimension. Theoretical Computer Science. 310:1-33.
.
2004.
[HiLuMa05] The fractal geometry of complexity classes. SIGACT News. 36:24-38.
.
2005.
[RP-85-03] Generalized Inverses and the Calculation of Symbolic Invariants for Colored Petri Nets. Technique et Science Informatique (TSI). 4:113-126.
.
1985.
[Cam-TII-10] Guest Editorial: Special Section on Formal Methods in Manufacturing. IEEE Transactions on Industrial Informatics. 6(2):125-126.
.
2010.
[RP-82-04] Hacia una nueva concepción del análisis y diseño de los sistemas lógicos secuenciales. :51-57.
.
1982.
[1490] Half a century after Carl Adam Petri's PhD thesis: a perspective on the field. Annual Reviews in Control. 37(2):191-219.
.
2013.
[1531] Hybrid and Hybrid Adaptive Petri Nets: on the computation of a Reachability Graph. Nonlinear Analysis: Hybrid Systems. 16
.
2015.
[1297] Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
.
2012.
[MayKCCCHD] A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters. 84:1-3.
.
2002.
.
1997.
[RP-83-03] Lenguajes de Programación para el Control de Procesos Industriales. :127-137.
.
1983.
[RP-83-04] Lenguajes de programación para robots industriales (Parte I). :35-48.
.
1983.
[RP-84-02] Lenguajes de programación para robots industriales (Parte II). :39-53.
.
1984.
[1556] LTL-based Planning in Environments with Probabilistic Observations. IEEE Transactions on Automation Science and Engineering. 12(4)
.
2015.
[LutMayMSDHL] Measure stochasticity and the density of hard languages. SIAM Journal on Computing. 23:762-779.
.
1994.
[BC-TSMC-13] 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.
.
2013.
[1434] Minimum-time Decentralized Control of Choice-Free Continuous Petri Nets. Nonlinear Analysis: Hybrid Systems.
.
2012.
[1453] Minimum-time Decentralized Control of Choice-Free Continuous Petri Nets. Nonlinear Analysis: Hybrid Systems. 7(1):39-53.
.
2013.
[1481] Model checking software for phylogenetic trees using distribution and database methods. Journal of Integrative Bioinformatics. 10(3) Abstract
.
2013.
[ARReTeSi97] Modeling and Analysis of Sequential Processes that Cooperate through Buffers. IEEE Trans on Robotics and Automation. 14:267-277.
.
1998.
[1525] Modelling Security of Critical Infrastructures: A Survivability Assessment. The Computer Journal. 58(10)
.
2015.
[HerMay94] A note on polynomial size circuits with low resource bounded Kolmogorov complexity. Mathematical Systems Theory. 27:247-356.
.
1994.