Bisimilarity of open terms.

DOI10.1006/INCO.1999.2818zbMATH Open1046.68626OpenAlexW2129317147MaRDI QIDQ1854331FDOQ1854331

Arend Rensink

Publication date: 14 January 2003

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

Full work available at URL: https://research.utwente.nl/en/publications/bisimilarity-of-open-terms(f042194d-cebd-458a-a368-b457d978d6d0).html

Recommendations

• scientific article; zbMATH DE number 1231603
• scientific article; zbMATH DE number 1759616
• Open bisimulation, revisited
• Bisimulation by unification
• Open bisimulation, revisited

zbMATH Keywords

bisimulationrecursion congruence

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Higher-level synchronising devices in Meije-SCCS
• Structured operational semantics and bisimulation as a congruence
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bisimulation can't be traced
• Structural operational semantics for weak bisimulations
• Bisimulation for higher-order process calculi
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A calculus of mobile processes. II
• Proving congruence of bisimulation in functional programming languages
• Title not available (Why is that?)
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• A domain equation for bisimulation
• Termination, deadlock, and divergence
• A Theory of Communicating Sequential Processes
• Process Algebra
• Barbed bisimulation
• A complete inference system for a class of regular behaviours
• Conditional rewriting logic as a unified model of concurrency
• A theory of higher order communicating systems
• Compositionality Through an Operational Semantics of Contexts
• Symbolic bisimulations
• CONCUR '92. 3rd international conference on concurrency theory. Stony Brook, NY, USA, August 24--27, 1992. Proceedings
• A conservative look at operational semantics with variable binding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• Proving the validity of equations in GSOS languages using rule-matching bisimilarity
• A theory of stochastic systems. II: Process algebra
• Dynamic connectors for concurrency
• An algebra of behavioural types
• A semantic framework for open processes
• Vertical implementation
• Splitting bisimulations and retrospective conditions
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• A basic algebra of stateless connectors
• Observational congruences for dynamically reconfigurable tile systems
• Notions of bisimulation and congruence formats for SOS with data
• Title not available (Why is that?)
• SMT-based generation of symbolic automata
• Title not available (Why is that?)

Uses Software

• LOTOS

This page was built for publication: Bisimilarity of open terms.

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