Sciweavers

5863 search results - page 9 / 1173
» On Model-Checking of P Systems
Sort
View
ATAL
2008
Springer
13 years 12 months ago
Quantifying over coalitions in epistemic logic
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
ATAL
2004
Springer
14 years 1 months ago
Verification of Multiagent Systems via Unbounded Model Checking
We present an approach to the problem of verification of epistemic properties of multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend ...
Magdalena Kacprzak, Alessio Lomuscio, Wojciech Pen...
ASE
2004
117views more  ASE 2004»
13 years 9 months ago
Model Checking for Combined Logics with an Application to Mobile Systems
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 termin...
Massimo Franceschet, Angelo Montanari, Maarten de ...
ATAL
2010
Springer
13 years 10 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga
ENTCS
2006
138views more  ENTCS 2006»
13 years 9 months ago
Model Checking Russian Cards
We implement a specific protocol for bit exchange among card-playing agents in three different state-of-the-art epistemic model checkers and compare the results. Key words: Crypto...
Hans P. van Ditmarsch, Wiebe van der Hoek, Ron van...