Publications
Filters: First Letter Of Last Name is L [Clear All Filters]
[1311] Lender processes competing for shared resources: Beyond the $S^4PR$ paradigm. 2006 International Conference on Systems, Man and Cybernetics (SMC'06). 4:3052--3059.
.
2006.
[LutMayMSDHL] Measure stochasticity and the density of hard languages. SIAM Journal on Computing. 23:762-779.
.
1994.
[LutMayMSDHLb] Measure stochasticity and the density of hard languages. 665:38-47.
.
1993.
[1378] On the deadlock analysis of multithreaded control software. 16th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'2011).
.
2011.
[LGMC-02b] On the Use of Formal Models in Software Performance Evaluation. :367-387.
.
2002.
[LGMC-02c] Performance Engineering Based on UML and SPNs: A Software Performance Tool. :405-409.
.
2002.
[1323] A Petri Net Perspective on the Resource Allocation Problem in Software Engineering. Transactions on Petri Nets and Other Models of Concurrency. V
.
2012.
[GuLuMa06] Points on computable curves. :469–474.
.
2006.
.
2010.
[BML-EDCC-10] Reliability and availability requirements engineering within the Unified Process using a Dependability Analysis and Modeling profile. Eighth European Dependable Computing Conference (EDCC'10). :95-104.
.
2010.
[1313] The Resource Allocation Problem In Software Applications: A Petri Net Perspective. International Workshop on Petri Nets and Software Engineering PNSE'10,. :7-21.
.
2010.
[1312] Resource Allocation Systems: Some complexity results on the $S^4PR$ class. Formal Techniques for Networked and Distributed Systems – FORTE 2006. 4229:323-339.
.
2006.
[1308] Resource-bounded Dimension in Computational Learning Theory. arXiv.
.
2010.
[HiLuMaSDNC] Scaled dimension and non uniform complexity. Journal of Computer and System Sciences. 69:97-122.
.
2004.
[HiLuMaSDNCb] Scaled dimension and non uniform complexity. 2719:278-290.
.
2003.
[HiLoMa04] Scaled dimension and the Kolmogorov complexity of Turing-hard sets. 3153:476-487.
.
2004.
[sdkcthsR] Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. Theory of Computing Systems. 43:471-497.
.
2008.
.
2006.
[1532] A Semantic Approach for Designing Assistive Software Recommender Systems. Journal of Systems and Software. 104
.
2015.
.
1991.
[LG03RR1] Sketching architectural concerns on distributed discrete event simulation based on Petri Nets.
.
2003.
[1425] Special Issue: Computability in Europe 2010. Annals of Pure and Applied Logic. 163(6)
.
2012.
[1482] Structural deadlock prevention policies for Flexible Manufacturing Systems: A Petri net outlook. Formal Methods in Manufacturing. Abstract
.
2014.
[1433] Structural methods for the control of Discrete Event Dynamic Systems – The case of the Resource Allocation Problem. Control of Discrete-Event Systems. Automata and Petri net Perspectives. 433:257-278. Abstract
.
2013.
[BLV07] Tail estimates and a random embedding of l^p_n to l_r^{(1+ε)n}, 0<r<p<2.. Publ. Math. Debrecen. 70
.
2007.