Publications

Export 25 results:
Sort by: [ Author (Desc)] Title Type Year
Filters: First Letter Of Last Name is H  [Clear All Filters]
A B C D E F G [H] I J K L M N O P Q R S T U V W X Y Z   [Show ALL]
M
[1425] Mayordomo, E, Ferreira F, Hyland M, L\"owe B.  2012.  Special Issue: Computability in Europe 2010. Annals of Pure and Applied Logic. 163(6)
H
[1406] Holanda, HJA, Merseguer J, Cordeiro G, Serra AB.  2010.  Performance Evaluation of Web Services Orchestrated with WS-BPEL4People. International Journal of Computer Networks & Communications. 2(6):18.
application/pdf icon
J4.pdf
[HiLuMaSDNC] Hitchcock, JM, Lutz JH, Mayordomo E.  2004.  Scaled dimension and non uniform complexity. Journal of Computer and System Sciences. 69:97-122.
0 icon
sdnc.ps
[HiLuMaSDNCb] Hitchcock, JM, Lutz JH, Mayordomo E.  2003.  Scaled dimension and non uniform complexity. 2719:278-290.
[HiLuMa05] Hitchcock, JM, Lutz JH, Mayordomo E.  2005.  The fractal geometry of complexity classes. SIGACT News. 36:24-38.
0 icon
fgcc.pdf
A
[AtHiLuMa06] Athreya, KB, Hitchcock JM, Lutz JH, Mayordomo E.  2007.  Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. 37:671-705.
0 icon
esdaicc.pdf
[ESDAICC] Athreya, KB, Hitchcock JM, Lutz JH, Mayordomo E.  2004.  Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
H
[HiLoMa04] Hitchcock, JM, López-Valdés M, Mayordomo E.  2004.  Scaled dimension and the Kolmogorov complexity of Turing-hard sets. 3153:476-487.
[sdkcthsR] Hitchcock, JM, López-Valdés M, Mayordomo E.  2008.  Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. Theory of Computing Systems. 43:471-497.
[IPHRRS01] Hillston, J, Recalde L, Ribaudo M, Silva M.  2001.  A Comparison of the Expressiveness of SPA and Bounded SPN models. :197-206.
0 icon
01_HRRS_PNPM.ps
[HerMay94] Hermo, M, Mayordomo E.  1994.  A note on polynomial size circuits with low resource bounded Kolmogorov complexity. Mathematical Systems Theory. 27:247-356.
0 icon
94_HM_MST.ps
B
[BaHeMa92] Balcázar, JL, Hermo M, Mayordomo E.  1992.  Characterizations of logarithmic advice complexity classes. :315-321.
0 icon
92_BHM_IFIP.ps
H
[1284] Heiner, M, Mahulea C, Silva M.  2010.  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.
V
[ICSilv93b] Vernadat, F, Dicesare F, Harhalakis G, Proth JM, Silva M.  1993.  Practice of Petri-nets in manufacturing.
H
[IPHaReSi06] Haddad, S, Recalde L, Silva M.  2006.  On the Computational Power of Timed Differentiable Petri Nets. LNCS. 4202:230-244.
0 icon
TRHaReSi06.pdf
R
[IPReHaSi07] Recalde, L, Haddad S, Silva M.  2007.  Continuous Petri Nets: Expressive Power and Decidability Issues. LNCS. 4762:362-377.
E
[RP-93-21] Ezpeleta, J, Haddad S.  1993.  A distributed algorithm for ressource management. :15-26.
[RP-93-38] Ezpeleta, J, Haddad S.  1993.  A distributed algorithm for resource management. :61-72.
M
[IPMoHaSeSi01] Moreaux, P, Haddad S, Sereno M, Silva M.  2001.  Structural Characterisation and Qualitative Properties of Product Form Stochastic Petri Nets.
0 icon
silva.pdf
[ARMoHaSeSi05] Moreaux, P, Haddad S, Sereno M, Silva M.  2005.  Product-form and stochastic Petri nets: a structural approach. Performance Evaluation. 59:313-336.
0 icon
science.pdf
R
[1288] Recalde, L, Haddad S, Silva M.  2010.  Continuous Petri Nets: Expressive Power and Decidability Issues. International Journal of Foundations of Computer Science. 21(2):235-256.
C
[1334] Colom, JM, Teruel E, Silva M, Haddad S.  2002.  Structural Methods. Petri Nets for Systems Engineering. A Guide to Modeling, Verification, and Applications. :277-316.
[1338] Colom, JM, Haddad S, Silva M, Teruel E.  1998.  Structural Methods. Systems Engineering: A Petri Net Based Approach to Modelling, Verification and Implementation, HCM-MATCH Advanced Schools. :271-315.
[1339] Colom, JM, Haddad S.  1998.  Introduction to Verification. Systems Engineering: A Petri Net Based Approach to Modelling, Verification and Implementation, HCM-MATCH Advanced Schools. :171-190.
F
[1462] Fraca, E, Haddad S.  2013.  Complexity Analysis of Continuous Petri Nets. 34th International Conference on Application and Theory of Petri Nets and Concurrency (ICATPN).
application/pdf icon
ICATPN-2013.pdf