Towards a theory of bisimulation for the higher-order process calculi

2004 ◽  
Vol 19 (3) ◽  
pp. 352-363 ◽  
Author(s):  
Yong-Jian Li ◽  
Xin-Xin Liu
Keyword(s):  
Higher Order ◽  
Order Process ◽  
Process Calculi

scholarly journals Bisimulation for Higher-Order Process Calculi

1996 ◽  
Vol 131 (2) ◽  
pp. 141-178 ◽  
Author(s):  
Davide Sangiorgi
Keyword(s):  
Higher Order ◽  
Order Process ◽  
Process Calculi

scholarly journals Recursive equations in higher-order process calculi

2001 ◽  
Vol 266 (1-2) ◽  
pp. 839-852 ◽  
Author(s):  
Mingsheng Ying ◽  
Martin Wirsing
Keyword(s):  
Higher Order ◽  
Order Process ◽  
Process Calculi ◽  
Recursive Equations

Typing and subtyping for mobile processes

1996 ◽  
Vol 6 (5) ◽  
pp. 409-453 ◽  
Author(s):  
Benjamin Pierce ◽  
Davide Sangiorgi
Keyword(s):  
Process Algebra ◽  
Operational Semantics ◽  
Type System ◽  
Higher Order ◽  
Order Process ◽  
Process Calculi ◽  
Mobile Processes

The π-calculus is a process algebra that supports mobility by focusing on the communication of channels. Milner's presentation of the π-calculus includes a type system assigning arities to channels and enforcing a corresponding discipline in their use. We extend Milner's language of types by distinguishing between the ability to read from a channel, the ability to write to a channel, and the ability both to read and to write. This refinement gives rise to a natural subtype relation similar to those studied in typed λ-calculi. The greater precision of our type discipline yields stronger versions of standard theorems on the π-calculus. These can be used, for example, to obtain the validity of β-reduction for the more efficient of Milner's encodings of the call-by-value λ-calculus, which fails in the ordinary π-calculus. We define the syntax, typing, subtyping, and operational semantics of our calculus, prove that the typing rules are sound, apply the system to Milner's λ-calculus encodings, and sketch extensions to higher-order process calculi and polymorphic typing.

scholarly journals On the expressiveness and decidability of higher-order process calculi

2011 ◽  
Vol 209 (2) ◽  
pp. 198-226 ◽  
Author(s):  
Ivan Lanese ◽  
Jorge A. Pérez ◽  
Davide Sangiorgi ◽  
Alan Schmitt
Keyword(s):  
Higher Order ◽  
Order Process ◽  
Process Calculi

Generalized Frequency Domain Robust Tuning of a Family of Fractional Order PI/PID Controllers to Handle Higher Order Process Dynamics

2011 ◽  
Vol 403-408 ◽  
pp. 4859-4866 ◽  
Author(s):  
Saptarshi Das ◽  
Amitava Gupta ◽  
Shantanu Das
Keyword(s):  
Frequency Domain ◽  
Fractional Order ◽  
Test Bench ◽  
Standard Test ◽  
Higher Order ◽  
Pid Controllers ◽  
Order Process ◽  
Controller Tuning ◽  
Process Dynamics ◽  
The Family

Generalization of the frequency domain robust tuning has been proposed in this paper for a family of fractional order (FO) PI/PID controllers. The controller tuning is enhanced with two new FO reduced parameter templates which are capable of capturing higher order process dynamics with much better accuracy. The paper validates the proposed methodology with a standard test-bench of higher order processes to show the relative merits of the family of FO controller structures.

Propositional encodings are a subset of organization theory

2009 ◽  
Vol 32 (2) ◽  
pp. 214-215
Author(s):  
George Mandler
Keyword(s):  
Associative Learning ◽  
Organization Theory ◽  
Organizational Structures ◽  
Higher Order ◽  
Past Century ◽  
Order Process ◽  
Human Associative Learning ◽  
The Past

AbstractThe notion that human associative learning is a usually conscious, higher-order process is one of the tenets of organization theory, developed over the past century. Propositional/sequential encoding is one of the possible types of organizational structures, but learning may also involve other structures.

Sign in / Sign up

Export Citation Format

Share Document