Skip to Main Content
It looks like you're using Internet Explorer 11 or older. This website works best with modern browsers such as the latest versions of Chrome, Firefox, Safari, and Edge. If you continue with this browser, you may see unexpected results.

AUBG Faculty Bibliography: Guelev, Dimitar

Dimitar Guelev

Adjunct Associate Professor (MSc)

Office: BAC 319

Phone: +359 73 888 493

Bibliography

Journal Articles

Moszkowski, B., & Guelev, D. P. (2017). An application of temporal projection to interleaving concurrency. Formal Aspects of Computing, 29(4), 705–750.

Guelev, D. P. (2017). Refining strategic ability in alternating-time temporal logic. Information and Computation. Special Issue on Selected Papers from the 2nd Intl. Workshop on Strategic Reasoning (SR 2014), 254(2), 316–328. http://www.sciencedirect.com/science/article/pii/S0890540116300980

Moszkowski, B., Guelev, D. P., & Leucker, M. (2014). [Guest editor’s preface to special issue on interval temporal logics]. Annals of Mathematics and Artificial Intelligence, 71(1–3), 1–9.

Guelev, D. P., Dima, C., & Enea, C. (2011). An alternating-time temporal logic with knowledge, perfect recall and past: Axiomatisation and model-checking. Journal of Applied Non-Classical Logics, 21(1), 93–131.

Guelev, D. P. (2008). A syntactical proof of the canonical reactivity form for past linear temporal logic. Journal of Logic and Computation, 18(4), 615–623.

Zhang, N., Ryan, M., & Guelev, D. P. (2008). Synthesising verified access control systems through model checking. Journal of Computer Security, 16(1), 1-61. http://search.ebscohost.com/login.aspx?direct=true&db=edselc&AN=edselc.2-52.0-37249072460&site=eds-live

Guelev, D. P. (2007). Probabilistic interval temporal logic and duration calculus with infinite intervals: Complete proof systems. Logical Methods in Computer Science, 3(3), 44.

Guelev, D. P., Ryan, M. D., & Schobbens, P. Y. (2007). Model-checking the preservation of temporal properties upon feature integration. International Journal on Software Tools for Technology Transfer, 9(1), 53–62. https://link.springer.com/article/10.1007/s10009-006-0006-x

Guelev, D. P., Ryan, M., & Schobbens, P. Y. (2006). Synthesising features by games. Electronic Notes in Theoretical Computer Science, 145, 79–93.  http://www.sciencedirect.com/science/article/pii/S1571066105052515

Guelev, D. P., & Hung, V D. (2005). On the completeness and decidability of duration calculus with iteration. Theoretical Computer Science, 337, 278–304. http://www.sciencedirect.com/science/article/pii/S0304397505000587

Guelev, D. P. (2005). Sharpening the incompleteness of the duration calculus. Electronic Notes in Theoretical Computer Science, 139(1), 91–104. http://www.sciencedirect.com/science/article/pii/S1571066105051170

Guelev, D. P. (2004). A complete proof system for first order interval temporal logic with projection. Journal of Logic and Computation, 14(2), 215–249.

Guelev, D. P., & Hung, D. V. (2004). A relatively complete axiomatisation of projection onto state in the duration calculus. Journal of Applied Non-Classical Logics, 14(1-2), 149-180.

Guelev, D. P. (2004). Logical interpolation and projection onto state in the duration calculus. Journal of Applied Non-Classical Logics, 14(1–2), 181–208.

Guelev, D. P., & Hung, D. (2002). Prefix and projection onto state in duration calculus. In Electronic Notes in Theoretical Computer Science, 65(6), 101-119. https://doi.org/10.1016/S1571-0661(04)80472-9

Guelev, D. P. (2001). Interval-related interpolation in interval temporal logics. Logic Journal of the IGPL, 9(5), 677–685.

Guelev, D. P. (1999). A propositional dynamic logic with qualitative probabilities. Journal of Philosophical Logic, 28(6), 575-605.

Conference Proceedings

Guelev, D. P., & Moszkowski, B. (2015). An application of temporal projection to interleaving concurrency. In Proceedings of SETTA 2015 (pp. 153–167). Springer-Verlag.

Guelev, D. P., Wang, S., Zhan, N., & Zhou, C. (2014). Super-dense computation in verification of hybrid CSP processes. In Lecture Notes in Computer Science (8348): Conf: International symposium; 10th; Nanchang, China (pp. 13–22). Springer-Verlag.

Guelev, D. P. (2014). Refining and delegating strategic ability in ATL. In Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 146 (pp. 57–63). https://doaj.org/article/a1069f24072341c89baf5761ea4fefbc  

Guelev, D. P. (2013). Reducing validity in epistemic ATL to validity in epistemic CTL. In Proceedings of the 1st Intl. Workshop on Strategic Reasoning (SR 2013), EPTCS, vol. 112 (pp. 81–90). http://arxiv.org/abs/1303.0794

