Process-algebraic approaches for multi-agent systems: an overview

DOI10.1007/S00200-005-0170-3zbMATH Open1088.68668OpenAlexW2080605827WikidataQ58194549 ScholiaQ58194549MaRDI QIDQ814895FDOQ814895

Authors: Mirko Viroli, Andrea Omicini 

Publication date: 8 February 2006

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-005-0170-3

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• From tuple spaces to tuple centres
• Title not available (Why is that?)
• Reasoning about rational agents
• Title not available (Why is that?)
• Title not available (Why is that?)
• Intention is choice with commitment
• Handbook of process algebra
• Title not available (Why is that?)
• Probabilistic extensions of process algebras.
• Title not available (Why is that?)
• Algebraic process verification.
• Process algebra with timing: Real time and discrete time
• ``Go to the ant: Engineering principles from natural multi-agent systems
• The state of the art in agent communication languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transactions on Computational Systems Biology III

Uses Software

• TuCSoN
• ReSpecT

This page was built for publication: Process-algebraic approaches for multi-agent systems: an overview

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