Publications
Filters: First Letter Of Title is C [Clear All Filters]
.
1994.
.
2009.
[1390] Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms. Eurasip Journal on Advances in Signal Processing. :17.
.
2007.
[1398] Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms. Eurasip Journal on Advances in Signal Processing. 2007:17.
.
2007.
[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.
[1441] CiE: Programs, Proofs, Processes (Special Issue). Theory of Computing Systems. 51(3)
.
2012.
[1074] A Colored Petri Net Model of VHDL. Formal Methods in System Design. 7(1/2):101-123.
.
1995.
[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.
[EzGP-03] COMPAS: un compilador para un lenguaje imperativo con aserciones embebidas. :47-51.
.
2003.
[1530] Complexity Analysis of Continuous Petri Nets. Fundamenta informaticae. Fundamenta Informaticae. 137:1-28.
.
2015.
[1426] Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports. 2(1)
.
2012.
[BC09] Computation of Performance Bounds for Real-time systems using Time Petri Nets. IEEE Transactions on Industrial Informatics. 5(2):168-180.
.
2009.
[1370] Computational framework for behavioural modelling of neural subsystems. Neurocomputing. 72(7-9):1667.
.
2009.
[1288] Continuous Petri Nets: Expressive Power and Decidability Issues. International Journal of Foundations of Computer Science. 21(2):235-256.
.
2010.
[1497] A Control Method for Distributed Continuous Mono-T-Semiflow Petri nets. International Journal of Control. 87(2)
.
2014.
[1498] Controllability of Timed Continuous Petri Nets with uncontrollable transitions. International Journal of Control. Posted online: 01 Oct 2013
.
2013.
[LutMayCVKL] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
.
1996.
[1293] Curves that must be retraced. Information and Computation. 209:992--1006.
.
2011.
[1255] A Control Method for Timed Distributed Continuous Petri nets. ACC'10: Proceedings of the 2010 conference on American Control Conference.
.
2010.
[BaHeMa92] Characterizations of logarithmic advice complexity classes. :315-321.
.
1992.
[1332] Checking Redundancies in Supervisory Control. A Complexity Result. 15th Triennial World Congress of the International Federation of Automatic Control (IFAC).
.
2002.
[RP-89-06] Circuits, handles, bridges and nets. :134-153.
.
1989.
[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.
[1508] Cloud-based Assistive Technology Services. Proceedings of the 3rd Workshop on Software Services: Semantic-based Software Services (WoSS) at the Federated Conference on Computer Science and Information Systems (FedCSIS).
.
2011.