


default search action
MoChArt 2010: Atlanta, GA, USA
- Ron van der Meyden
, Jan-Georg Smaus:
Model Checking and Artificial Intelligence - 6th International Workshop, MoChArt 2010, Atlanta, GA, USA, July 11, 2010, Revised Selected and Invited Papers. Lecture Notes in Computer Science 6572, Springer 2011, ISBN 978-3-642-20673-3 - Hector Geffner
:
Planning with Incomplete Information - (Invited Paper). 1-11 - Stefan Edelkamp, Damian Sulewski:
External Memory Breadth-First Search with Delayed Duplicate Detection on the GPU. 12-31 - Stefan Edelkamp, Mark Kellershoff, Damian Sulewski:
Program Model Checking via Action Planning. 32-51 - Alessio Lomuscio
, Hongyang Qu, Francesco Russo
:
Automatic Data-Abstraction in Model Checking Multi-Agent Systems. 52-68 - Natasha Alechina, Brian Logan, Nguyen Hoang Nga
, Abdur Rakib
:
Automated Verification of Resource Requirements in Multi-Agent Systems Using Abstraction. 69-84 - Orna Kupferman, Adin Rosenberg:
The Blowup in Translating LTL to Deterministic Automata. 85-94 - Xiaowei Huang
, Cheng Luo, Ron van der Meyden
:
Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic. 95-111 - Xiangyu Luo, Kaile Su
, Ming Gu, Lijun Wu, Jinji Yang:
Symbolic Model Checking the Knowledge in Herbivore Protocol. 112-129

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.