Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of reasoning about knowledge and time. I. lower bounds
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Properties of independently axiomatizable bimodal logics
Journal of Symbolic Logic
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Reasoning about knowledge
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking
Theoretical Computer Science
An automata-theoretic approach to modular model checking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Frontiers of Combining Systems 2
Frontiers of Combining Systems 2
Synchronization of Logics with Mixed Rules: Completeness Preservation
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Handbook of automated reasoning
Axiomatisation and decidability of multi-dimensional Duration Calculus
Information and Computation
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Query Language for Location-Based Services: A Model Checking Approach
IEICE - Transactions on Information and Systems
On the Multimodal Logic of Elementary Normative Systems
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Temporalised Epistemic Logic for Reasoning about Agent-Based Systems
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Analysis of authentication protocols in agent-based systems using labeled tableaux
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
A model checking-based approach for location query processing in pervasive computing environments
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
On the multimodal logic of normative systems
COIN'07 Proceedings of the 2007 international conference on Coordination, organizations, institutions, and norms in agent systems III
Representations of Time within Normative MAS
Proceedings of the 2010 conference on Legal Knowledge and Information Systems: JURIX 2010: The Twenty-Third Annual Conference
Hybrid specification of reactive systems: an institutional approach
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
The complexity of model checking concurrent programs against CTLK specifications
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Combinations of normal and non-normal modal logics for modeling collective trust in normative MAS
AICOL'11 Proceedings of the 25th IVR Congress conference on AI Approaches to the Complexity of Legal Systems: models and ethical challenges for legal systems, legal language and legal ontologies, argumentation and software agents
Combined model checking for temporal, probabilistic, and real-time logics
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are terminating, sound, and complete, we analyze their computational complexity, and we report on experiments with implementations. We take a close look at mobile systems and show how the proposed combined model checking framework can be successfully applied to the specification and verification of their properties.