Bounded Model Checking for Deontic Interpreted Systems

Woźna, Bożena; Lomuscio, Alessio; Penczek, Wojciech

doi:10.1016/j.entcs.2004.11.015

Cited by 16 publications

(14 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Specifically, the formal model used here, i.e., temporal deontic systems of Section 2, is an extension to branching time of deontic interpreted systems [14,17], a formalism for reasoning about knowledge and correctness. The presentation given here follows that of [32], where a bounded model checking technique was also given. The notion of compliance has acquired considerable attention in the past few years in the area of agents and generally in AI.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Towards verifying contract regulated service composition

Lomuscio

Solanki

2010

Auton Agent Multi-Agent Syst

Self Cite

View full text Add to dashboard Cite

We report on a novel approach to (semi-)automatically compile and verify contractregulated service compositions implemented as multi-agent systems. We model web service behaviours and the contracts governing them as WSBPEL specification. We use the formalism of temporal-epistemic logic, suitably extended to deal with compliance/violations of contracts, to specify properties of service compositions. We compile the WSBPEL behaviours into a specialised system description language ISPL, to be used with the model checker MCMAS to verify the behaviours automatically. We illustrate these concepts using a motivating example whose state space is approximately 10 6 and discuss experimental results.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

Towards verifying contract regulated service composition

Lomuscio

Solanki

2010

Auton Agent Multi-Agent Syst

Self Cite

View full text Add to dashboard Cite

show abstract

“…See also [121] for an extended paper on the subject. Regarding actual verification, Penczek and Lomuscio have applied bounded model-checking techniques to deontic interpreted systems [195].…”

Section: • Deontic Interpreted Systemsmentioning

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

“…The number of them depends on the value of k and the formula ϕ, and it is computed using the function f k . This function determines the number of k-paths sufficient for checking an ECTLK formula, see [63] for more details. Intuitively, each nesting of an epistemic or temporal formula in ϕ increases the value of f k (ϕ) by 1, whereas subformulas EU, EG and C Γ add more k−paths.…”

Section: Bounded Model Checkingmentioning

confidence: 99%

“…Given the translations above [63], verification of ϕ over M k reduces to checking the satisfiability of the propositional formula [M…”

Section: Intuitively [Egα]mentioning

confidence: 99%