Xian Xu

Learn More
We study the behavioural theory of πP, a π-calculus in the tradition of Fusions and Chi calculi. In contrast with such calculi, reduction in πP generates a preorder on names rather than an equivalence relation. We present two char-acterisations of barbed congruence in πP: the first is based on a compositional LTS, and the second is an axiomatisation. The(More)
Higher-order process calculi have been receiving much attention in recent years for its significance in both theory and practice. Work on bisimulations has never ceased evolving, typically represented by Thomsen and Sangiorgi for their work on bisimulation theory and encoding to and from first-order process calculi. Fu puts forth linear higher-order(More)
— In this paper, we integrate the traditional finite-state automata (words, or string based) into the membrane computing paradigm, as previous work prevalently concentrated on multiset based automata. We apply P systems with string objects (worms) to implement finite automata, that is, simulating their running, showing that P systems with string objects can(More)
Parameterization extends higher-order processes with the capability of abstraction (akin to that in lambda-calculus), and is known to be able to enhance the expressiveness. This paper focuses on the parameterization of names, i.e. a construct that maps a name to a process, in the higher-order setting. We provide two results concerning its computation(More)