default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDimitar P. Guelev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Dimitar P. Guelev
, Ben C. Moszkowski:
Expressive completeness by separation for discrete time interval temporal logic with expanding modalities. Inf. Process. Lett. 186: 106480 (2024)- 2023
- [c24]Dimitar P. Guelev:
Of Temporary Coalitions in Terms of Concurrent Game Models, Announcements, and Temporal Projection. LORI 2023: 126-134 - [i4]Naijun Zhan, Bohua Zhan, Shuling Wang, Dimitar P. Guelev, Xiangyu Jin:
A Generalized Hybrid Hoare Logic. CoRR abs/2303.15020 (2023) - 2022
- [j15]Dimitar P. Guelev, Ben C. Moszkowski:
A separation theorem for discrete-time interval temporal logic. J. Appl. Non Class. Logics 32(1): 28-54 (2022) - [c23]Dimitar P. Guelev:
Gabbay Separation for the Duration Calculus. TIME 2022: 10:1-10:14 - 2020
- [i3]Dimitar P. Guelev:
Reasoning about Temporary Coalitions and LTL-definable Ordered Objectives in Infinite Concurrent Multiplayer Games. CoRR abs/2011.03724 (2020)
2010 – 2019
- 2017
- [j14]Ben C. Moszkowski, Dimitar P. Guelev:
An application of temporal projection to interleaving concurrency. Formal Aspects Comput. 29(4): 705-750 (2017) - [j13]Dimitar P. Guelev:
Refining strategic ability in alternating-time temporal logic. Inf. Comput. 254: 316-328 (2017) - [c22]Dimitar P. Guelev, Shuling Wang, Naijun Zhan:
Compositional Hoare-Style Reasoning About Hybrid CSP in the Duration Calculus. SETTA 2017: 110-127 - [i2]Dimitar P. Guelev, Shuling Wang, Naijun Zhan:
Compositional Hoare-style Reasoning about Hybrid CSP in the Duration Calculus. CoRR abs/1706.06246 (2017) - 2015
- [c21]Ben C. Moszkowski, Dimitar P. Guelev:
An Application of Temporal Projection to Interleaving Concurrency. SETTA 2015: 153-167 - 2014
- [j12]Ben C. Moszkowski, Dimitar P. Guelev, Martin Leucker:
Guest editors' preface to special issue on interval temporal logics. Ann. Math. Artif. Intell. 71(1-3): 1-9 (2014) - [c20]Dimitar P. Guelev:
Refining and Delegating Strategic Ability in ATL. SR 2014: 57-63 - 2013
- [c19]Dimitar P. Guelev, Shuling Wang, Naijun Zhan, Chaochen Zhou:
Super-Dense Computation in Verification of Hybrid CSP Processes. FACS 2013: 13-22 - [c18]Dimitar P. Guelev:
Reducing Validity in Epistemic ATL to Validity in Epistemic CTL. SR 2013: 81-89 - 2012
- [c17]Dimitar P. Guelev, Catalin Dima:
Epistemic ATL with Perfect Recall, Past and Strategy Contexts. CLIMA 2012: 77-93 - [c16]Shuling Wang, Naijun Zhan, Dimitar P. Guelev:
An Assume/Guarantee Based Compositional Calculus for Hybrid CSP. TAMC 2012: 72-83 - 2011
- [j11]Dimitar P. Guelev, Catalin Dima, Constantin Enea:
An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. J. Appl. Non Class. Logics 21(1): 93-131 (2011) - [c15]Dimitar P. Guelev, Mads Dam:
An Epistemic Predicate CTL* for Finite Control π-Processes. M4M/LAMAS 2011: 229-243 - 2010
- [c14]Catalin Dima, Constantin Enea, Dimitar P. Guelev:
Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions. GANDALF 2010: 103-117
2000 – 2009
- 2008
- [j10]Nan Zhang, Mark Ryan, Dimitar P. Guelev:
Synthesising verified access control systems through model checking. J. Comput. Secur. 16(1): 1-61 (2008) - [j9]Dimitar P. Guelev:
A Syntactical Proof of the Canonical Reactivity Form for Past Linear Temporal Logic. J. Log. Comput. 18(4): 615-623 (2008) - [c13]Dimitar P. Guelev, Catalin Dima:
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions. DALT 2008: 75-90 - [c12]Dimitar P. Guelev, Dang Van Hung:
Reasoning about QoS Contracts in the Probabilistic Duration Calculus. FESCA@ETAPS 2008: 41-62 - 2007
- [j8]Dimitar P. Guelev:
Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems. Log. Methods Comput. Sci. 3(3) (2007) - [j7]Dimitar P. Guelev, Mark Dermot Ryan, Pierre-Yves Schobbens:
Model-checking the preservation of temporal properties upon feature integration. Int. J. Softw. Tools Technol. Transf. 9(1): 53-62 (2007) - [i1]Dimitar P. Guelev:
Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems. CoRR abs/0706.0692 (2007) - 2005
- [j6]Dimitar P. Guelev, Dang Van Hung:
On the completeness and decidability of duration calculus with iteration. Theor. Comput. Sci. 337(1-3): 278-304 (2005) - [c11]Nan Zhang, Mark Ryan, Dimitar P. Guelev:
Evaluating Access Control Policies Through Model Checking. ISC 2005: 446-460 - [c10]Dimitar P. Guelev, Mark Dermot Ryan, Pierre-Yves Schobbens:
Synthesising Features by Games. AVoCS 2005: 79-93 - 2004
- [j5]Dimitar P. Guelev, Dang Van Hung:
A Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus. J. Appl. Non Class. Logics 14(1-2): 149-180 (2004) - [j4]Dimitar P. Guelev:
Logical Interpolation and Projection onto State in the Duration Calculus. J. Appl. Non Class. Logics 14(1-2): 181-208 (2004) - [j3]Dimitar P. Guelev:
A Complete Proof System for First-order Interval Temporal Logic with Projection. J. Log. Comput. 14(2): 215-249 (2004) - [c9]Nan Zhang, Mark Ryan, Dimitar P. Guelev:
Synthesising verified access control systems in XACML. FMSE 2004: 56-65 - [c8]Dimitar P. Guelev, Mark Ryan, Pierre-Yves Schobbens:
Model-Checking Access Control Policies. ISC 2004: 219-230 - [c7]Dimitar P. Guelev:
Sharpening the Incompleteness of the Duration Calculus. ARTS 2004: 91-104 - [c6]Dimitar P. Guelev, Mark Dermot Ryan, Pierre-Yves Schobbens:
Model-checking the Preservation of Temporal Properties upon Feature Integration. AVoCS 2004: 311-324 - 2003
- [c5]Dimitar P. Guelev, Mark Dermot Ryan, Pierre-Yves Schobbens:
Feature Integration as Substitution. FIW 2003: 275-294 - 2002
- [c4]Dimitar P. Guelev, Dang Van Hung:
Prefix and Projection onto State in Duration Calculus. Theory and Practice of Timed Systems @ ETAPS 2002: 101-119 - 2001
- [j2]Dimitar P. Guelev:
Interval-Related Interpolation in Interval Temporal Logics. Log. J. IGPL 9(5): 677-685 (2001) - 2000
- [c3]Dimitar P. Guelev:
A Complete Fragment of Higher-Order Duration µ-Calculus. FSTTCS 2000: 264-276 - [c2]Dimitar P. Guelev:
Probabilistic Neighbourhood Logic. FTRTFT 2000: 264-275
1990 – 1999
- 1999
- [j1]Dimitar P. Guelev:
A Propositional Dynamic Logic with Qualitative Probabilities. J. Philos. Log. 28(6): 575-604 (1999) - [c1]Dang Van Hung, Dimitar P. Guelev:
Completeness and Decidability of a Fragment of Duration Calculus with Iteration. ASIAN 1999: 139-150
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
