Bounded Model Checking for Interpreted Systems: Preliminary Experimental Results

Lomuscio, Alessio; Łasica, T.; Penczek, Wojciech

doi:10.1007/978-3-540-45133-4_10

Cited by 18 publications

(15 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Penczek and Lomuscio (2003a,b), and Lomuscio et al (2003) an extension of the method of bounded model checking (one of the main SAT-based techniques) to CTLK, a language comprising both CTL and knowledge operators, was defined, implemented, and evaluated. Quite recently, unbounded model checking method for CTLK has been defined and implemented (Kacprzak et al 2004a,b).…”

Section: State Of the Art And Related Workmentioning

confidence: 99%

A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic

Kacprzak¹,

Penczek

2004

Synthese

Self Cite

View full text Add to dashboard Cite

This paper deals with the problem of verification of game-like structures by means of symbolic model checking. Alternating-time Temporal Epistemic Logic (ATEL) is used for expressing properties of multi-agent systems represented by alternating epistemic temporal systems as well as concurrent epistemic game structures. Unbounded model checking (a SAT based technique) is applied for the first time to verification of ATEL. An example is given to show an application of the technique.

show abstract

Section: State Of the Art And Related Workmentioning

confidence: 99%

A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic

Kacprzak¹,

Penczek

2004

Synthese

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [16,18,19] presented at AAMAS'03, an extension of the method of bounded model checking (one of the main SAT-based techniques) to CTLK, a language comprising both CTL and knowledge operators, was defined, implemented, and evaluated. Quite recently, unbounded model checking method for CTLK has been defined and implemented [11,13].…”

Section: State Of the Art And Related Literaturementioning

confidence: 99%

Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1

Kacprzak

Penczek

2005

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

Alternating-time Temporal Logic (ATL) is typically applied for specifying properties of multiagent systems modelled by game-like structures. This paper deals with verification of ATL by means of a fully symbolic model checking. Unbounded model checking (a SAT-based technique) is applied for the first time to verification of AT. Several examples are given in order to present an application of the technique.

show abstract

“…Experimental results on the "attacking generals" problem, which has applications for agent coordination, were reported in [118]. It remains to be seen if the performance of both SAT-and OBDD-based model-checking (and the associated translations) for practical verification of multi-agent systems will be satisfactory.…”

Section: • Bounded Model Checking For Epistemic Temporal Logicsmentioning

confidence: 99%

Computational Logics and Agents: A Road Map of Current Technologies and Future Trends

Fisher

Bordini

Hirsch

et al. 2007

Computational Intelligence

View full text Add to dashboard Cite

The concept of an agent is increasingly used in contemporary software applications, particularly those involving the Internet, autonomous systems, or cooperation. However, with dependability and safety in mind, it is vital that the mechanisms for representing and implementing agents are clear and consistent. Hence there has been a strong research effort directed at using formal logic as the basis for agent descriptions and agent implementation. Such a logical basis not only presents the clarity and consistency required but also allows for important techniques such as logical verification to be applied.We present a roadmap of research into the use of computational logic in agent-based systems and survey much of the recent work in these areas. Even though, with such a rapidly changing field, it is impossible to cover every development, we aim to give the reader sufficient background to understand the current research problems and potential future developments in this maturing area.

show abstract

Bounded Model Checking for Interpreted Systems: Preliminary Experimental Results

Cited by 18 publications

References 9 publications

A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic

A Sat-Based Approach to Unbounded Model Checking for Alternating-Time Temporal Epistemic Logic

Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1

Computational Logics and Agents: A Road Map of Current Technologies and Future Trends

Contact Info

Product

Resources

About