Publications
] Filters: First Letter Of Title is T [Clear All Filters]
[RP-96-12] .
1996. A Throughtput Approximation Algorithm for Decision Free Processes. :161-178.
[1059] .
1993. Toward a Formal Semantics of IEEE Std. VHDL 1076. Euro-DAC’93 European Design Automation Conference with Euro-VHDL'93. :526-531.
[State-of-the-art-93] .
1993. The Timed Coloured Petri Net Formalism Position Paper. 14:3-60.
[CS-Melbourne-91] .
1991. Throughput Upper Bounds for Markovian Petri Nets Embedded Subnets and Queueing Networks. :312-321.
[CSS-Melbourne-91] .
1991. Throughput Lower Bounds for Markovian Petri Nets Transformation Techniques. :322-331.
[ICEsSi91b] .
1991. Top-Down Synthesis of Live and Bounded Free Choice Nets. Advances in Petri Nets 91. 524:118-139.
[RP-91-30] .
1991. Top-down synthesis of live and bounded free choice nets. 524:118-139.
[RP-90-02] .
1990. Top-down synthesis of live & bounded Free Choice Nets. :63-83.
[278] .
1989. Tight Polynomial Bounds for Steady-State Performance of Marked Graphs. Third IEEE International Workshop on Petri Nets and Performance Models (PNPM'89). :200-209.
[ICSilv87] .
1987. Towards a Synchrony Theory for P/T Nets. Concurrency and Nets. :435-460.
[RP-87-04] .
1987. Towards a Synchrony Theory for P/T Nets. :435-460.
[RP-86-06] .
1986. Terminal controllers for robots: Shooting and optimal control. :384-389.
[RP-85-09] .
1985. Tolerancia a fallos en aplicaciones tiempo real. :111-124.
[RP-80-08] .
1980. Traducción de expresiones lógicas: aplicación en autómatas programables y en la enseñanza. :664-670.
