Publications
Filters: First Letter Of Title is C [Clear All Filters]
.
1981.
[RP-89-06] Circuits, handles, bridges and nets. :134-153.
.
1989.
[1006] Convex Geometry and Semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows. 10th International Conference on Application and Theory of Petri Nets. :74-95.
.
1989.
[1359] Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal p-semiflows. 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.
.
1990.
[RP-91-29] Circuits, handles, bridges and nets. 483:210-242.
.
1991.
.
1991.
[ICEsSi90a] Circuits, Handles, Bridges and Nets. Advances in Petri Nets 90. 483:210-242.
.
1991.
[673] 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.
.
1991.
[BaHeMa92] Characterizations of logarithmic advice complexity classes. :315-321.
.
1992.
[LutMayCVKLb] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
.
1994.
.
1994.
[1074] A Colored Petri Net Model of VHDL. Formal Methods in System Design. 7(1/2):101-123.
.
1995.
[RP-95-10] Corrección de programas y Redes de Petri de alto nivel. :184-193.
.
1995.
[RP-95-12] Corrección de programas y redes de Petri de alto nivel. :155-164.
.
1995.
[LutMayCVKL] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
.
1996.
[AmMaZh96] A Comparison of Weak Completeness Notions. :171-178.
.
1996.
[204] 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.
.
1997.
[1083] A Class of Well Structured Petri Nets for Flexible Manufacturing Systems. Application and Theory of Petri Nets 1998. :64-83.
.
1998.
[IPTeFrDe99] Clarifying the Priority Specification of GSPN Detached Priorities. :114-123.
.
1999.
[IPBaReChSi00] Closed Loop live Petri Net Supervisors for Generalized Mutual Exclusion Constraints. :169-180.
.
2000.
[1092] Comments on "Deadlock Avoidance Policy for Petri-Net Modeling of Flexible Manufacturing Systems with Shared Resources". IEEE Transactions on Automatic Control. 45(9):1760-1762.
.
2000.
[IPHRRS01] A Comparison of the Expressiveness of SPA and Bounded SPN models. :197-206.
.
2001.
[1332] Checking Redundancies in Supervisory Control. A Complexity Result. 15th Triennial World Congress of the International Federation of Automatic Control (IFAC).
.
2002.
[MBCD-wodes02] A Compositional Semantics for UML State Machines Aimed at Performance Evaluation. :295-302.
.
2002.
[EzGP-03] COMPAS: un compilador para un lenguaje imperativo con aserciones embebidas. :47-51.
.
2003.