Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Dimitar P. Guelev"'
Autor:
Dimitar P. Guelev
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 146, Iss Proc. SR 2014, Pp 57-63 (2014)
We propose extending Alternating-time Temporal Logic (ATL) by an operator F to express that agent i can distribute its powers to a set of sub-agents G in a way which satisfies ATL condition f on the strategic ability of the coalitions they may form,
Externí odkaz:
https://doaj.org/article/a1069f24072341c89baf5761ea4fefbc
Autor:
Dimitar P. Guelev
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 112, Iss Proc. SR 2013, Pp 81-89 (2013)
We propose a validity preserving translation from a subset of epistemic Alternating-time Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable m
Externí odkaz:
https://doaj.org/article/7027ef434fb34f44813cf554d158a297
Autor:
Dimitar P. Guelev
Publikováno v:
Logical Methods in Computer Science, Vol Volume 3, Issue 3 (2007)
The paper presents probabilistic extensions of interval temporal logic (ITL) and duration calculus (DC) with infinite intervals and complete Hilbert-style proof systems for them. The completeness results are a strong completeness theorem for the syst
Externí odkaz:
https://doaj.org/article/6ea38e9830be4a23beb486159860597c
Autor:
Dimitar P. Guelev, Ben Moszkowski
Publikováno v:
Journal of Applied Non-Classical Logics. 32:28-54
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6704c549ed31d99fecc28f33eaa3de4
https://doi.org/10.1080/11663081.2022.2050135
https://doi.org/10.1080/11663081.2022.2050135
Autor:
Dimitar P. Guelev, Ben C. Moszkowski
Publikováno v:
Formal Aspects of Computing. 29:705-750
We revisit the earliest temporal projection operator Π in discrete-time Propositional Interval Temporal Logic (PITL) and use it to formalise interleaving concurrency. The logical properties of Π as a normal modality and a way to eliminate it in bot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8dad15086f1a49b93c0aee4c2e5e6600
https://doi.org/10.1007/s00165-017-0417-3
https://doi.org/10.1007/s00165-017-0417-3
Autor:
Dimitar P. Guelev
Publikováno v:
Information and Computation. 254:316-328
We propose extending Alternating-time Temporal Logic (ATL) by a unary operator i about distributing the powers of some given agent i to a given set of sub-agents . i means that i's powers can be distributed in a way which satisfies the ATL condition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc3e1c06087e1bc263698e3a7a8354e7
https://doi.org/10.1016/j.ic.2016.10.013
https://doi.org/10.1016/j.ic.2016.10.013
Publikováno v:
Dependable Software Engineering. Theories, Tools, and Applications ISBN: 9783319694825
SETTA
SETTA
Deductive methods for the verification of hybrid systems vary on the format of statements in correctness proofs. Building on the example of Hoare triple-based reasoning, we have investigated several such methods for systems described in Hybrid CSP, e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5907b9bb04ffa9adafc3c19e4e8bb35
https://doi.org/10.1007/978-3-319-69483-2_7
https://doi.org/10.1007/978-3-319-69483-2_7
Autor:
Dimitar P. Guelev, Mads Dam
Publikováno v:
Electronic Notes in Theoretical Computer Science. 278:229-243
We examine model checking of finite control π-calculus processes against specifications in epistemic predicate CTL*. In contrast to branching time settings such as CTL or the modal μ-calculus, the general problem, even for LTL, is undecidable, esse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51bbc0a16dcbce19fcd1c8d07cf33284
https://doi.org/10.1016/j.entcs.2011.10.018
https://doi.org/10.1016/j.entcs.2011.10.018
Autor:
Dang Van Hung, Dimitar P. Guelev
Publikováno v:
Electronic Notes in Theoretical Computer Science. 238(6):41-62
The notion of contract was introduced to component-based software development in order to facilitate the semantically correct composition of components. We extend the form of this notion which is based on designs to capture probabilistic requirements
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3d55bd75598ef2cbd10020e978a3544
Publikováno v:
Journal of Computer Security. 16:1-61
We present a framework for evaluating and generating access control policies. The framework contains a modelling formalism called RW, which is supported by a model checking tool. RW is designed for modelling access control policies, and verifying the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3c4f24fedc4079a50ba52964aa2ac49
https://doi.org/10.3233/jcs-2008-16101
https://doi.org/10.3233/jcs-2008-16101