The chemical abstract machine

DOI10.1016/0304-3975(92)90185-IzbMath0747.68013MaRDI QIDQ1190491

Publication date: 26 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

mobile processes algebraic process calculi chemical abstract machine concurrent \(\lambda\)-calculus concurrent computations models of concurrent computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (only showing first 100 items - show all)

Runtime verification for biochemical programs ⋮ Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets ⋮ Formal molecular biology ⋮ Catalytic P systems, semilinear sets, and vector addition systems ⋮ Computation in networks of passively mobile finite-state sensors ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway ⋮ A formal semantics for DAI language NUML ⋮ Algebra Unifies Operational Calculi ⋮ On the diversity of asynchronous communication ⋮ What is a free name in a process algebra? ⋮ On reduction-based process semantics ⋮ Modelling of DNA mismatch repair with a reversible process calculus ⋮ Encoding Asynchronous Interactions Using Open Petri Nets ⋮ Reversible Computation vs. Reversibility in Petri Nets ⋮ Deciding implication for functional dependencies in complex-value databases ⋮ Architectural CCS ⋮ On the computational complexity of membrane systems ⋮ A semantics preserving actor translation ⋮ A rewriting logic framework for operational semantics of membrane systems ⋮ The rewriting logic semantics project ⋮ SOS formats and meta-theory: 20 years after ⋮ Programs=data=first-class citizens in a computational world ⋮ Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types ⋮ Reversible computation in nets with bonds ⋮ From Rewriting Logic, to Programming Language Semantics, to Program Verification ⋮ Computing in unpredictable environments: semantics, reduction strategies, and program transformations ⋮ The rewriting logic semantics project: a progress report ⋮ Twenty years of rewriting logic ⋮ Reversibility and asymmetric conflict in event structures ⋮ Typing correspondence assertions for communication protocols ⋮ Theory of interaction ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Logical Inference by DNA Strand Algebra ⋮ Processes in space ⋮ Minimization strategies for maximally parallel multiset rewriting systems ⋮ Variations on mobile processes ⋮ Termination of just/fair computations in term rewriting ⋮ A formal library of set relations and its application to synchronous languages ⋮ COLLISION-BASED COMPUTING IN BIOPOLYMERS AND THEIR AUTOMATA MODELS ⋮ On dynamically non-trivial three-valued logics: Oscillatory and bifurcatory species ⋮ A calculus of quality for robustness against unreliable communication ⋮ A multiset semantics for the pi-calculus with replication ⋮ On the implementation of concurrent calculi in net calculi: two case studies ⋮ Pathway analysis for BioAmbients ⋮ A process algebraic view of shared dataspace coordination ⋮ An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems ⋮ The \(C_\pi\)-calculus: a model for confidential name passing ⋮ MGS ⋮ Unnamed Item ⋮ Contract signing, optimism, and advantage ⋮ Pure bigraphs: structure and dynamics ⋮ A calculus for reasoning about software composition ⋮ Name-passing in an ambient-like calculus and its proof using spatial logic ⋮ Chemistry of belief ⋮ Analysing input/output-capabilities of mobile processes with a generic type system ⋮ Interpreting a finitary pi-calculus in differential interaction nets ⋮ An excursion in reaction systems: from computer science to biology ⋮ On membrane hierarchy in P systems ⋮ An overview of the K semantic framework ⋮ Observational congruences for dynamically reconfigurable tile systems ⋮ A thread calculus with molecular dynamics ⋮ A type checking algorithm for concurrent object protocols ⋮ Approximate reasoning on a DNA‐chip ⋮ Relating state-based and process-based concurrency through linear logic (full-version) ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS ⋮ A rewriting logic approach to operational semantics ⋮ The Rewriting Logic Semantics Project: A Progress Report ⋮ Unnamed Item ⋮ REGISTER MACHINE COMPUTATIONS ON BINARY NUMBERS BY OSCILLATING AND CATALYTIC CHEMICAL REACTIONS MODELLED USING MASS-ACTION KINETICS ⋮ Reaction graph ⋮ Multisets and structural congruence of the pi-calculus with replication ⋮ Process calculus based upon evaluation to committed form ⋮ On bisimulations for the asynchronous \(\pi\)-calculus ⋮ A calculus for cryptographic protocols: The spi calculus ⋮ Mobile Petri nets ⋮ An implementation model of the typed λ-calculus based on Linear Chemical Abstract Machine ⋮ Mobile ambients ⋮ Actor languages. Their syntax, semantics, translation, and equivalence ⋮ Deriving Bisimulation Congruences: A 2-categorical Approach ⋮ Explicit fusions ⋮ Computing with membranes ⋮ Polarized process algebra with reactive composition ⋮ A guide to membrane computing. ⋮ Understanding the mismatch combinator in chi calculus ⋮ Linear concurrent constraint programming: Operational and phase semantics ⋮ Secure implementation of channel abstractions ⋮ Protocol Composition Logic (PCL) ⋮ Structuring Operational Semantics: Simplification and Computation ⋮ A Calculus of Global Interaction based on Session Types ⋮ G-Reactive Systems as Coalgebras ⋮ Active Evaluation Contexts for Reaction Semantics ⋮ An abstract machine for concurrent modular systems: CHARM ⋮ A Coalgebraic Theory of Reactive Systems ⋮ A Rewriting Logic Approach to Operational Semantics (Extended Abstract) ⋮ Dynamic connectors for concurrency ⋮ Compositional SOS and beyond: A coalgebraic view of open systems ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic ⋮ Algebraic specification of agent computation

Uses Software

UNITY

Cites Work

This page was built for publication: The chemical abstract machine