Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ATAL
2006
Springer

favoriteEmaildiscussreport

142views Intelligent Agents» more ATAL 2006»

The complexity of model checking concurrent programs against CTLK specifications

13 years 11 months ago

The complexity of model checking concurrent programs against CTLK specifications

Download www.doc.ic.ac.uk

This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying programs by means of two model checkers for multi-agent systems: MCMAS and Verics. General Terms Algorithms; Theory; Verification Keywords Model checking multi-agent systems; Complexity

Alessio Lomuscio, Franco Raimondi

Real-time Traffic

ATAL 2006 | Intelligent Agents | Model Checking | Multi-agent Systems | Paper Presents Complexity |

claim paper

Related Content

» Translation Validation of HighLevel Synthesis

» Using Model Checking to Debug Device Firmware

» Enforcing Concurrent Temporal Behaviors

» Efficient Detection of Errors in Java Components Using Random Environment and Restarts

» Behaviour Analysis of Distributed Systems Using the Tracta Approach

» Security protocols properties and their monitoring

» A Guided Tour through Some Extensions of the Event Calculus

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	ATAL
Authors	Alessio Lomuscio, Franco Raimondi

Comments (0)