A theorem-proving approach to deciding properties of finite control agents
Number of Authors: 1
1996 (English)Report (Refereed)
The report presents a decision procedure for assertions in an extension of the mu-calculus about finite-control pi-calculus agents. The procedure is based on the classical cut-free sequent calculus and associated techniques of automatic theorem proving.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1996, 1. , 14 p.
SICS Technical Report, ISSN 1100-3154 ; T96:02
mu-calculus, pi-calculus, theorem proving
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-14145OAI: oai:DiVA.org:ri-14145DiVA: diva2:1035432