Termination, deadlock, and divergence

Aceto, Luca; Hennessy, Matthew

doi:10.1145/147508.147527

Cited by 87 publications

(103 citation statements)

References 29 publications

(47 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results presented in this study complement those offered in, e.g., [7,37,38,41], where notions of divergence-sensitive preorders based on variations on prebisimilarity [26,32] or on the refusal simulation preorder have been given ground-complete inequational axiomatizations. They are just a first step in the study of the equational logic for notions of behavioural semantics in the extension of van Glabbeek's spectrum to behavioural semantics that abstract from internal steps in computation [22].…”

Section: Resultssupporting

confidence: 77%

Axiomatizing Weak Ready Simulation Semantics over BCCSP

Aceto

Frutos-Escrig

Gregorio-Rodríguez

et al. 2011

Theoretical Aspects of Computing – ICTAC 2011

View full text Add to dashboard Cite

Abstract. Ready simulation has proven to be one of the most significant semantics in process theory. It is at the heart of a number of general results that pave the way to a comprehensive understanding of the spectrum of process semantics. Since its original definition by Bloom, Istrail and Meyer in 1995, several authors have proposed generalizations of ready simulation to deal with internal actions. However, a thorough study of the (non-)existence of finite (in)equational bases for weak ready simulation semantics is still missing in the literature. This paper presents a complete account of positive and negative results on the axiomatizability of weak ready simulation semantics over the language BCCSP. In addition, this study offers a thorough analysis of the axiomatizability properties of weak simulation semantics.

show abstract

Section: Resultssupporting

confidence: 77%

Axiomatizing Weak Ready Simulation Semantics over BCCSP

Aceto

Frutos-Escrig

Gregorio-Rodríguez

et al. 2011

Theoretical Aspects of Computing – ICTAC 2011

View full text Add to dashboard Cite

show abstract

“…P conforms to Q ∧ Q extends R =⇒ P conforms to R P conforms to Q ∧ Q reducesR P conforms to R P extends T 1 ∧ Q extends T 2 =⇒ P Q extends T 1 T 2 P extends T ∧ Q extends T =⇒ P Q extends T P extends T 1 ∧ P extends T 2 =⇒ P extends T 1 T 2 P extends P T P T ∧ P extends Q =⇒ P T extends Q T P extends T 1 ∧ P conforms to T 2 ∧ Q extends T 2 ∧ Q conforms to T 1 =⇒ P Q extends T 1 T 2 Table A.1: A summary of a few useful results in conformance, extension and reduction First, we shall show the (in)transitivity amongst conformance, reduction and extension. In particular, we will show the following.…”

Section: Appendix a A1 A Few Results On Conformance Extension And Rmentioning

confidence: 99%

“…Otherwise, it will form a deadlock. The failures of the parallel composition are just the unions of the refusals from its components 2 Roscoe [87] imposes additional restrictions on the original failures-divergences model and allow the process SKIP to be an operand of . He introduces an algebraic law, referred as " − SKIP resolve".…”

Section: Parallel Composition In Csp the Semantics Of Parallel Composmentioning

confidence: 99%

“…However, special treatment of successful termination is not unique to CSP. For instance, Aceto and Hennessy [2] provide a detailed treatment of termination in process algebra in general. In the following chapters, we will develop our work on CSP.…”

Section: Chapter Summarymentioning

confidence: 99%

“…There are, however, projects that study termination in similar languages such as [2]. Both LOTOS and ACP, for instance, allow sequential composition and termination and hence our results can be translated into these two calculi.…”

Section: Applicability To Other Process Algebramentioning

confidence: 99%

See 2 more Smart Citations

Towards a new extension relation for compositional test case generation for CSP concurrent processes

Chan¹,

陳榮光.²

View full text Add to dashboard Cite

Software concurrent systems such as electronic financial services are very popular today. Rigorous testing of such systems is indispensable. Nevertheless, the state-explosion problem, in which the size of a system grows exponentially with the number of concurrent components, is a severe obstacle to the generation of test cases.In this study, we propose a new relationship assuring the conformities of test cases for concurrent systems. We stipulate it in Communicating Sequential Processes (CSP), which is an excellent tool to study concurrent systems. Specification of concurrent systems is expressed as processes that are composed sequentially and concurrently. Our proposal supports both abstraction and process composition.This approach decomposes a given process into sequential compositions of component processes. Each component can be anti-extended into abstract forms. Sequential and concurrent combinations of abstract forms can substitute their corresponding extending components in a process to form aggregated abstract forms. Since the given processes, components and abstract forms are all processes, this approach can be applied recursively and compositionally. We prove that these aggregated abstract processes should be anti-extensions of the corresponding processes under a few necessary and sufficient conditions. Hence, test cases generated from these processes will be conformance test cases for the implementations.We examine three major testing relations (conformance, extension and reduction) from the point of view of their ability to support abstraction. Extension and reduction are special kinds of conformance, which are partially ordered. However, only extension from a specification can provide abstract forms that guarantee to be conformed by an implementation of the specification. Extension is further investigated to support the compositional approach. We identify five weaknesses of extension, which we call problems of preceding, succeeding, prefix, decomposition and paralleling. Each will result in non-conforming abstraction.To resolve the identified weaknesses of extension in a compositional and abstractionoriented approach, we formulate σ-extension and identify the necessary and sufficient conditions. We also discuss a restricted sub-class of process specification so that these conditions can easily be satisfied. In the restricted sub-class, successful terminations of processes are deterministic.Under these conditions, we achieve a few desirable properties. First, both preceding and succeeding components of a given sequential composition can be anti-extended. The given composition should extend the sequential composition of its corresponding anti-extended processes. Secondly, a given parallel composition whose concurrent components are sequential compositions should extend a parallel composition of anti-extensions of preceding components of corresponding sequential compositions, followed by a parallel composition of anti-extensions of corresponding succeeding components. Furthermore, a given sequential co...

show abstract

A Causal Operational Semantics of Action Refinement

Degano

Gorrieri

1995

Information and Computation

View full text Add to dashboard Cite

Termination, deadlock, and divergence

Cited by 87 publications

References 29 publications

Axiomatizing Weak Ready Simulation Semantics over BCCSP

Axiomatizing Weak Ready Simulation Semantics over BCCSP

Towards a new extension relation for compositional test case generation for CSP concurrent processes

A Causal Operational Semantics of Action Refinement

Contact Info

Product

Resources

About