Polyadic History-Dependent Automata for the Fusion Calculus
2003 (English)Report (Other academic)
We extend History Dependent Automata to handle polyadic labels, and using a new symbolic semantics of fusion calculus we give a mapping into these Polyadic HDA with Negative Transitions, and show that the mapping is adequate with respect to hyperequivalence in the fusion calculus. This lays the grounds for HD-automata-based tools applicable not only to the monadic pi-calculus but also to the fusion calculus and polyadic pi-calculus, allowing implementation efforts to be focused at a foundational level rather than being multiplied in several tools.
Place, publisher, year, edition, pages
, IT Technical Reports, ISSN 1404-3203 ; 2003-062
Computer and Information Science
IdentifiersURN: urn:nbn:se:uu:diva-47867OAI: oai:DiVA.org:uu-47867DiVA: diva2:75774