On the expressive power of \textsc{Klaim}-based calculi

DOI10.1016/j.tcs.2006.02.007zbMath1092.68070DBLPjournals/tcs/NicolaGP06OpenAlexW2118010897WikidataQ57650840 ScholiaQ57650840MaRDI QIDQ2491638

Rocco De Nicola, Rosario Pugliese, Daniele Gorla

Publication date: 29 May 2006

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

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

zbMATH Keywords

bisimulationbehavioural equivalencesexpressivenessprocess calculilanguage encodingsnetwork-aware programming

Mathematics Subject Classification ID

Theory of programming languages (68N15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (10)

Network Conscious π-calculus: A Concurrent Semantics ⋮ Basic observables for a calculus for global computing ⋮ Observational and behavioural equivalences for soft concurrent constraint programming ⋮ Expressiveness of concurrent intensionality ⋮ A taxonomy of process calculi for distribution and mobility ⋮ Separation of synchronous and asynchronous communication via testing ⋮ A network-conscious \(\pi\)-calculus and its coalgebraic semantics ⋮ Comparing communication primitives via their relative expressive power ⋮ On the Relative Expressive Power of Calculi for Mobility ⋮ Synchrony vs Asynchrony in Communication Primitives

Uses Software

• Klava
• KLAIM
• Linda
• tKlaim

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation for higher-order process calculi
• A calculus of mobile processes. II
• On the expressiveness of internal mobility in name-passing calculi
• On bisimulations for the asynchronous \(\pi\)-calculus
• Comparing three semantics for Linda-like languages
• Mobile ambients
• On the expressiveness of Linda coordination primitives.
• What is a ``good encoding of guarded choice?
• Decoding choice encodings
• Resource access control in systems of mobile agents
• Klava: a Java package for distributed and mobile applications
• Pattern Matching over a Dynamic Network of Tuple Spaces
• Generative communication in Linda
• Automata, Languages and Programming

This page was built for publication: On the expressive power of \textsc{Klaim}-based calculi