A format for semantic equivalence comparison

DOI10.1016/S0304-3975(03)00129-4zbMath1070.68082OpenAlexW1992639690MaRDI QIDQ1884897

Vashti Galpin

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00129-4

zbMATH Keywords

Process algebraStructural operational semanticsComparison of semantic equivalences

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

SOS formats and meta-theory: 20 years after

Cites Work

• Structural operational semantics for weak bisimulations
• Transition system specifications with negative premises
• Higher-level synchronising devices in Meije-SCCS
• A calculus of mobile processes. II
• Structured operational semantics and bisimulation as a congruence
• A conservative look at operational semantics with variable binding
• Turning SOS rules into equations
• A theory of processes with localities
• GSOS and finite labelled transition systems
• Comparing locality and causality based equivalences
• Adding action refinement to a finite process algebra
• A general conservative extension theorem in process algebras with inequalities
• Architectural CCS
• Proving congruence of bisimulation in functional programming languages
• \(Ntyft/ntyxt\) rules reduce to \(n\)tree rules
• Towards action-refinement in process algebras
• CPO models for compact GSOS languages
• Bisimulation can't be traced
• The meaning of negative premises in transition system specifications
• Variable binding operators in transition system specifications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A format for semantic equivalence comparison