scientific article; zbMATH DE number 1759615

From MaRDI portal
Revision as of 11:04, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4536606

zbMath0999.68141MaRDI QIDQ4536606

James J. Leifer, Arthur J. Milner

Publication date: 2 December 2002


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



Related Items

Coalgebraic Symbolic Semantics, A theory of bisimulation for a fragment of concurrent ML with local names, Reactive systems, (semi-)saturated semantics and coalgebras on presheaves, Asynchronous Traces and Open Petri Nets, Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi, A presheaf environment for the explicit fusion calculus, Observational and behavioural equivalences for soft concurrent constraint programming, SMT-based generation of symbolic automata, A General Theory of Barbs, Contexts, and Labels, When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus, A Category of Explicit Fusions, Measurable stochastics for Brane calculus, Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study, Deriving structural labelled transitions for mobile ambients, Unnamed Item, Unnamed Item, Network Applications of Graph Bisimulation, Bisimulations in calculi modelling membranes, A semantic framework for open processes, On Symbolic Semantics for Name-decorated Contexts, Making the Unobservable, Unobservable, Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding), Formal Reduction for Rule-based Models, Pure bigraphs: structure and dynamics, Locating reaction with 2-categories, Observational congruences for dynamically reconfigurable tile systems, Reactive Systems, Barbed Semantics, and the Mobile Ambients, Synthesising CCS bisimulation using graph rewriting, RPO, Second-Order Contexts, and λ-Calculus, Deriving Bisimulation Congruences in the Presence of Negative Application Conditions, Kind Bigraphs, Categorical specification and implementation of replicated data types, On the algebraic structure of declarative programming languages, Deriving Bisimulation Congruences: A 2-categorical Approach, Unnamed Item, Relational presheaves, change of base and weak simulation, G-Reactive Systems as Coalgebras, Bialgebraic Methods in Structural Operational Semantics, Local Bigraphs and Confluence: Two Conjectures, Directed Bigraphs, Adhesive DPO Parallelism for Monic Matches, Bigraphs and Their Algebra, A Coalgebraic Theory of Reactive Systems, A Well-behaved LTS for the Pi-calculus