A formal model of concurrent systems based on bipartite directed acyclic graph

DOI10.1016/J.SCICO.2005.11.004zbMath1094.68065OpenAlexW2017771487MaRDI QIDQ2492233

Masaki Murakami

Publication date: 9 June 2006

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2005.11.004

zbMATH Keywords

concurrency\(\pi\)-calculusscope equivalence

Mathematics Subject Classification ID

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

Related Items (2)

The structure of 2-colored best match graphs ⋮ Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs

This page was built for publication: A formal model of concurrent systems based on bipartite directed acyclic graph