Publications
] Filters: First Letter Of Last Name is A [Clear All Filters]
[RP-85-03] .
1985. Generalized Inverses and the Calculation of Symbolic Invariants for Colored Petri Nets. Technique et Science Informatique (TSI). 4:113-126.
[RP-86-03] .
1986. Petri nets for the specification of FMSs. :389-406.
[ICTeSi93] .
1993. Liveness and Home States in Equal Conflict Systems. Application and Theory of Petri Nets 1993. 691:415-432.
[ICSilv93a] .
1993. Interleaving Functional and Performance Structural Analysis of Net Models. Application and Theory of Petri Nets 1993. 691:17-23.
[250] .
1993. Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. IEEE 5th International Workshop on Petri Nets and Performance Models (PNPM'93). :128-137.
[RP-93-10] .
1993. Interleaving functional and performance structural analysis of Net models. 691:17-23.
[245] .
1994. Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. Performance Evaluation of parallel and distributed systems. Solution Methods. :197-213.
[238] .
1995. Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. Quantitative Methods in Parallel Systems. :161-174.
[AmMaZh96] .
1996. A Comparison of Weak Completeness Notions. :171-178.
[AMWZ96] .
1996. Resource bounded balanced genericity stochasticity and weak randomness. 1046:63-74.
[AmbMay97] .
1997. Resource Bounded Measure and Randomness. :1-47.
[1326] .
2003. Petri Net Approaches for Modelling and Validation. Lincom Studies in Computer Science. 1
[1330] .
2003. The Resource Allocation Problem in Flexible Manufacturing Systems. Application and Theory of Petri Nets 2003. :23-35.
[1333] .
2003. Structural Analysis of Signal Transition Graphs based on Linear Algebraic Techniques. Petri Net Approaches for Modelling and Validation. :35-51.
[ESDAICC] .
2004. Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
[IPHaReSi06] .
2006. On the Computational Power of Timed Differentiable Petri Nets. LNCS. 4202:230-244.
[CelayaAHPCC06] .
2006. Scalable Architecture for Allocation of Idle CPUs in a P2P Network. :240-249.
[1246] .
2006. YA: Fast and Scalable Discovery of Idle CPUs in a P2P network. 7th IEEE/ACM International Conference on Grid Computing.
[1247] .
2006. Scalable Architecture for Allocation of Idle CPUs in a P2P Network. 2nd International Conference on High Performance Computing and Communications.
[CelayaAGRID06] .
2006. YA: Fast and Scalable Discovery of Idle CPUs in a P2P Network. :49-55.
[AtHiLuMa06] .
2007. Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. 37:671-705.
[1307] .
2007. Bounded Pushdown dimension vs Lempel Ziv information density. arXiv.
[AMMP08] .
2008. Pushdown compression. :39-48.
[1256] .
2009. Qualitative versus Quantitative Techniques in a Petri net settings. Buletinul Institutului Politehnic din Iasi. Tomul LV (LIX), Fasc. 4:35-46.
[1253] .
2009. An Efficient Heuristics for Minimum Time Control of Continuous Petri nets. 3rd IFAC Conference on Analysis and Design of Hybrid Systems (2009).
