Publications
] Filters: First Letter Of Title is C [Clear All Filters]
[1251] .
2009. Constrained invariant motions for networked multi-agent systems. ACC'09: Proceedings of the 2009 conference on American Control Conference.
[1301] .
2009. Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
[1370] .
2009. Computational framework for behavioural modelling of neural subsystems. Neurocomputing. 72(7-9):1667.
[1390] .
2007. Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms. Eurasip Journal on Advances in Signal Processing. :17.
[1398] .
2007. Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms. Eurasip Journal on Advances in Signal Processing. 2007:17.
[IPReHaSi07] .
2007. Continuous Petri Nets: Expressive Power and Decidability Issues. LNCS. 4762:362-377.
[EzGP-03] .
2003. COMPAS: un compilador para un lenguaje imperativo con aserciones embebidas. :47-51.
[MBCD-wodes02] .
2002. A Compositional Semantics for UML State Machines Aimed at Performance Evaluation. :295-302.
[1332] .
2002. Checking Redundancies in Supervisory Control. A Complexity Result. 15th Triennial World Congress of the International Federation of Automatic Control (IFAC).
[IPHRRS01] .
2001. A Comparison of the Expressiveness of SPA and Bounded SPN models. :197-206.
[1092] .
2000. 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.
[IPBaReChSi00] .
2000. Closed Loop live Petri Net Supervisors for Generalized Mutual Exclusion Constraints. :169-180.
[IPTeFrDe99] .
1999. Clarifying the Priority Specification of GSPN Detached Priorities. :114-123.
[1083] .
1998. A Class of Well Structured Petri Nets for Flexible Manufacturing Systems. Application and Theory of Petri Nets 1998. :64-83.
[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.
[AmMaZh96] .
1996. A Comparison of Weak Completeness Notions. :171-178.
[LutMayCVKL] .
1996. Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
[RP-95-12] .
1995. Corrección de programas y redes de Petri de alto nivel. :155-164.
[RP-95-10] .
1995. Corrección de programas y Redes de Petri de alto nivel. :184-193.
[1074] .
1995. A Colored Petri Net Model of VHDL. Formal Methods in System Design. 7(1/2):101-123.
[LutMayCVKLb] .
1994. Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
[MayCSRBM] .
1994. Contributions to the study of resource bounded measure.
[BaHeMa92] .
1992. Characterizations of logarithmic advice complexity classes. :315-321.
[ICEsSi90a] .
1991. Circuits, Handles, Bridges and Nets. Advances in Petri Nets 90. 483:210-242.
