Publications
] Filters: First Letter Of Last Name is C [Clear All Filters]
[Campos-thesis-90] .
1990. Performance Bounds for Synchronized Queueing Networks.
[RP-91-34] .
1991. A new technique for finding a generating family of siphons, traps and st-components. Application to colored Petri Nets. :145-164.
[ICCoMa90] .
1991. Linear Invariants in Commutative High Level Nets. :146-165.
[672] .
1991. Improving the Linearly Based Characterization of P/T Nets. Advances in Petri Nets 1990. :113-145.
[673] .
1991. 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.
[263] .
1991. Improving Throughput Upper Bounds for Net Based Models. IMACS MCTS’91 International Symposium on Modeling and Control of Technological Systems. 1:573-582.
[262] .
1991. A Reachable Throughput Upper Bound for Live and Safe Free Choice Nets. 12th International Conference on Application and Theory of Petri Nets. :237-256.
[1027] .
1991. Petri net Based Modelling, Analysis and Simulation of Pipelined Architectures. P.D. COM'91 IMACS-IFAC International Symposium on Parallel and Distributed Computing in Engineering Systems. :37-38.
[1029] .
1991. Petri Net Based Analysis of VHDL Programs. Second European Conference on VHDL Methods (EURO-VHDL'91). :1-10.
[1030] .
1991. Petri Net Based Analysis of VHDL Programs. Segunda Reunión sobre Paralelismo. :115-127.
[CCS-TAC-91] .
1991. Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control. 36:1368-1382.
[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.
[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.
[C-DEMON-91] .
1991. Performance Analysis of Live and Bounded Free Choice Systems. Studien. 198:38-48.
[CS-LNCS-92] .
1992. Structural Techniques and Performance Bounds of Stochastic Petri Net Models. 609:352-391.
[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.
[1050] .
1992. Petri net based Modelling, Analysis and Simulation of Pipelined Architectures. Parallel and Distributed Computing in Engineering Systems. :35-40.
[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.
[CPSM-RMUCM-93] .
1993. Boundedness on Stochastic Petri Nets. Revista Matematica de la Universidad Complutense de Madrid. 6:123-136.
[State-of-the-art-93] .
1993. The Timed Coloured Petri Net Formalism Position Paper. 14:3-60.
[RP-93-38] .
1993. A distributed algorithm for resource management. :61-72.
