Publications
Filters: First Letter Of Last Name is S [Clear All Filters]
[PJCS-RR69-2005] Approximate Throughput Computation of Stochastic Weighted T-Systems.
.
2005.
.
2009.
[TRMaGiReSeSi07] Optimal model predictive control of Timed Continuous Petri nets.
.
2008.
[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.
[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.
[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.
[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.
[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.
[1498] Controllability of Timed Continuous Petri Nets with uncontrollable transitions. International Journal of Control. Posted online: 01 Oct 2013
.
2013.
[ARJuReSi06] Deadlock-freeness analysis of continuous mono-T-semiflow Petri nets. IEEE Trans. on Automatic Control. 51:1472-1481.
.
2006.
[1539] Diagnosis of Time Petri Nets using Fault Diagnosis Graph. IEEE Transactions on Automatic Control. 60(9)
.
2015.
[RP-86-01] Diseño de un sistema didáctico de programación y control. :97-108.
.
1986.
[CS-PE-93] Embedded Product Form Queueing Networks and the Improvement of Performance Bounds for Petri Net Systems. Performance Evaluation. 18:3-19.
.
1993.
[CCS-TSE-91] Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector. IEEE Transactions on Software Engineering. 17:117-125.
.
1991.
[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.
[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.