scholarly journals Causality in Higher Order Process Theories

2021 ◽  
Vol 343 ◽  
pp. 265-300
Author(s):  
Matt Wilson ◽  
Giulio Chiribella
Keyword(s):  
Higher Order ◽  
Order Process ◽  
Process Theories

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.

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

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.

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

scholarly journals HOPLA--A Higher-Order Process Language

2002 ◽  
Vol 9 (49) ◽  
Author(s):  
Mikkel Nygaard ◽  
Glynn Winskel
Keyword(s):  
Operational Semantics ◽  
Lambda Calculus ◽  
Expressive Power ◽  
Higher Order ◽  
Domain Theory ◽  
Order Process ◽  
Encode Process ◽  
Mobile Ambients ◽  
Computation Path ◽  
Congruence Properties

A small but powerful language for higher-order nondeterministic processes is introduced. Its roots in a linear domain theory for concurrency are sketched though for the most part it lends itself to a more operational account. The language can be viewed as an extension of the lambda calculus with a ``prefixed sum'', in which types express the form of computation path of which a process is capable. Its operational semantics, bisimulation, congruence properties and expressive power are explored; in particular, it is shown how it can directly encode process languages such as CCS, CCS with process passing, and mobile ambients with public names.

scholarly journals The Multi-round Process Matrix

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 384
Author(s):  
Timothée Hoffreumon ◽  
Ognyan Oreshkov
Keyword(s):  
Information Exchange ◽  
Higher Order ◽  
Side Channel ◽  
Order Process ◽  
Causal Order ◽  
Quantum Operations ◽  
First Case ◽  
The One

We develop an extension of the process matrix (PM) framework for correlations between quantum operations with no causal order that allows multiple rounds of information exchange for each party compatibly with the assumption of well-defined causal order of events locally. We characterise the higher-order process describing such correlations, which we name the multi-round process matrix (MPM), and formulate a notion of causal nonseparability for it that extends the one for standard PMs. We show that in the multi-round case there are novel manifestations of causal nonseparability that are not captured by a naive application of the standard PM formalism: we exhibit an instance of an operator that is both a valid PM and a valid MPM, but is causally separable in the first case and can violate causal inequalities in the second case due to the possibility of using a side channel.

scholarly journals New-HOPLA--A Higher-Order Process Language with Name Generation

2004 ◽  
Vol 11 (21) ◽  
Author(s):  
Glynn Winskel ◽  
Francesco Zappa Nardelli
Keyword(s):  
Operational Semantics ◽  
Expressive Power ◽  
Higher Order ◽  
Domain Theory ◽  
Process Algebras ◽  
Order Process ◽  
Pi Calculus ◽  
Mobile Ambients ◽  
Congruence Properties

This paper introduces new-HOPLA, a concise but powerful language for higher-order nondeterministic processes with name generation. Its origins as a metalanguage for domain theory are sketched but for the most part the paper concentrates on its operational semantics. The language is typed, the type of a process describing the shape of the computation paths it can perform. Its transition semantics, bisimulation, congruence properties and expressive power are explored. Encodings are given of well-known process algebras, including pi-calculus, Higher-Order pi-calculus and Mobile Ambients.

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.

Sign in / Sign up

Export Citation Format

Share Document