Publications
] Filters: First Letter Of Title is C [Clear All Filters]
[MayCSRBM] .
1994. Contributions to the study of resource bounded measure.
[1234] .
2009. Continuous and Hybrid Petri Nets: The GISED perspective.
[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.
[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.
[1441] .
2012. CiE: Programs, Proofs, Processes (Special Issue). Theory of Computing Systems. 51(3)
[1074] .
1995. A Colored Petri Net Model of VHDL. Formal Methods in System Design. 7(1/2):101-123.
[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.
[EzGP-03] .
2003. COMPAS: un compilador para un lenguaje imperativo con aserciones embebidas. :47-51.
[1530] .
2015. Complexity Analysis of Continuous Petri Nets. Fundamenta informaticae. Fundamenta Informaticae. 137:1-28.
[1426] .
2012. Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports. 2(1)
[BC09] .
2009. Computation of Performance Bounds for Real-time systems using Time Petri Nets. IEEE Transactions on Industrial Informatics. 5(2):168-180.
[1370] .
2009. Computational framework for behavioural modelling of neural subsystems. Neurocomputing. 72(7-9):1667.
[1288] .
2010. Continuous Petri Nets: Expressive Power and Decidability Issues. International Journal of Foundations of Computer Science. 21(2):235-256.
[1497] .
2014. A Control Method for Distributed Continuous Mono-T-Semiflow Petri nets. International Journal of Control. 87(2)
[1498] .
2013. Controllability of Timed Continuous Petri Nets with uncontrollable transitions. International Journal of Control. Posted online: 01 Oct 2013
[LutMayCVKL] .
1996. Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
[1293] .
2011. Curves that must be retraced. Information and Computation. 209:992--1006.
[1255] .
2010. A Control Method for Timed Distributed Continuous Petri nets. ACC'10: Proceedings of the 2010 conference on American Control Conference.
[BaHeMa92] .
1992. Characterizations of logarithmic advice complexity classes. :315-321.
[1332] .
2002. Checking Redundancies in Supervisory Control. A Complexity Result. 15th Triennial World Congress of the International Federation of Automatic Control (IFAC).
[RP-89-06] .
1989. Circuits, handles, bridges and nets. :134-153.
[IPTeFrDe99] .
1999. Clarifying the Priority Specification of GSPN Detached Priorities. :114-123.
[IPBaReChSi00] .
2000. Closed Loop live Petri Net Supervisors for Generalized Mutual Exclusion Constraints. :169-180.
[1508] .
2011. 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).
