Publications
Filters: First Letter Of Last Name is H [Clear All Filters]
[1530] Complexity Analysis of Continuous Petri Nets. Fundamenta informaticae. Fundamenta Informaticae. 137:1-28.
.
2015.
[1462] Complexity Analysis of Continuous Petri Nets. 34th International Conference on Application and Theory of Petri Nets and Concurrency (ICATPN).
.
2013.
[1425] Special Issue: Computability in Europe 2010. Annals of Pure and Applied Logic. 163(6)
.
2012.
[1406] Performance Evaluation of Web Services Orchestrated with WS-BPEL4People. International Journal of Computer Networks & Communications. 2(6):18.
.
2010.
[1284] On the Importance of the Deadlock Trap Property for Monotonic Liveness. Int. Workshop on Biological Processes & Petri Nets (BioPPN), A satellite event of Petri Nets 2010.
.
2010.
[1288] Continuous Petri Nets: Expressive Power and Decidability Issues. International Journal of Foundations of Computer Science. 21(2):235-256.
.
2010.
[sdkcthsR] Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. Theory of Computing Systems. 43:471-497.
.
2008.
.
2007.
[AtHiLuMa06] Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. 37:671-705.
.
2007.
[IPReHaSi07] Continuous Petri Nets: Expressive Power and Decidability Issues. LNCS. 4762:362-377.
.
2007.
[IPHaReSi06] On the Computational Power of Timed Differentiable Petri Nets. LNCS. 4202:230-244.
.
2006.
[1337] Using Linear Programming and the Petri Net Structure for Deadlock Prevention in Sequential Resource Allocation Systems. Actas de las XIII Jornadas de Concurrencia y Sistemas Distribuidos (JCSD’2005). :65-77.
.
2005.
[HiLuMa05] The fractal geometry of complexity classes. SIGACT News. 36:24-38.
.
2005.
[ARMoHaSeSi05] Product-form and stochastic Petri nets: a structural approach. Performance Evaluation. 59:313-336.
.
2005.
[HiLuMaSDNC] Scaled dimension and non uniform complexity. Journal of Computer and System Sciences. 69:97-122.
.
2004.
[ESDAICC] Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
.
2004.
[HiLoMa04] Scaled dimension and the Kolmogorov complexity of Turing-hard sets. 3153:476-487.
.
2004.
[HiLuMaSDNCb] Scaled dimension and non uniform complexity. 2719:278-290.
.
2003.
[1334] Structural Methods. Petri Nets for Systems Engineering. A Guide to Modeling, Verification, and Applications. :277-316.
.
2002.
[IPHRRS01] A Comparison of the Expressiveness of SPA and Bounded SPN models. :197-206.
.
2001.
.
2001.
[915] 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.
.
1999.
[1338] Structural Methods. Systems Engineering: A Petri Net Based Approach to Modelling, Verification and Implementation, HCM-MATCH Advanced Schools. :271-315.
.
1998.
[1339] Introduction to Verification. Systems Engineering: A Petri Net Based Approach to Modelling, Verification and Implementation, HCM-MATCH Advanced Schools. :171-190.
.
1998.
[HerMay94] A note on polynomial size circuits with low resource bounded Kolmogorov complexity. Mathematical Systems Theory. 27:247-356.
.
1994.