On the Expressiveness of Parameterization in Process-Passing

@inproceedings{Xu2013OnTE,
  title={On the Expressiveness of Parameterization in Process-Passing},
  author={Xian Xu and Qiang Yin and Huan Long},
  booktitle={Web Services and Formal Methods},
  year={2013}
}
This paper studies higher-order processes with the capability of parameterization (or abstraction), which has been proven to be an effective measure of lifting the mere process-passing in expressiveness. We contribute to the understanding of two kinds of parameterization: name-parameterization and process-parameterization, particularly in a second-order setting (no currying of parameterization). Firstly, we show that in the expressiveness hierarchy of process-parameterization, n-ary… 

On the Computation Power of Name Parameterization in Higher-order Processes

This paper compares name parameterization with the well-known pi-calculus, and provides two encodings between them, and offers two results concerning its computation capacity.

On the Interactive Power of Higher-order Processes Extended with Parameterization

This paper investigates the interactive power of the higher-order pi-calculus extended with parameterization. We study two kinds of parameterization: name parameterization and process

On the Relative Expressiveness of Higher-Order Session Processes

It is shown that HO can encode typed contextual equivalence more precisely and efficiently than the first-order sessionπ-calculus, the higher-orderculus in which communications are governed by session types.

References

SHOWING 1-10 OF 39 REFERENCES

On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi

This work studies the expressiveness of strictly higher-order process calculi, and focuses on two issues well-understood for first-order calculi but not in the higher- order setting: synchronous vs. asynchronous communication and polyadic vs. monadic communication.

On Context Bisimulation for Parameterized Higher-order Processes

It is shown that the extension of higher-order processes with process parameterization retains the characterization of context bisimulation by a much simpler form of bisimulating called normal bisimulations, in which universal quantifiers are eliminated; whereas it is not the same with name parameterization.

On the Expressiveness and Decidability of Higher-Order Process Calculi

Distinguishing and relating higher-order and first-order processes by expressiveness

  • Xian Xu
  • Materials Science
    Acta Informatica
  • 2012
This is a paper on distinguishing and relating two important kinds of calculi through expressiveness, settling some critical but long unanswered questions. The delimitation of higher-order and

Towards a unified approach to encodability and separation results for process calculi

  • D. Gorla
  • Computer Science
    Inf. Comput.
  • 2010

Expressing mobility in process algebras : first-order and higher-order paradigms

This thesis proposes barbed bisimulation, and exploits a special kind of agents called triggers, with which it is possible to reason fairly efficiently in a higher-order calculus notwithstanding the complexity of its transitions, and derives an w-order extension called Higher-Order ur-calculus (HOir).

Bisimulation for Higher-Order Process Calculi

A new form of bisimulation is proposed for higher-order process calculus, called context bisimulations, which yields a more satisfactory discriminanting power and is played by the factorisation theorem.

On Bisimulation Theory in Linear Higher-Order pi-Calculus

  • Xian Xu
  • Computer Science, Mathematics
    Trans. Petri Nets Other Model. Concurr.
  • 2009
This paper establishes new results on bisimulation theory in linear higher-order π-calculus by exploiting the properties of linearHigher-order process calculi to work out two simpler variants than local bisimulations, which is an intuitive observational equivalence.

TAPSOFT'93: Theory and Practice of Software Development

On relating some models for concurrency and asymptotic probabilities in logics that capture DSPACE in presence of ordering.