Communicating sequential processes
Communicating sequential processes
A calculus of mobile processes, II
Information and Computation
Computability of Recursive Functions
Journal of the ACM (JACM)
Well-structured transition systems everywhere!
Theoretical Computer Science
Communication and Concurrency
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computation: finite and infinite machines
Computation: finite and infinite machines
Process Algebra: Equational Theories of Communicating Processes
Process Algebra: Equational Theories of Communicating Processes
Replication vs. recursive definitions in channel based calculi
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
The conversation calculus: a model of service-oriented computation
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
SCC: a service centered calculus
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
A trace semantics for long-running transactions
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Hi-index | 0.00 |
The investigation of the foundational aspects of linguistic mechanisms for programming long running transactions (such as the scope operator of WS-BPEL) has recently renewed the interest in process algebraic operators that interrupt the execution of one process, replacing it with another one called the compensation . We investigate the expressive power of two of such operators, the interrupt operator of CSP and the try-catch operator for exception handling. We consider two non Turing powerful fragments of CCS (without restriction and relabeling, but with either replication or recursion). We show that the addition of such operators strictly increases the expressive power of the calculi. The calculi with replication and either interrupt or try-catch turn out to be weakly Turing powerful (Turing Machines can be encoded but only nondeterministically). The calculus with recursion is weakly Turing powerful when extended with interrupt, but it is Turing complete (Turing Machine can be modeled deterministically) when extended with try-catch.