Publications
Filters: Author is M. Silva [Clear All Filters]
[1529] The bound Reaching Problem on the Fluidization of Timed Petri Nets. 12th Int. Workshop on Discrete Event Systems.
.
2014.
[ICTeSi94] Well-formedness of Equal Conflict Systems. Application and Theory of Petri Nets 1994. 815:491-510.
.
1994.
[IPSiRe03b] Unforced Continuous Petri Nets and Positive Systems. Lecture Notes in Control and Information Sciences.
.
2003.
[RP-80-06] Un plan de prácticas. Dpto. de Automática de la E.T.S.I. Industriales de la U.Z.. :117-134.
.
1980.
[RP-83-07] Un plan de prácticas de sistemas de control muestreados. :279-295.
.
1983.
[ZRS-Wod00] A Two Phase Optimisation Strategy for DEDS Application to Manufacturing Systems. :291-298.
.
2000.
[ZRS-JIM-01] A Two Phase Optimisation Method for Petri Net Models of Manufacturing Systems. Journal of Intelligent Manufacturing. 12:421-432.
.
2001.
[RZS-04] Two Heuristics for the Improvement of a Two-Phase Optimization Method for Manufacturing Systems. :1686-1692.
.
2004.
[RP-80-08] Traducción de expresiones lógicas: aplicación en autómatas programables y en la enseñanza. :664-670.
.
1980.
.
2006.
[ICSilv87] Towards a Synchrony Theory for P/T Nets. Concurrency and Nets. :435-460.
.
1987.
[RP-87-04] Towards a Synchrony Theory for P/T Nets. :435-460.
.
1987.
[ICEsSi91b] Top-Down Synthesis of Live and Bounded Free Choice Nets. Advances in Petri Nets 91. 524:118-139.
.
1991.
[RP-91-30] Top-down synthesis of live and bounded free choice nets. 524:118-139.
.
1991.
[RP-90-02] Top-down synthesis of live & bounded Free Choice Nets. :63-83.
.
1990.
[RP-85-09] Tolerancia a fallos en aplicaciones tiempo real. :111-124.
.
1985.
[1267] Timing-dependent boundedness and liveness in continuous Petri nets. 10th International Workshop on Discrete Event Systems (WODES).
.
2010.
[1316] Timing and liveness in continuous Petri nets. Automatica. 47(2):283--290.
.
2011.
[IPVaMaMiReSi08] Timing and Deadlock-freeness in Continuous Petri Nets. IFAC World Congress. 17
.
2008.
[State-of-the-art-93] The Timed Coloured Petri Net Formalism Position Paper. 14:3-60.
.
1993.
[278] Tight Polynomial Bounds for Steady-State Performance of Marked Graphs. Third IEEE International Workshop on Petri Nets and Performance Models (PNPM'89). :200-209.
.
1989.
[RP-96-12] A Throughtput Approximation Algorithm for Decision Free Processes. :161-178.
.
1996.
[CS-Melbourne-91] Throughput Upper Bounds for Markovian Petri Nets Embedded Subnets and Queueing Networks. :312-321.
.
1991.
[CSS-Melbourne-91] Throughput Lower Bounds for Markovian Petri Nets Transformation Techniques. :322-331.
.
1991.
[RP-97-06] Throughput Approximation of Decision Free Processes Using Decomposition. :174-182.
.
1997.