Processes as terms: non-well-founded models for bisimulation

DOI10.1017/S096012950000147XzbMath0798.68094MaRDI QIDQ4279257

Jan J. M. M. Rutten

Publication date: 18 October 1994

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

transition system specificationscompositional semanticsbisimulation equivalencenon-well-founded sets

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of set theory (03E75)

Related Items (14)

Weak Bisimilarity Coalgebraically ⋮ Three metric domains of processes for bisimulation ⋮ Topological models for higher order control flow ⋮ Bisimulation as a logical relation ⋮ Processes and hyperuniverses ⋮ Trees and semantics ⋮ Nonwellfounded sets and programming language semantics ⋮ A fully abstract model for the \(\pi\)-calculus. ⋮ Generalizing finiteness conditions of labelled transition systems ⋮ A coalgebraic presentation of structured transition systems ⋮ Algebra and theory of order-deterministic pomsets ⋮ Universal coalgebra: A theory of systems ⋮ The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\) ⋮ Final semantics for a higher order concurrent language

Cites Work

• Solving reflexive domain equations in a category of complete metric spaces
• A domain equation for bisimulation
• Processes and the denotational semantics of concurrency
• Unnamed Item
• Unnamed Item

This page was built for publication: Processes as terms: non-well-founded models for bisimulation