Limits...
An algebra of reversible computation

View Article: PubMed Central - PubMed

ABSTRACT

We design an axiomatization for reversible computation called reversible ACP (RACP). It has four extendible modules: basic reversible processes algebra, algebra of reversible communicating processes, recursion and abstraction. Just like process algebra ACP in classical computing, RACP can be treated as an axiomatization foundation for reversible computation.

No MeSH data available.


An example of business protocol
© Copyright Policy - OpenAccess
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC5037115&req=5

Fig1: An example of business protocol

Mentions: We take an example of business protocols as Fig. 1 shows. The process of the example is following, in which the user plans a travel by use of a user agent UserAgent.


An algebra of reversible computation
An example of business protocol
© Copyright Policy - OpenAccess
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC5037115&req=5

Fig1: An example of business protocol
Mentions: We take an example of business protocols as Fig. 1 shows. The process of the example is following, in which the user plans a travel by use of a user agent UserAgent.

View Article: PubMed Central - PubMed

ABSTRACT

We design an axiomatization for reversible computation called reversible ACP (RACP). It has four extendible modules: basic reversible processes algebra, algebra of reversible communicating processes, recursion and abstraction. Just like process algebra ACP in classical computing, RACP can be treated as an axiomatization foundation for reversible computation.

No MeSH data available.