Decidability problems for actor systems

DOI10.2168/LMCS-10(4:5)2014zbMATH1448.68337OpenAlexW2408739263MaRDI QIDQ5892063FDOQ5892063

Authors Mahdi M. Jaghoori, Gianluigi Zavattaro, Frank S. de Boer, Cosimo Laneve

Publication date 15 January 2015

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/lmcs-10(4:5)2014

zbMATH Keywords

well-structured transition systemsactorsembedding relationdecidability problems2-counter machinesrestful services

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Decidability problems for actor systems
• A foundation for actor computation
• Undecidability results for deterministic communicating sequential processes
• Actor languages. Their syntax, semantics, translation, and equivalence
• On the decidability of fragments of the asynchronous \(\pi\)-calculus

Cited in

(2)

• Decidability problems for actor systems
• Proof-theoretic foundations for the design of actor systems

Describes a project that uses

Uses Software

• Rebeca
• Viptos

This page was built for publication: Decidability problems for actor systems

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