scientific article

zbMath0981.68037MaRDI QIDQ2778815

Nobuko Yoshida, Martin Berger, Kohei Honda

Publication date: 21 March 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2044/20440029

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (24)

Characteristic bisimulation for higher-order session processes ⋮ Eager functions as processes ⋮ A generic type system for the pi-calculus ⋮ Trees from Functions as Processes ⋮ Strong normalisation in the \(\pi\)-calculus ⋮ An approach to innocent strategies as graphs ⋮ A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus ⋮ A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus ⋮ Leafy automata for higher-order concurrency ⋮ Responsiveness in process calculi ⋮ Separation Logic Semantics for Communicating Processes ⋮ Preface to the special volume ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ Unnamed Item ⋮ An exact correspondence between a typed pi-calculus and polarised proof-nets ⋮ On the relative expressiveness of higher-order session processes ⋮ Asynchronous games. II: The true concurrency of innocence ⋮ Linearity and bisimulation ⋮ A Process-Model for Linear Programs ⋮ Genericity and the \(\pi\)-calculus ⋮ Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness ⋮ A Graph Abstract Machine Describing Event Structure Composition ⋮ Probabilistic π-Calculus and Event Structures ⋮ A calculus of coroutines

This page was built for publication: