Counter abstraction for regular open teams

DOI10.1016/J.IPL.2024.106533MaRDI QIDQ6663521

George Alphy, S. Sheerazuddin, A. T. Shabana

Publication date: 14 January 2025

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

formal verificationmulti-agent systemscounter abstractionmulti-counter systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Agent technology and artificial intelligence (68T42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parameterised verification for multi-agent systems
• Agent-based optimization
• An approach to automating the verification of compact parallel coordination programs. I
• On the reachability problem for 5-dimensional vector addition systems
• A structure to decide reachability in Petri nets
• The topology of look-compute-move robot wait-free algorithms with hard termination
• Using Theorem Proving to Verify Properties of Agent Programs
• Lossy Counter Machines Decidability Cheat Sheet
• Symbolic Counter Abstraction for Concurrent Software
• Reasoning about systems with many processes
• Computer Aided Verification

This page was built for publication: Counter abstraction for regular open teams

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