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

DOI10.1017/S096012950000147XMaRDI QIDQ4279257zbMATH OpenFDO

Authors Jan J. M. M. Rutten

Publication date 18 October 1994

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

Full work available at URL https://doi.org/10.1017/S096012950000147X

zbMATH Keywords

bisimulation equivalencecompositional semanticsnon-well-founded setstransition system specifications

Mathematics Subject Classification ID

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

Recommendations

• Nonwellfounded sets and programming language semantics
• scientific article; zbMATH DE number 4119652
• scientific article; zbMATH DE number 3898224
• Three metric domains of processes for bisimulation
• Distributed bisimulations

Cites work

• A domain equation for bisimulation
• scientific article; zbMATH DE number 42735 (Why is no real title available?)
• scientific article; zbMATH DE number 44058 (Why is no real title available?)
• Processes and the denotational semantics of concurrency
• Solving reflexive domain equations in a category of complete metric spaces

Cited in

(19)

• The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
• Trees and semantics
• A fully abstract model for the \(\pi\)-calculus.
• Universal coalgebra: A theory of systems
• Algebra and theory of order-deterministic pomsets
• Computable processes and bisimulation equivalence
• Weak bisimilarity coalgebraically
• A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
• Generalizing finiteness conditions of labelled transition systems
• scientific article; zbMATH DE number 4119652 (Why is no real title available?)
• scientific article; zbMATH DE number 749805 (Why is no real title available?)
• Convenient category of processes and simulations I: Modulo strong bisimilarity
• Bisimulation as a logical relation
• Processes and hyperuniverses
• Final semantics for a higher order concurrent language
• Three metric domains of processes for bisimulation
• Topological models for higher order control flow
• A coalgebraic presentation of structured transition systems
• Nonwellfounded sets and programming language semantics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4279257)