A semantic framework for open processes

DOI10.1016/j.tcs.2007.09.004zbMath1132.68042OpenAlexW1965946374WikidataQ62046303 ScholiaQ62046303MaRDI QIDQ2463561

Paolo Baldan, Roberto Bruni, Andrea Bracciali

Publication date: 14 December 2007

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.09.004

zbMATH Keywords

unificationopen systemssymbolic bisimulation

Mathematics Subject Classification ID

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

Related Items (5)

Compositional equivalences based on open pNets ⋮ Unnamed Item ⋮ A semantic framework for open processes ⋮ On Symbolic Semantics for Name-decorated Contexts ⋮ Unnamed Item

Uses Software

• SLMC
• MMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• Higher-level synchronising devices in Meije-SCCS
• Unification in abelian semigroups
• A calculus of communicating systems
• An algebraic semantics for structured transition systems and its application to logic programs
• Mobile ambients
• Locating reaction with 2-categories
• Foundations of equational logic programming
• Bisimilarity of open terms.
• A theory of bisimulation for the \(\pi\)-calculus
• A semantic framework for open processes
• A Logical Process Calculus
• Bisimulation by Unification*
• Completion of a Set of Rules Modulo a Set of Equations
• Bisimulation can't be traced
• An interactive semantics of logic programming
• Anytime, anywhere
• Foundations of Software Science and Computation Structures
• Global Computing
• Algebra and Coalgebra in Computer Science
• CONCUR 2005 – Concurrency Theory

This page was built for publication: A semantic framework for open processes