F. Bonchi
D. Petrisan
D. Pous
J. Rot
2015
Lax Bialgebras and Up-To Techniques for Weak Bisimulations
Proceedings of the 26th International Conference on Concurrency Theory (CONCUR 2015)
Leibniz International Proceedings in Informatics (LIPICS)
42
240–253
10.4230/LIPIcs.CONCUR.2015.240
M. Bundgaard
T. Hildebrandt
J. C. Godskesen
2006
A CPS Encoding of Name-passing in Higher-order Mobile Embedded Resources
Theoretical Computer Science
356(3)
422–439
10.1016/j.tcs.2006.02.006
U. H. Engberg
M. Nielsen
1986
A Calculus of Communicating Systems with Label Passing
Technical Report
DAIMI PB-208
Computer Science Department, University of Aarhus
http://www.daimi.au.dk/PB/208/
U. H. Engberg
M. Nielsen
2000
A Calculus of Communicating Systems with Label Passing - Ten Years After
Proof, Language, and Interaction: Essays in Honour of Robin Milner
MIT Press Cambridge
599–622
Yuxi Fu
2005
On Quasi Open Bisimulation
Theoretical Computer Science
338(1-3)
96–126
10.1016/j.tcs.2004.10.041
Yuxi Fu
2015
Theory of interaction
Theoretical Computer Science
10.1016/j.tcs.2015.07.043
Yuxi Fu
Hao Lu
2010
On the Expressiveness of Interaction
Theoretical Computer Science
411
1387–1451
10.1016/j.tcs.2009.11.011
D. Gorla
2008
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
Proceedings of the 19th International Conference on Concurrency Theory (CONCUR 2008)
LNCS
5201
Springer Verlag
492–507
10.1007/978-3-540-85361-9_38
D. Gorla
U. Nestmann
2016
Full Abstraction for Expressiveness: History, Myths and Facts
Mathematical Structures in Computer Scinece
26
639–654
10.1017/S0960129514000279
Daniele Gorla
2009
On the Relative Expressive Power of Calculi for Mobility
Electronic Notes in Theoretical Computer Science
249
269–286
10.1016/j.entcs.2009.07.094
D. Kouzapas
J. A. Pérez
Nobuko Yoshida
2016
On the Relative Expressiveness of Higher-Order Session Processes
Proceedings of the 25th European Symposium on Programming (ESOP 2016)
LNCS
446–475
10.1007/978-3-662-49498-1_18
I. Lanese
J. A. Pérez
D. Sangiorgi
A. Schmitt
2010
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2010)
LNCS
Springer Verlag
442–453
10.1007/978-3-642-14162-1_37
I. Lanese
J.A. Pérez
D. Sangiorgi
A. Schmitt
2008
On the Expressiveness and Decidability of Higher-Order Process Calculi
Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008)
IEEE Computer Society
145–155
10.1109/LICS.2008.8
Journal version in LPSS10a
S. Lenglet
A. Schmitt
J.-B. Stefani
2009
Normal Bisimulations in Calculi with Passivation
Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS 2009)
LNCS
5504
Springer Verlag
257–271
10.1007/978-3-642-00596-1_19
S. Lenglet
A. Schmitt
J.-B. Stefani
2011
Characterizing Contextual Equivalence in Calculi with Passivation
Information and Computation
209
1390–1433
10.1016/j.ic.2011.08.002
R. Milner
1989
Communication and Concurrency
Prentice Hall
R. Milner
J. Parrow
D. Walker
1992
A Calculus of Mobile Processes (Parts I and II)
Information and Computation
100(1)
1–77
10.1016/0890-5401(92)90008-4, 10.1016/0890-5401(92)90009-5
J. Parrow
2016
General Conditions for Full Abstraction
Mathematical Structures in Computer Science
26
655–657
10.1017/s0960129514000280
D. Sangiorgi
1992
Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms
Phd thesis
University of Edinburgh
D. Sangiorgi
1996
Bisimulation for Higher-order Process Calculi
Information and Computation
131(2)
141–178
10.1006/inco.1996.0096
D. Sangiorgi
1998
On the Bisimulation Proof Method
Mathematical Structures in Computer Science
8(6)
447–479
10.1017/S0960129598002527
D. Sangiorgi
D. Walker
2001
The Pi-calculus: a Theory of Mobile Processes
Cambridge Universtity Press
B. Thomsen
1990
Calculi for Higher Order Communicating Systems
Phd thesis
Department of Computing, Imperial College
B. Thomsen
1993
Plain CHOCS, a Second Generation Calculus for Higher-Order Processes
Acta Informatica
30(1)
1–59
10.1007/BF01200262
Xian Xu
2012
Distinguishing and Relating Higher-order and First-order Processes by Expressiveness
Acta Informatica
49(7-8)
445–484
10.1007/s00236-012-0168-9
Xian Xu
2013
On Context Bisimulation for Parameterized Higher-order Processes
Proceedings of the 6th Interaction and Concurrency Experience (ICE 2013)
EPTCS
131
37–51
10.4204/EPTCS.131.5
Xian Xu
2016
Higher-order Processes with Parameterization over Names and Processes (with appendices)
http://basics.sjtu.edu.cn/~xuxian/express2016withappendices.pdf
Xian Xu
Qiang Yin
Huan Long
2015
On the Computation Power of Name Parameterization in Higher-order Processes
Proceedings of 8th Interaction and Concurrency Experience (ICE 2015)
EPTCS
189
114–127
10.4204/EPTCS.189.10