Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Zero-safe nets: comparing the collective and individual token approaches
Information and Computation - Special issue on EXPRESS 1997
Communication and Concurrency
Orchestrating Transactions in Join Calculus
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Permutation of transitions: An event structure semantics for CCS and SCCS
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Process Algebra with Backtracking
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
Electronic Notes in Theoretical Computer Science (ENTCS)
A Static Analysis for Beta-Binders
Electronic Notes in Theoretical Computer Science (ENTCS)
An Observational Model for Transactional Calculus of Services Orchestration
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Control Flow Analysis for Brane Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Reversible enhanced event structures: Towards reversible E-LOTOS
Computer Standards & Interfaces
A Control Flow Analysis for Beta-binders with and without static compartments
Theoretical Computer Science
A concurrent calculus with atomic transactions
ESOP'07 Proceedings of the 16th European conference on Programming
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Liveness of communicating transactions
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
On the statistical thermodynamics of reversible communicating processes
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Controlling reversibility in higher-order Pi
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Reversing algebraic process calculi
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Control Flow Analysis of Generalised Boolean Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Concurrent flexible reversibility
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Recovery within long-running transactions
ACM Computing Surveys (CSUR)
Modelling of bonding with processes and events
RC'13 Proceedings of the 5th international conference on Reversible Computation
Reversibility and asymmetric conflict in event structures
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
A Compositional Semantics for the Reversible p-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We propose a formalisation of the notion of transaction, using a variant of CCS, RCCS, that distinguishes reversible and irreversible actions, and incorporates a distributed backtrack mechanism. Any weakly correct implementation of a transaction in CCS, once embedded in RCCS, automatically obtains a correct one. We show examples where this method allows for a more concise implementation and a simpler proof of correctness.