Dimitar P. Guelev

Inf. Process. Lett., 2024

2023

A Generalized Hybrid Hoare Logic.

[BibT_eX]

[DOI]

CoRR, 2023

Of Temporary Coalitions in Terms of Concurrent Game Models, Announcements, and Temporal Projection.

[BibT_eX]

[DOI]

Proceedings of the Logic, Rationality, and Interaction - 9th International Workshop, 2023

2022

A separation theorem for discrete-time interval temporal logic.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2022

Gabbay Separation for the Duration Calculus.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Temporal Representation and Reasoning, 2022

2020

Reasoning about Temporary Coalitions and LTL-definable Ordered Objectives in Infinite Concurrent Multiplayer Games.

[BibT_eX]

[DOI]

CoRR, 2020

2017

Refining strategic ability in alternating-time temporal logic.

[BibT_eX]

[DOI]

Inf. Comput., 2017

An application of temporal projection to interleaving concurrency.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2017

Compositional Hoare-Style Reasoning About Hybrid CSP in the Duration Calculus.

[BibT_eX]

[DOI]

Shuling Wang

Naijun Zhan

Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017

2014

Refining and Delegating Strategic Ability in ATL.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

Guest editors' preface to special issue on interval temporal logics.

[BibT_eX]

[DOI]

Martin Leucker

Ann. Math. Artif. Intell., 2014

2013

Reducing Validity in Epistemic ATL to Validity in Epistemic CTL

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1st International Workshop on Strategic Reasoning, 2013

Super-Dense Computation in Verification of Hybrid CSP Processes.

[BibT_eX]

[DOI]

Proceedings of the Formal Aspects of Component Software - 10th International Symposium, 2013

2012

An Assume/Guarantee Based Compositional Calculus for Hybrid CSP.

[BibT_eX]

[DOI]

Shuling Wang

Naijun Zhan

Proceedings of the Theory and Applications of Models of Computation, 2012

Epistemic ATL with Perfect Recall, Past and Strategy Contexts.

[BibT_eX]

[DOI]

Proceedings of the Computational Logic in Multi-Agent Systems, 2012

2011

An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking.

[BibT_eX]

[DOI]

Constantin Enea

J. Appl. Non Class. Logics, 2011

An Epistemic Predicate CTL<sup>*</sup> for Finite Control π-Processes.

[BibT_eX]

[DOI]

Mads Dam

Proceedings of the 7th Workshop on Methods for Modalities, 2011

2010

Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions

[BibT_eX]

[DOI]

Constantin Enea

Proceedings of the Proceedings First Symposium on Games, 2010

2008

A Syntactical Proof of the Canonical Reactivity Form for Past Linear Temporal Logic.

[BibT_eX]

[DOI]

J. Log. Comput., 2008

Synthesising verified access control systems through model checking.

[BibT_eX]

[DOI]

Nan Zhang

J. Comput. Secur., 2008

Reasoning about QoS Contracts in the Probabilistic Duration Calculus.

[BibT_eX]

[DOI]

Proceedings of the 5th International Workshop on Formal Foundations of Embedded Software and Component-Based Software Architectures, 2008

Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions.

[BibT_eX]

[DOI]

Proceedings of the Declarative Agent Languages and Technologies VI, 2008

2007

Model-checking the preservation of temporal properties upon feature integration.

[BibT_eX]

[DOI]

Mark Dermot Ryan

Int. J. Softw. Tools Technol. Transf., 2007

Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2007

2005

On the completeness and decidability of duration calculus with iteration.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Synthesising Features by Games.

[BibT_eX]

[DOI]

Mark Dermot Ryan

Proceedings of the 5th International Workshop on Automated Verification of Critical Systems, 2005

Evaluating Access Control Policies Through Model Checking.

[BibT_eX]

[DOI]

Nan Zhang

Proceedings of the Information Security, 8th International Conference, 2005

2004

A Complete Proof System for First-order Interval Temporal Logic with Projection.

[BibT_eX]

[DOI]

J. Log. Comput., 2004

A Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2004

Logical Interpolation and Projection onto State in the Duration Calculus.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2004

Sharpening the Incompleteness of the Duration Calculus.

[BibT_eX]

[DOI]

Proceedings of the 6th AMAST Workshop on Real-Time Systems, 2004

Model-Checking Access Control Policies.

[BibT_eX]

[DOI]

Proceedings of the Information Security, 7th International Conference, 2004

Synthesising verified access control systems in XACML.

[BibT_eX]

[DOI]

Nan Zhang

Proceedings of the 2004 ACM Workshop on Formal Methods in Security Engineering, 2004

2003

Feature Integration as Substitution.

[BibT_eX]

Mark Dermot Ryan

Proceedings of the Feature Interactions in Telecommunications and Software Systems VII, 2003

2002

Prefix and Projection onto State in Duration Calculus.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Timed Systems, 2002

2001

Interval-Related Interpolation in Interval Temporal Logics.

[BibT_eX]

[DOI]

Log. J. IGPL, 2001

2000

Probabilistic Neighbourhood Logic.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 2000

A Complete Fragment of Higher-Order Duration µ-Calculus.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999

A Propositional Dynamic Logic with Qualitative Probabilities.

[BibT_eX]

[DOI]

J. Philos. Log., 1999

Completeness and Decidability of a Fragment of Duration Calculus with Iteration.

[BibT_eX]

[DOI]