Publications
[1522] Analyzing Phylogenetic Treeswith Timed and Probabilistic Model Checking: The Lactose Persistance Case Study. Journal of Integrative Bioinformatics. 11(3)
.
2014.
[1279] Approaching Minimum Time Control of Timed Continuous Petri nets. Nonlinear Analysis: Hybrid Systems.
.
2010.
[247] Approximate Throughput Computation of Stochastic Marked Graphs. IEEE Transactions on Software Engineering. 20(7):526-535.
.
1994.
[RP-92-13] Approximate throughput computation of stochastic marked graphs. Journal of Parallel and distributed computing. 15:282-295.
.
1992.
[PJCS-TSCM07] Approximate Throughput Computation of Stochastic Weighted T-Systems. IEEE Transactions on Systems, Man, and Cybernetics. Part A: Systems and Humans. 37:431-444.
.
2007.
[1278] An Automated Framework for Formal Verification of Timed Continuous Petri Nets. IEEE Transactions on Industrial Informatics. 6(3):471.
.
2010.
[1079] Automatic Synthesis of Colored Petri Nets for the Control of FMS. IEEE Transactions on Robotics and Automation. 13(3):327-337.
.
1997.
[RP-92-12] B-Fairness and Structural B-Fairness in Petri Net Models of Concurrent Systems. Journal of Computer and System Sciences. 44:447-477.
.
1992.
[910] A Banker's Solution for Deadlock Avoidance in FMS with Flexible Routing and Multiresource States. IEEE Transactions on Robotics and Automation. 18(4):621-625.
.
2002.
[1257] Basic Server Semantics and Performance Monotonicity of Continuous Petri Nets. Discrete Event Dynamic Systems. 19(2):212.
.
2009.
[RP-85-04] Binary-decision graphs for implementation of boolean functions. IEE Proceedings. :175-185.
.
1985.
[CPSM-RMUCM-93] Boundedness on Stochastic Petri Nets. Revista Matematica de la Universidad Complutense de Madrid. 6:123-136.
.
1993.
[1390] Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms. Eurasip Journal on Advances in Signal Processing. :17.
.
2007.
[1398] Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms. Eurasip Journal on Advances in Signal Processing. 2007:17.
.
2007.
[204] Choice-free Petri Nets: A Model for Deterministic Concurrent Systems with Bulk Services and Arrivals. IEEE Transactions on Systems, Man and Cybernetics. Part A: Systems and Humans. 27(1):73-83.
.
1997.
[1441] CiE: Programs, Proofs, Processes (Special Issue). Theory of Computing Systems. 51(3)
.
2012.
[1074] A Colored Petri Net Model of VHDL. Formal Methods in System Design. 7(1/2):101-123.
.
1995.
[1092] Comments on "Deadlock Avoidance Policy for Petri-Net Modeling of Flexible Manufacturing Systems with Shared Resources". IEEE Transactions on Automatic Control. 45(9):1760-1762.
.
2000.
[EzGP-03] COMPAS: un compilador para un lenguaje imperativo con aserciones embebidas. :47-51.
.
2003.
[1530] Complexity Analysis of Continuous Petri Nets. Fundamenta informaticae. Fundamenta Informaticae. 137:1-28.
.
2015.
[1426] Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports. 2(1)
.
2012.
[BC09] Computation of Performance Bounds for Real-time systems using Time Petri Nets. IEEE Transactions on Industrial Informatics. 5(2):168-180.
.
2009.
[1370] Computational framework for behavioural modelling of neural subsystems. Neurocomputing. 72(7-9):1667.
.
2009.
[1288] Continuous Petri Nets: Expressive Power and Decidability Issues. International Journal of Foundations of Computer Science. 21(2):235-256.
.
2010.
[1497] A Control Method for Distributed Continuous Mono-T-Semiflow Petri nets. International Journal of Control. 87(2)
.
2014.