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

DOI10.1016/J.SCICO.2005.11.004MaRDI QIDQ2492233zbMATH OpenOpenAlexFDO

Authors 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

\(\pi\)-calculusconcurrencyscope equivalence

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 967185
• Formal verification of concurrent systems via directed model checking
• scientific article; zbMATH DE number 1185853
• Formal Specification of Concurrent Systems: A Structured Approach
• scientific article; zbMATH DE number 749804
• Algebraic structures of directed acyclic graphs: application to concurrent calculus
• An action-based formal model for concurrent real-time systems
• scientific article; zbMATH DE number 4119606
• Theoretical Aspects of Computing - ICTAC 2004

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492233)