Bisimilarity of open terms.

DOI10.1006/inco.1999.2818zbMath1046.68626MaRDI QIDQ1854331

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

zbMATH Keywords

bisimulation; recursion congruence

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

A basic algebra of stateless connectors, Dynamic connectors for concurrency, Comparing logics for rewriting: Rewriting logic, action calculi and tile logic, Observational congruences for dynamically reconfigurable tile systems, Vertical implementation, Notions of bisimulation and congruence formats for SOS with data, A theory of stochastic systems. II: Process algebra

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural operational semantics for weak bisimulations
• Symbolic bisimulations
• Bisimulation for higher-order process calculi
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A complete inference system for a class of regular behaviours
• Higher-level synchronising devices in Meije-SCCS
• Conditional rewriting logic as a unified model of concurrency
• A calculus of mobile processes. II
• Structured operational semantics and bisimulation as a congruence
• 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
• A theory of higher order communicating systems
• Proving congruence of bisimulation in functional programming languages
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• A domain equation for bisimulation
• A Theory of Communicating Sequential Processes
• Compositionality Through an Operational Semantics of Contexts
• Process Algebra
• Termination, deadlock, and divergence
• Bisimulation can't be traced
• Barbed bisimulation