A domain equation for bisimulation

DOI10.1006/inco.1991.9999zbMath0718.68057OpenAlexW1978375202WikidataQ57006930 ScholiaQ57006930MaRDI QIDQ2639646

Publication date: 1991

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8d87e7ec7dc9c65f12b6307607f39d4cf484de18

zbMATH Keywords

denotational semantics synchronization trees concurrency transition systems domain equation domain logic

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Adding recursive constructs to bialgebraic semantics ⋮ Weak Bisimilarity Coalgebraically ⋮ Relating Coalgebraic Notions of Bisimulation ⋮ A structural co-induction theorem ⋮ Three metric domains of processes for bisimulation ⋮ A characterization of finitary bisimulation ⋮ MODELLING AND ANALYSIS OF PKI-BASED SYSTEMS USING PROCESS CALCULI ⋮ Ready to preorder: an algebraic and general proof ⋮ Processes as terms: non-well-founded models for bisimulation ⋮ A logical approach to stable domains ⋮ Stone duality and representation of stable domain ⋮ A unified rule format for bounded nondeterminism in SOS with terms as labels ⋮ The connection between initial and unique solutions of domain equations in the partial order and metric approach ⋮ Duality for modal \(\mu\)-logics ⋮ A fixpoint approach to finite delay and fairness ⋮ Unnamed Item ⋮ Reasoning about higher-order processes ⋮ CPO models for a class of GSOS languages ⋮ Processes and hyperuniverses ⋮ Trees and semantics ⋮ A semantic theory for value-passing processes based on the late approach ⋮ Approximating labelled Markov processes ⋮ On relating concurrency and nondeterminism ⋮ A fully abstract model for the \(\pi\)-calculus. ⋮ Distinguishing between communicating transactions ⋮ Localic sup-lattices and tropological systems. ⋮ An irregular filter model ⋮ Bialgebraic Semantics and Recursion ⋮ Continuous Domain Theory in Logical Form ⋮ A static analysis of cryptographic processes: the denotational approach ⋮ Lifting non-finite axiomatizability results to extensions of process algebras ⋮ Stone coalgebras ⋮ The equational theory of prebisimilarity over basic CCS with divergence ⋮ A fully abstract denotational model for observational precongruence ⋮ Quantales, finite observations and strong bisimulation ⋮ A fully abstract denotational semantics for the calculus of higher-order communicating systems ⋮ Combining effects: sum and tensor ⋮ Connection between logical and algebraic approaches to concurrent systems ⋮ Explicit substitutions for \(\pi\)-congruences ⋮ Full abstractness for a functional/concurrent language with higher-order value-passing ⋮ Domain mu-calculus ⋮ A case study in programming coinductive proofs: Howe’s method ⋮ A general theory of action languages ⋮ Towards a unified view of bisimulation: A comparative study ⋮ Quantitative semantics, topology, and possibility measures ⋮ Topology, domain theory and theoretical computer science ⋮ Universal coalgebra: A theory of systems ⋮ A category of compositional domain-models for separable Stone spaces. ⋮ Toward an infinitary logic of domains: Abramsky logic for transition systems ⋮ Bisimilarity of open terms. ⋮ Corrigendum: ``A domain equation for bisimulation by S. Abramsky ⋮ Labelled Markov Processes as Generalised Stochastic Relations ⋮ Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic ⋮ A co-induction principle for recursively defined domains ⋮ A fully abstract denotational semantics for the \(\pi\)-calculus ⋮ Plain CHOCS. A second generation calculus for higher order processes

Cites Work