Bisimilarity of open terms.

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

Authors 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

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)

Recommendations

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

Cites Work

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

Cited In (18)

• Proving the validity of equations in GSOS languages using rule-matching bisimilarity
• A theory of stochastic systems. II: Process algebra
• Dynamic connectors for concurrency
• Robustness of equations under operational extensions
• An algebra of behavioural types
• A semantic framework for open processes
• Bisimulation by unification
• 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 no real title available?)
• SMT-based generation of symbolic automata
• Quasi-open bisimilarity with mismatch is intuitionistic
• Title not available (Why is no real title available?)
• Bisimilarity of open terms in stream GSOS

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)