AttributesValues
type
value
  • The [Formula: see text]-calculus is a widely used process calculus, which models communications between processes and allows the passing of communication links. Various operational semantics of the [Formula: see text]-calculus have been proposed, which can be classified according to whether transitions are unlabelled (so-called reductions) or labelled. With labelled transitions, we can distinguish early and late semantics. The early version allows a process to receive names it already knows from the environment, while the late semantics and reduction semantics do not. All existing reversible versions of the [Formula: see text]-calculus use reduction or late semantics, despite the early semantics of the (forward-only) [Formula: see text]-calculus being more widely used than the late. We define [Formula: see text]IH, the first reversible early [Formula: see text]-calculus, and give it a denotational semantics in terms of reversible bundle event structures. The new calculus is a reversible form of the internal [Formula: see text]-calculus, which is a subset of the [Formula: see text]-calculus where every link sent by an output is private, yielding greater symmetry between inputs and outputs.
Subject
  • Telecommunications
  • Models of computation
  • Theoretical computer science
  • History of television
  • Formal methods
  • Formal specification languages
  • Logic in computer science
  • Process calculi
  • Programming language semantics
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software