A complete modal proof system for HAL: the Herbrand agent language

In this paper we present the process algebra HAL (Herbrand agent language) first introduced in (Belmesk et al., 1991). We then propose a modal proof system for HAL without value passing, and prove its correctness and completeness.

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 119; no. 1; pp. 127 - 143
Main Author Habbas, Zineb
Format Journal Article Conference Proceeding
LanguageEnglish
Published Amsterdam Elsevier B.V 11.10.1993
Elsevier
Subjects
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Process algebra
Milner logic
Concurrent program
Bisimulation
Formal specification
Specification
Verification
Distributed system
Formal verification
Online AccessGet full text

Cover

More Information
Summary:In this paper we present the process algebra HAL (Herbrand agent language) first introduced in (Belmesk et al., 1991). We then propose a modal proof system for HAL without value passing, and prove its correctness and completeness.
ISSN:0304-3975
1879-2294
DOI:10.1016/0304-3975(93)90342-Q