Publications
] Filters: Author is M. Silva [Clear All Filters]
[CSS-Melbourne-91] .
1991. Throughput Lower Bounds for Markovian Petri Nets Transformation Techniques. :322-331.
[RP-91-26] .
1991. On periodic schedules for deterministically timed Petri nets systems. :210-215.
[CCS-TSE-91] .
1991. Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector. IEEE Transactions on Software Engineering. 17:117-125.
[CS-LNCS-92] .
1992. Structural Techniques and Performance Bounds of Stochastic Petri Net Models. 609:352-391.
[RP-92-31] .
1992. A polynomial-time algorithm to decide liveness of bounded free choice nets. Theoretical Computer Science. :185-205.
[259] .
1992. Improving Throughput Upper Bounds for Net Based Models. Robotics and Flexible Manufacturing Systems. :281-294.
[269] .
1992. Linear Algebraic Techniques for the Analysis of Petri Nets. Recent Advances in Mathematical Theory of Systems, Control, Networks, and Signal Processing II. :35-42.
[337] .
1992. On Weighted T-Systems. Application and Theory of Petri Nets 1992. :348-367.
[258] .
1992. Properties and Performance Bounds for Timed Marked Graphs. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications. 39(5):386-401.
[1356] .
1992. Structure Theory of Non Free Choice Systems. Final Report of the ESPRIT Basis Research Action DEMON (Design Methods based on Nets) Covering the Period 18 June 1989 to 18 March 1992. :130-134.
[RP-92-26] .
1992. Scheduling en celdas autónomas de ensamblaje basado en un algoritmo de tiempo mínimo en RdP. :55-60.
[RP-92-05] .
1992. Petri nets in a knowledge representation schema for the coordination of plant elements. :271-276.
[RP-92-06] .
1992. Response time approximation for the performance analysis of manufacturing systems modeled with stochastic marked graphs. :1000-1005.
[RP-92-10] .
1992. An aproximation method for the performance analysis of manufacturing systems based on GSPNs. :46-55.
[RP-92-12] .
1992. B-Fairness and Structural B-Fairness in Petri Net Models of Concurrent Systems. Journal of Computer and System Sciences. 44:447-477.
[RP-92-13] .
1992. Approximate throughput computation of stochastic marked graphs. Journal of Parallel and distributed computing. 15:282-295.
[State-of-the-art-93] .
1993. The Timed Coloured Petri Net Formalism Position Paper. 14:3-60.
[RP-93-56] .
1993. A new technique for finding a generating family of siphons, traps and st-components. 674:126-147.
[RP-93-57] .
1993. Introducing Petri Nets.
[ICTeSi93] .
1993. Liveness and Home States in Equal Conflict Systems. Application and Theory of Petri Nets 1993. 691:415-432.
[200] .
1993. Modelling and Analysis of Deteministic Concurrent Systems with Bulk Services and Arrivals. Decentralized and Distributed Systems. :213-224.
[ICSilv93b] .
1993. Practice of Petri-nets in manufacturing.
[ICSilv93a] .
1993. Interleaving Functional and Performance Structural Analysis of Net Models. Application and Theory of Petri Nets 1993. 691:17-23.
[ICEzCoSi93] .
1993. A New Technique for Finding a Generating Family of Siphons, Traps and ST-Components. Application to Coloured Petri Nets. Advances in Petri Nets. 674:126-147.
[1363] .
1993. On Weighted T-Systems. III Jornadas de Concurrencia. :293-312.
