Decidability of model checking multi-agent systems against a class of EHS specifications

MaRDI QIDQ5283018zbMATH OpenFDO

Authors Alessio R. Lomuscio, Jakub Michaliszyn

Publication date 18 July 2017

Full work available at URL http://ebooks.iospress.nl/volumearticle/36997

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Agent technology and artificial intelligence (68T42)

Recommendations

• On the (un-)decidability of model checking resource-bounded agents
• Specification and Verification of Multi-Agent Systems
• scientific article; zbMATH DE number 2182497
• mcmas: A Model Checker for Multi-agent Systems
• scientific article; zbMATH DE number 2064229

Cited in

(21)

• Complexity analysis of a unifying algorithm for model checking interval temporal logic
• Which fragments of the interval temporal logic HS are tractable in model checking?
• Abstract State Machines 2004. Advances in Theory and Practice
• Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives
• On the (un-)decidability of model checking resource-bounded agents
• Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
• Interval temporal logic model checking: the border between good and bad HS fragments
• Interval vs. point temporal logic model checking. An expressiveness comparison
• On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions
• Model checking interval temporal logics with regular expressions
• Model checking auctions as artifact systems: decidability via finite abstraction
• Checking interval properties of computations
• Proceedings of the 11th workshop on logic, language, information and computation (WoLLIC 2004), Université Paris 12, Fontainebleau, France, July 19--22, 2004.
• Model checking the logic of Allen's relations \textit{Meets} and \textit{Started-by} is \(\mathbf{P}^{\mathbf{NP}}\)-complete
• scientific article; zbMATH DE number 7471713 (Why is no real title available?)
• \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes
• Parametric interval temporal logic over infinite words
• Constraining cycle alternations in model checking for interval temporal logic
• A quantitative extension of interval temporal logic over infinite words
• Interval Temporal Logic for Visibly Pushdown Systems
• A separation theorem for discrete-time interval temporal logic

This page was built for publication: Decidability of model checking multi-agent systems against a class of EHS specifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283018)