Communicating sequential processes
Communicating sequential processes
Process algebra
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
On Representing CCS Programs by Finite Petri Nets
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
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
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
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
On the Expressiveness of Forwarding in Higher-Order Communication
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Advanced mechanisms for service combination and transactions
Rigorous software engineering for service-oriented systems
On the expressive power of primitives for compensation handling
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Analysis of service oriented software systems with the conversation calculus
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Time and exceptional behavior in multiparty structured interactions
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
Failure-divergence semantics and refinement of long running transactions
Theoretical Computer Science
First-Order dynamic logic for compensable processes
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Hi-index | 0.00 |
The investigation into 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, due to the occurrence of a failure, interrupt the execution of one process, replacing it with another one called the failure handler. We investigate the decidability of termination problems for two simple fragments of CCS (one with recursion and one with replication) extended with one of two such operators, the interrupt operator of CSP and the try-catch operator for exception handling. More precisely, we consider the existential termination problem (existence of one terminated computation) and the universal termination problem (all computations terminate). We prove that, as far as the decidability of the considered problems is concerned, under replication there is no difference between interrupt and try-catch (universal termination is decidable while existential termination is not), while under recursion this is not the case (existential termination is undecidable while universal termination is decidable only for interrupt). As a consequence of our undecidability results, we show the existence of an expressiveness gap between a fragment of CCS and its extension with either the interrupt or the try-catch operator.