Sciweavers

2875 search results - page 324 / 575
» Model checking agentspeak
Sort
View
FUIN
2008
101views more  FUIN 2008»
15 years 3 months ago
Translation of Intermediate Language to Timed Automata with Discrete Data
The aim of this work is to describe the translation from Intermediate Language, one of the input formalisms of the model checking platform VerICS, to timed automata with discrete d...
Agata Janowska, Pawel Janowski, Dobieslaw Wr&oacut...
111
Voted
CORR
2007
Springer
151views Education» more  CORR 2007»
15 years 3 months ago
The Complexity of Games on Higher Order Pushdown Automata
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
Thierry Cachat, Igor Walukiewicz
126
Voted
IPL
2007
125views more  IPL 2007»
15 years 3 months ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston
AI
2004
Springer
15 years 3 months ago
Compiling propositional weighted bases
In this paper, we investigate the extent to which knowledge compilation can be used to improve model checking and inference from propositional weighted bases. We first focus on th...
Adnan Darwiche, Pierre Marquis
115
Voted
SEFM
2009
IEEE
15 years 10 months ago
An Automated Approach to Verifying Diagnosability in Multi-agent Systems
—This paper addresses the issue of guaranteeing the correctness of fault diagnosis mechanisms in multi-agent systems. We propose an automated approach to verifying the property o...
Jonathan Ezekiel, Alessio Lomuscio