Year: 2014
Type: preprint
Abstract: Process algebra ACP based on the interleaving semantics can not be reversed. We design a reversible version of APTC called RAPTC. It has algebraic laws of reversible choice, sequence, parallelism, communication, silent step and abstraction, and also the soundness and completeness modulo strongly forward-reverse truly concurrent bisimulations and weakly forward-reverse truly concurrent bisimulations.
Source: arXiv (Cornell University)
Author: Wang, Yong
Institution: Beijing University of Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W77236779