Publications
] Filters: First Letter Of Last Name is C [Clear All Filters]
[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.
[ICCoMa90] .
1991. Linear Invariants in Commutative High Level Nets. :146-165.
[RP-89-05] .
1989. Linear invariants in commutative high level nets. :96-114.
[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.
[RP-93-56] .
1993. A new technique for finding a generating family of siphons, traps and st-components. 674:126-147.
[BBCM-09] .
2009. UML Profiles for Non-functional Properties at Work: Analyzing Reliability, Availability and Performance. 2nd International Workshop on Non-functional System Properties in Domain Specific Modeling Languages (NFPinDSML2009). 553
[IPCoGiSeJu03] .
2003. Observers for nondeterministic l-free labeled Petri nets.
[1406] .
2010. Performance Evaluation of Web Services Orchestrated with WS-BPEL4People. International Journal of Computer Networks & Communications. 2(6):18.
[1305] .
2009. Special Issue: Computation and Logic in the Real World. Theory of Computing Systems. 45(4)
[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.
