Publications
Filters: First Letter Of Last Name is S [Clear All Filters]
[CS-LNCS-92] Structural Techniques and Performance Bounds of Stochastic Petri Net Models. 609:352-391.
.
1992.
[RP-92-31] A polynomial-time algorithm to decide liveness of bounded free choice nets. Theoretical Computer Science. :185-205.
.
1992.
[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.
[CCS-TAC-91] Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control. 36:1368-1382.
.
1991.
[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-91-26] On periodic schedules for deterministically timed Petri nets systems. :210-215.
.
1991.
[RP-91-18] On the Analysis and Synthesis of Free Choice Systems. 483:243-286.
.
1991.
[263] Improving Throughput Upper Bounds for Net Based Models. IMACS MCTS’91 International Symposium on Modeling and Control of Technological Systems. 1:573-582.
.
1991.
[IPMaMuSi87] Modeling, Validation and Software Implementation of Production Systems Using High Level Petri Nets. High-Level Petri Nets. Theory and Applications. :618-623.
.
1991.
[ICEsSi91b] Top-Down Synthesis of Live and Bounded Free Choice Nets. Advances in Petri Nets 91. 524:118-139.
.
1991.
[ICEsSi90a] Circuits, Handles, Bridges and Nets. Advances in Petri Nets 90. 483:210-242.
.
1991.
[ICEsSi90b] On the Analysis and Synthesis of Free Choice Systems. Advances in Petri Nets 90. 483:243-286.
.
1991.
[672] Improving the Linearly Based Characterization of P/T Nets. Advances in Petri Nets 1990. :113-145.
.
1991.
[673] Convex Geometry and Semiflows in P/T Nets. A Comparative Study of Algorithms for Computation of Minimal P-Semiflows. Advances in Petri Nets 1990. :79-112.
.
1991.
[RP-91-29] Circuits, handles, bridges and nets. 483:210-242.
.
1991.
[RP-91-30] Top-down synthesis of live and bounded free choice nets. 524:118-139.
.
1991.
.
1991.
.
1991.
[RP-90-12] A Rede de Petri: Una Ferramenta para la Automa{\c c}ao Fabril. :181-200.
.
1990.
[RP-90-02] Top-down synthesis of live & bounded Free Choice Nets. :63-83.
.
1990.
.
1990.
[271] On liveness analysis through linear algebraic techniques. Proceedings of Design Methods Based on Nets (DEMON). Esprit Basic Research Action 3148. W.G. 3: Algebra and Proof Methods. Deliverables Covering the Period June 1989 to June 1990.
.
1990.
[1358] Improving the linearly based characterization of P/T nets. Proceedings of Design Methods Based on Nets (DEMON). Esprit Basic Research Action 3148. W.G. 3: Algebra and Proof Methods. Deliverables Covering the Period June 1989 to June 1990.
.
1990.
[1359] Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal p-semiflows. Proceedings of Design Methods Based on Nets (DEMON). Esprit Basic Research Action 3148. W.G. 3: Algebra and Proof Methods. Deliverables Covering the Period June 1989 to June 1990.
.
1990.