메뉴 건너뛰기




Volumn 1, Issue 1, 2007, Pages 28-62

Systematic verification of multi-agent systems based on rigorous executable specifications

Author keywords

executable specifications; formal verification; MAS; model checking; Multi Agent System; simulation

Indexed keywords


EID: 56749103285     PISSN: 17461375     EISSN: 17461383     Source Type: Journal    
DOI: 10.1504/IJAOSE.2007.013264     Document Type: Article
Times cited : (11)

References (39)
  • 4
    • 13844256765 scopus 로고    scopus 로고
    • UML 2.0 and agents: how to build agent-based systems with the new UML standard
    • Bauer, B. and Odell, J. (2005) ‘UML 2.0 and agents: how to build agent-based systems with the new UML standard’, Engineering Applications of Artificial Intelligence, Vol. 18, pp.141–157.
    • (2005) Engineering Applications of Artificial Intelligence , vol.18 , pp. 141-157
    • Bauer, B.1    Odell, J.2
  • 12
    • 26844498374 scopus 로고    scopus 로고
    • Model-driven development of reconfigurable mechatronic systems with mechatronic UML
    • U. Assmann, A. Rensink and M. Aksit (Eds.) Springer Verlag
    • Burmester, S., Giese, H. and Tichy, M. (2005) ‘Model-driven development of reconfigurable mechatronic systems with mechatronic UML’, in U. Assmann, A. Rensink and M. Aksit (Eds.) Model Driven Architecture: Foundations and Applications, Lecture Notes in Computer Science, Springer Verlag, Vol. 3599, pp.47–61.
    • (2005) Model Driven Architecture: Foundations and Applications, Lecture Notes in Computer Science , vol.3599 , pp. 47-61
    • Burmester, S.1    Giese, H.2    Tichy, M.3
  • 18
    • 33745156064 scopus 로고    scopus 로고
    • Separation of non-orthogonal concerns in software architecture and design
    • Giese, H. and Vilbig, A. (2006) ‘Separation of non-orthogonal concerns in software architecture and design’, Software and System Modeling (SoSyM), Vol. 5, No. 2, pp.136–169.
    • (2006) Software and System Modeling (SoSyM) , vol.5 , Issue.2 , pp. 136-169
    • Giese, H.1    Vilbig, A.2
  • 19
    • 0036319465 scopus 로고    scopus 로고
    • Software debugging, testing, and verification
    • Hailpern, B. and Santhanam, P. (2002) ‘Software debugging, testing, and verification’, IBM Systems Journal, Vol. 41, No. 1.
    • (2002) IBM Systems Journal , vol.41 , Issue.1
    • Hailpern, B.1    Santhanam, P.2
  • 23
    • 33745467984 scopus 로고    scopus 로고
    • Grounding social interactions in the environment
    • D. Weyns, V. Parunak and F. Michel (Eds.) Springer Verlag
    • Klein, F. and Giese, H. (2006b) ‘Grounding social interactions in the environment’, in D. Weyns, V. Parunak and F. Michel (Eds.) Environments for Multiagent Systems II, Lecture Notes in Artificial Intelligence, Springer Verlag, Vol. 3830, pp.139–162.
    • (2006) Environments for Multiagent Systems II, Lecture Notes in Artificial Intelligence , vol.3830 , pp. 139-162
    • Klein, F.1    Giese, H.2
  • 27
    • 10444247744 scopus 로고    scopus 로고
    • Towards model checking graph grammars
    • M. Leuschel, S. Gruner and S.L. Presti (Eds.) Technical Report DSSE-TR-2003–2, University of Southampton
    • Rensink, A. (2003) ‘Towards model checking graph grammars’, in M. Leuschel, S. Gruner and S.L. Presti (Eds.) Workshop on Automated Verification of Critical Systems (AVoCS), Technical Report DSSE-TR-2003–2, University of Southampton, pp.150–160.
    • (2003) Workshop on Automated Verification of Critical Systems (AVoCS) , pp. 150-160
    • Rensink, A.1
  • 29
    • 0032294174 scopus 로고    scopus 로고
    • Agent communication languages: rethinking the principles
    • Singh, M.P. (1998) ‘Agent communication languages: rethinking the principles’, IEEE Computer, Vol. 31, No. 12, pp.40–47.
    • (1998) IEEE Computer , vol.31 , Issue.12 , pp. 40-47
    • Singh, M.P.1
  • 33
    • 84945730989 scopus 로고    scopus 로고
    • Attributes can be substituted by associations (as done explicitly for the traffic-light state) and cardinalities can be encoded as structural invariants (as in Figure 8) using the presented formalisation. Subtyping requires an extension of the presented notion of type conformity.
    • Attributes can be substituted by associations (as done explicitly for the traffic-light state) and cardinalities can be encoded as structural invariants (as in Figure 8) using the presented formalisation. Subtyping requires an extension of the presented notion of type conformity.
  • 34
    • 84945730990 scopus 로고    scopus 로고
    • Note that the definition of E′ results in the implicit deletion of dangling edges. Otherwise, the resulting tuple might not represent a graph, as the functions srcE′ and tgtE′ would not necessarily be restricted to N′.
    • Note that the definition of E′ results in the implicit deletion of dangling edges. Otherwise, the resulting tuple might not represent a graph, as the functions srcE′ and tgtE′ would not necessarily be restricted to N′.
  • 35
    • 84945730991 scopus 로고    scopus 로고
    • In our examples, we typically label variables in patterns with letters (ca, cb,…), objects in configurations with numbers (c22, c23,…).
    • In our examples, we typically label variables in patterns with letters (ca, cb,…), objects in configurations with numbers (c22, c23,…).
  • 36
    • 84945730992 scopus 로고    scopus 로고
    • A simple graph pattern is thus a graph pattern with an empty set of NACs.
    • A simple graph pattern is thus a graph pattern with an empty set of NACs.
  • 37
    • 84945730993 scopus 로고    scopus 로고
    • As agents are autonomous and may choose to do nothing, commitments provide the only notion of progress that is useful from an external perspective
    • As agents are autonomous and may choose to do nothing, commitments provide the only notion of progress that is useful from an external perspective.
  • 38
    • 84945730994 scopus 로고    scopus 로고
    • http://www.fujaba.de
  • 39
    • 84945730995 scopus 로고    scopus 로고
    • Condition 9 cannot be checked in the general case, as typed graph transformation systems are Turing complete, which rules out the use of automatic verification techniques (cf. Baldan et al., 2005)
    • Condition 9 cannot be checked in the general case, as typed graph transformation systems are Turing complete, which rules out the use of automatic verification techniques (cf. Baldan et al., 2005).


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.