Publications
] Filters: First Letter Of Last Name is C [Clear All Filters]
[GBC-IROS-04] .
2004. Solving the Mobile Robot Localization Problem Using String Matching Algorithms. :2475-2480.
[915] .
1999. A solution to the problem of deadlocks in concurrent systems using Petri nets and integer linear programming. 11th European Simulation Symposium (ESS’99). Simulation in Industry. :542-546.
[MC-LNCS-04] .
2004. Software Performance Modelling Using UML and Petri Nets. Lecture Notes in Computer Science. 2965:265-289.
[1407] .
2012. Sliced Model Checking for Phylogenetic Analysis. 6th International Conference on Practical Applications of Computational Biology & Bioinformatics (PACBB 2012).
[CelayaAHPCC06] .
2006. Scalable Architecture for Allocation of Idle CPUs in a P2P Network. :240-249.
[1247] .
2006. Scalable Architecture for Allocation of Idle CPUs in a P2P Network. 2nd International Conference on High Performance Computing and Communications.
[C-MATCH23-98] .
1998. Response Time Approximation for Stochastic Marked Graphs. :797-817.
[1312] .
2006. Resource Allocation Systems: Some complexity results on the $S^4PR$ class. Formal Techniques for Networked and Distributed Systems – FORTE 2006. 4229:323-339.
[1313] .
2010. The Resource Allocation Problem In Software Applications: A Petri Net Perspective. International Workshop on Petri Nets and Software Engineering PNSE'10,. :7-21.
[1330] .
2003. The Resource Allocation Problem in Flexible Manufacturing Systems. Application and Theory of Petri Nets 2003. :23-35.
[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.
[CCS-Kyoto-89] .
1989. Properties and Steady State Performance Bounds for Petri Nets with Unique Repetitive Firing Count Vector. :210-220.
[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.
[CCS-TAC-91] .
1991. Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control. 36:1368-1382.
[1335] .
2002. Properties. Petri Nets for Systems Engineering. A Guide to Modeling, Verification, and Applications. :53-77.
[1340] .
1998. Properties. Systems Engineering: A Petri Net Based Approach to Modelling, Verification and Implementation, HCM-MATCH Advanced Schools. :41-63.
[1324] .
2007. Proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE’07).
[ETFA09] .
2009. Proceedings of the 14th IEEE International Conference on Emerging Technologies and Factory Automation.
[1377] .
2011. "Predictive Maintenance Surveyor" Design Pattern for Machine Tools Control Software Applications. 16th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'2011).
[1321] .
2011. Predictive Maintenance Manager design pattern for component based machine tools. IEEE 9th International Conference on Industrial Informatics (INDIN’2011).
[C-Zaragoza-99] .
1999. PNPM99-PAPM99-NSMC99 Tutorial: Properties and Bounds on P/T Nets.
[BC-StMalo-97] .
1997. PNPM97 Tutorial Approximate Methods Based on Net Driven Decompositions.
[1322] .
2011. Phylogenetic Analysis Using an SMV Tool. 5th International Conference on Practical Applications of Computational Biology & Bioinformatics (PACBB 2011). :167-174.
