Distinguishing and relating higher-order and first-order processes by expressiveness (Q1935453): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Branching bisimilarity is an equivalence indeed! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CPS encoding of name-passing in higher-order mobile embedded resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The seal calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quasi-open bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressiveness of interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Unified Approach to Encodability and Separation Results for Process Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressiveness and decidability of higher-order process calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions as processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of mobile processes. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding choice encodings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation for higher-order process calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\pi\)-calculus, internal mobility, and agent-passing calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of bisimulation for the \(\pi\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bisimulation proof method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The m-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plain CHOCS. A second generation calculus for higher order processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Bisimilarity with Explicit Divergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching time and abstraction in bisimulation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bisimulation Theory in Linear Higher-Order π-Calculus / rank
 
Normal rank

Latest revision as of 05:26, 6 July 2024

scientific article
Language Label Description Also known as
English
Distinguishing and relating higher-order and first-order processes by expressiveness
scientific article

    Statements

    Distinguishing and relating higher-order and first-order processes by expressiveness (English)
    0 references
    0 references
    15 February 2013
    0 references
    This paper compares the expressive power of higher-order and first-order process calculi. To this end, the process-passing and the name-passing paradigms are formally related. It presents the following results: -- first-order pi-calculus can faithfully express basic higher-order pi-calculus, even when enriched with a relabelling operator; -- basic higher-order pi-calculus cannot interpret first-order pi-calculus reasonably; An encoding from first-order pi-calculus to basic higher-order pi-calculus enriched with a relabelling operator is also revisited and discussed.
    0 references
    0 references
    0 references
    pi-calculus
    0 references
    higher-order processes
    0 references
    first-order processes
    0 references
    0 references