Pattern matching over a dynamic network of tuple spaces

DOI10.1007/11494881_1MaRDI QIDQ4989022zbMATH OpenOpenAlexFDO

Authors Rocco De Nicola, Daniele Gorla, Rosario Pugliese

Publication date 20 May 2021

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11494881_1

Mathematics Subject Classification ID

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

Recommendations

• Global computing in a dynamic network of tuple spaces
• The Klaim project: Theory and practice
• On the expressive power of \textsc{Klaim}-based calculi
• scientific article; zbMATH DE number 2038704
• On the expressive power of \textsc{Klaim}-based calculi

Cited in

(6)

• Comparing communication primitives via their relative expressive power
• Replacement freeness: a criterion for separating process calculi
• On the expressive power of \textsc{Klaim}-based calculi
• From tuple spaces to tuple centres
• Revealing the trajectories of KLAIM tuples, statically
• Global computing in a dynamic network of tuple spaces

This page was built for publication: Pattern matching over a dynamic network of tuple spaces

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