scientific article
From MaRDI portal
Publication:2734510
zbMath0981.68116MaRDI QIDQ2734510
No author found.
Publication date: 15 August 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (only showing first 100 items - show all)
Applied Choreographies ⋮ A Calculus for Modeling Floating Authorizations ⋮ Mixed Sessions ⋮ A categorical framework for congruence of applicative bisimilarity in higher-order languages ⋮ Trees from Functions as Processes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Complete Lattices and Up-To Techniques ⋮ CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ Process calculi for biological processes ⋮ Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) ⋮ Parameterizing higher-order processes on names and processes ⋮ On Beta-Binders Communications ⋮ A model of actors and grey failures ⋮ Replications in reversible concurrent calculi ⋮ Variable binding and substitution for (nameless) dummies ⋮ Branching pomsets: design, expressiveness and applications to choreographies ⋮ The correctness of concurrencies in (reversible) concurrent calculi ⋮ A predicate transformer for choreographies. Computing preconditions in choreographic programming ⋮ Comparing the expressiveness of the \(\pi \)-calculus and CCS ⋮ On-the-fly bisimilarity checking for fresh-register automata ⋮ Variable binding and substitution for (nameless) dummies ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Recursion, Replication and Scope Mechanisms in Process Calculi ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Observing Success in the Pi-Calculus ⋮ Structural Rewriting in the pi-Calculus. ⋮ Bounded polymorphism in session types ⋮ Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol ⋮ Towards a Unified Approach to Encodability and Separation Results for Process Calculi ⋮ A Translation of Beta-binders in a Prioritized Pi-calculus ⋮ Explicit Identifiers and Contexts in Reversible Concurrent Calculus ⋮ Counting the Cost in the Picalculus (Extended Abstract) ⋮ Relating State-Based and Process-Based Concurrency through Linear Logic ⋮ Decidable Fragments of a Higher Order Calculus with Locations ⋮ A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus ⋮ A Resource Analysis of the π-calculus ⋮ Formal Semantics of a Dynamic Epistemic Logic for Describing Knowledge Properties of π-Calculus Processes ⋮ Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks ⋮ Pict Correctness Revisited ⋮ Security Types for Dynamic Web Data ⋮ Proof-relevant π-calculus: a constructive account of concurrency and causality ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Normal Bisimulations in Calculi with Passivation ⋮ Types for ambient and process mobility ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Equations, Contractions, and Unique Solutions ⋮ Unnamed Item ⋮ Partial Orders, Event Structures and Linear Strategies ⋮ On parameterization of higher-order processes ⋮ A Process-Model for Linear Programs ⋮ A Practical Approach to Verification of Mobile Systems Using Net Unfoldings ⋮ Coverability Synthesis in Parametric Petri Nets ⋮ Unnamed Item ⋮ Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures ⋮ Bisimulation and Co-induction: Some Problems ⋮ The origins of structural operational semantics ⋮ On the expressive power of movement and restriction in pure mobile ambients ⋮ An exercise in structural congruence ⋮ Dynamic role authorization in multiparty conversations ⋮ On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Multiparty session types, beyond duality ⋮ Structural congruence for bialgebraic semantics ⋮ Type checking a multithreaded functional language with session types ⋮ Name-passing calculi: from fusions to preorders and types ⋮ Differential interaction nets ⋮ A pi-calculus based semantics for WS-BPEL ⋮ Behavioural equivalences of a probabilistic pi-calculus ⋮ Axiomatizations for probabilistic finite-state behaviors ⋮ Adding recursion to Dpi ⋮ SOS formats and meta-theory: 20 years after ⋮ Fair ambients ⋮ Using bigraphs to model topological graphs embedded in orientable surfaces ⋮ An efficient abstract machine for safe ambients ⋮ Virtually timed ambients: a calculus of nested virtualization ⋮ A bisimulation-like proof method for contextual properties in untyped \(\lambda \)-calculus with references and deallocation ⋮ Conversation types ⋮ A behavioural theory for a \(\pi\)-calculus with preorders ⋮ A coalgebraic semantics for causality in Petri nets ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ Theory of interaction ⋮ A fully abstract model for the \(\pi\)-calculus. ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus ⋮ Exploring probabilistic bisimulations. I ⋮ Typed context awareness ambient calculus for pervasive applications ⋮ Choreographies, logically ⋮ Value-passing CCS with noisy channels ⋮ Distinguishing between communicating transactions ⋮ A semantic theory of the Internet of things
This page was built for publication:
