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.


Abstractions for the example of business protocol
© Copyright Policy - OpenAccess
Related In: Results  -  Collection

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

Fig2: Abstractions for the example of business protocol

Mentions: In Fig. 1, let UserAgent, TravelCorp and Bank be a system UTB and let interactions between UserAgent, TravelCorp and Bank be internal actions. UTB receives external input through channel A by communicating action and sends results through channel D by communicating action , as Fig. 2 shows.Fig. 2


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

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

Fig2: Abstractions for the example of business protocol
Mentions: In Fig. 1, let UserAgent, TravelCorp and Bank be a system UTB and let interactions between UserAgent, TravelCorp and Bank be internal actions. UTB receives external input through channel A by communicating action and sends results through channel D by communicating action , as Fig. 2 shows.Fig. 2

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.