The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1994) · Mathematical Social Sciences · doi:10.1016/0165-4896(94)90005-1 · Cited by 3,517
A Temporal Logic of Nested Calls and Returns
Alur, R., Etessami, K., & Madhusudan, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24730-2_35 · Cited by 3,339
Fundamenta informaticae 34(3) 1998
Apt, K. R., & Kirchner, C. (1998) · Data Archiving and Networked Services (DANS) · Cited by 3,048
Symbolic model checking: 1020 States and beyond
Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., & Hwang, L. J. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90017-a · Cited by 2,703
Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. (1995) · The MIT Press eBooks · doi:10.7551/mitpress/5803.001.0001 · Cited by 2,610
The dining cryptographers problem: Unconditional sender and recipient untraceability
Chaum, D. (1988) · Journal of Cryptology · doi:10.1007/bf00206326 · Cited by 1,408
Alternating-time temporal logic
Alur, R., Henzinger, T. A., & Kupferman, O. (2002) · Journal of the ACM · doi:10.1145/585265.585270 · Cited by 1,394
An automata-theoretic approach to branching-time model checking
Kupferman, O., Vardi, M. Y., & Wolper, P. (2000) · Journal of the ACM · doi:10.1145/333979.333987 · Cited by 614
MOCHA: Modularity in model checking
Alur, R., Henzinger, T. A., Mang, F. Y. C., Qadeer, S., Rajamani, S. K., & Tasiran, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0028774 · Cited by 382
MCK: Model Checking the Logic of Knowledge
Gammie, P., & van der Meyden, R. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27813-9_41 · Cited by 245
MCMAS: A Model Checker for Multi-agent Systems
Lomuscio, A., & Raimondi, F. (2006) · International Conference on Tools and Algorithms for Construction and Analysis of Systems · doi:10.1007/11691372_31 · Cited by 176
Self-citationModel checking multi-agent systems with MABLE
Wooldridge, M., Fisher, M., Huget, M.-P., & Parsons, S. (2002) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/544862.544965 · Cited by 148
Lomuscio, A. R., & Sergot, M. J. (2003) · Studia Logica · doi:10.1023/a:1026176900459 · Cited by 134
Self-citationComputationally grounded theories of agency
Wooldridge, M. (2002) · International Conference on Multi Agent Systems · doi:10.1109/icmas.2000.858426 · Cited by 94
The complexity of model checking concurrent programs against CTLK specifications
Lomuscio, A., & Raimondi, F. (2006) · Adaptive Agents and Multi-Agent Systems · doi:10.1145/1160633.1160733 · Cited by 54
Self-citationComparing BDD and SAT based techniques for model checking Chaum's Dining Cryptographers Protocol
Kacprzak, M., Lomuscio, A. R., Niewiadomski, A., Penczek, W., Raimondi, F., & Szreter, M. (2006) · UCL Discovery (University College London) · Cited by 46
Self-citation
Cited by
Formal Specification and Verification of Autonomous Robotic Systems: A Survey
Luckcuck, M., Farrell, M., Dennis, L. A., Dixon, C., & Fisher, M. (2020) · ACM Computing Surveys · doi:10.1145/3342355 · Cited by 281
Practical verification of decision-making in agent-based autonomous systems
Dennis, L. A., Fisher, M., Lincoln, N. K., Lisitsa, A., & Veres, S. M. (2016) · Automated Software Engineering · doi:10.1007/s10515-014-0168-9 · Cited by 102
A survey on verification strategies for intelligent transportation systems
Schmidtke, H. R. (2018) · Journal of Reliable Intelligent Environments · doi:10.1007/s40860-018-0070-5 · Cited by 19
“To obtain a formal verification method for multi-agent systems (MAS), the logical components of the agent need to be integrated with a formalism for verification of distributed systems [58] such as computation tree logic (CTL) [9] or temporal logic of actions [48].”
Method
Metadata
- Authors
- Lomuscio, A., Qu, H., & Raimondi, F.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 682-688
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1587990038
- Cited by
- 283
- References
- 16
- FWCI
- 18.10
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.