Guelev, D. P., & Dima, C. (2012). Epistemic ATL with perfect recall, past and strategy contexts. In Computational Logic in Multi-Agent Systems - 13th International Workshop, CLIMA XIII, Proceedings. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),7486 (pp. 77–93). Springer-Verlag.

Shuling, W., Naijun, Z., & Guelev, D. (2012). An assume/guarantee based compositional calculus for hybrid CSP. In Proceedings of TAMC 2012, LNCS 7287 (pp. 72–83). Springer-Verlag.

Guelev, D. P., & Dam, M. (2011). An epistemic predicate CTL* for finite control π-processes. In Proceedings of the 7th Workshop on Methods for Modalities (M4M’2011) and the 4th Workshop on Logical Aspects of Multi-Agent Systems (LAMAS’2011), Electronic Notes in Theoretical Computer Science, vol. 278 (pp. 229–243). http://www.sciencedirect.com/science/article/pii/S1571066111001460

Dima, C., Enea, C., & Guelev, D. P. (2010). Model-checking an alternating-time temporal logic with knowledge, imperfect information, perfect recall and communicating coalitions. In Electronic Proceedings in Theoretical Computer Science (EPTCS) vol. 25 (pp. 103–117). https://doaj.org/article/07138f152fd1468cb0080544a28457a1

Guelev, D. P., & Dima, C. (2008). Model-checking strategic ability and knowledge of the past of communicating coalitions. In [Proceeding of AAMAS workshop Declarative Agent Languages and Technologies (DALT)], 2008, LNAI 5397 (pp. 75-90). Springer. http://www.math.bas.bg/~gelevdp/pdf/dalt2008.pdf

Guelev, D. P., & Hung, V. D. (2010). Reasoning about QoS contracts in the probabilistic duration calculus. Electronic Notes in Theoretical Computer Science, 238(6), 41-62. http://www.sciencedirect.com/science/article/pii/S1571066110000575

Guelev, D. P., Ryan, M., & Schobbens, P. Y. (2006). Synthesising features by games. AVoCS’05. In Electronic Notes in Theoretical Computer Science, 145 (pp. 79-93). Warwick University, UK. http://www.math.bas.bg/~gelevdp/pdf/avocs2005.pdf

Zhang, N., Ryan, M., & Guelev, D. P. (2005). Evaluating access control policies through model-checking. In Proceedings of the 8th Information Security Conference (ISC’05, LNCS 3650) (pp. 446-460). Singapore: Springer.

Guelev, D. P., Ryan, M., & Schobbens, P. Y. (2004). Synthesising verified access control systems in XACML. In Proceedings of the 2nd ACM Workshop on Formal Methods in Security Engineering (FMSE 2004) (pp. 56–65). Washingtion, DC: ACM. http://dl.acm.org/citation.cfm?id=1029141&CFID=984886636&CFTOKEN=72595291

Guelev, D. P., Ryan, M., & Schobbens, P. Y. (2004). Model-checking access control policies. In Proceedings of the 7th Information Security Conference (ISC’04), Palo Alto, California, September 2004, LNCS 3225 (pp. 219–230). Springer.

Guelev, D. P., Rayan, M., & Schobbens, P. Y. (2003). Feature integration as substitution. In Feature Interactions in Telecommunications and Software Systems VII (pp. 275–294). Amsterdam: IOS Press.

Guelev, D. P. (2000). A complete fragment of the higher-order duration µ-calculus. In FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science - 20th Conference, Proceedings. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 264–276). Springer. http://www.math.bas.bg/~gelevdp/pdf/fsttcs2000.pdf

Guelev, D. P. (2000). Interval-related interpolation in interval temporal logics. In Proceedings of ICTL 2000.     https://pdfs.semanticscholar.org/3d6e/f8de08fca7da7b0b14992d4af2dbb69c163d.pdf

Guelev, D. P. (2000). Probabilistic neighbourhood logic. In 6th International Symposium, FTRTFT 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), LNCS 1926 (pp. 264–275). Springer. http://www.math.bas.bg/~gelevdp/pdf/ftrtft2000.pdf

Chaochen, Z., Guelev, D. P., & Naijun, Z. (2000). A higher-order duration calculus. In J. Davies, B. Roscoe, & J. Woodcock (Eds.), Millenial Perspectives in Computer Science. Proceedings of the 1999 Oxford-Microsoft Symposium in Honour of Professor Sir Anthony Hoare (pp. 407–416). Palgrave.

Van Hung, D., & Guelev, D. P. (1999). Completeness and decidability of a fragment of duration calculus with iteration. In Advances in Computing Science - ASIAN 1999 - 5th Asian Computing Science Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 139–150). Springer-Verlag.