Parallel graph transformations with double pushout grammars

  • Authors:
  • Leszek Kotulski;Adam Sędziwy

  • Affiliations:
  • AGH University of Sciences and Technology, Institute of Automatics, Kraków, Poland;AGH University of Sciences and Technology, Institute of Automatics, Kraków, Poland

  • Venue:
  • ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multiagent systems implementing artificial intelligence systems, require a formal representation to specify and simulate their properties and behavior. Double pushout graph grammars posses a very high expressive power; the possibility of the use of parallel graph transformations in a distributed environment make them useful in this area thanks to application of the complementary graphs concept. The mentioned idea is formally introduced and the polynomial computational complexity of underlying algorithms is proved.