Publications
] Filters: Author is J.M. Colom [Clear All Filters]
[199] .
1993. Linear Analysis of Deadlock-Freeness of Petri Net Models. Second European Control Conference, ECC'93. 2:513-518.
[200] .
1993. Modelling and Analysis of Deteministic Concurrent Systems with Bulk Services and Arrivals. Decentralized and Distributed Systems. :213-224.
[204] .
1997. Choice-free Petri Nets: A Model for Deterministic Concurrent Systems with Bulk Services and Arrivals. IEEE Transactions on Systems, Man and Cybernetics. Part A: Systems and Humans. 27(1):73-83.
[238] .
1995. Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. Quantitative Methods in Parallel Systems. :161-174.
[239] .
1995. Approximate Throughput Computation of Stochastic Marked Graphs. Quantitative Methods in Parallel Systems. :175-188.
[243] .
1995. Functional and Performance Analysis of Cooperating Sequential Processes. Quantitative Methods in Parallel Systems. :52-65.
[245] .
1994. Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. Performance Evaluation of parallel and distributed systems. Solution Methods. :197-213.
[246] .
1994. A General Iterative Technique for Approximate Throughput Computation of Stochastic Marked Graphs. Performance Evaluation of parallel and distributed systems. Solution Methods. :265-283.
[247] .
1994. Approximate Throughput Computation of Stochastic Marked Graphs. IEEE Transactions on Software Engineering. 20(7):526-535.
[248] .
1994. Functional and Performance Analysis of Cooperating Sequential Processes. Performance Evaluation of parallel and distributed systems. Solution Methods. :234-251.
[249] .
1994. Functional and Performance Analysis of Cooperating Sequential Processes. 11th International Conference on Analysis and Optimization Systems. Discrete Event Systems. :169-175.
[250] .
1993. Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. IEEE 5th International Workshop on Petri Nets and Performance Models (PNPM'93). :128-137.
[251] .
1993. Operational Analysis of Timed Petri Nets. 16th International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance'93).
[252] .
1993. A General Iterative Technique for Approximate Throughput Computation of Stochastic Marked Graphs. IEEE 5th International Workshop on Petri Nets and Performance Models (PNPM'93). :138-147.
[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.
[259] .
1992. Improving Throughput Upper Bounds for Net Based Models. Robotics and Flexible Manufacturing Systems. :281-294.
[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.
[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.
[271] .
1990. 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.
[276] .
1990. Performance Evaluation of Repetitive Automated Manufacturing Systems. IEEE Rensselaer's Second International Conference on Computer Integrated Manufacturing. :74-81.
[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.
[337] .
1992. On Weighted T-Systems. Application and Theory of Petri Nets 1992. :348-367.
[365] .
1988. On the Computation of Structural Synchronic Invariants in P/T Nets. Advances in Petri Nets 1988. :386-417.
[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.
