Decidability problems for actor systems

Authors:
Frank S. de Boer;Mahdi M. Jaghoori;Cosimo Laneve;Gianluigi Zavattaro
Affiliations:
CWI, Amsterdam, The Netherlands;CWI, Amsterdam, The Netherlands;University of Bologna, INRIA Focus Research Team, Bologna, Italy;University of Bologna, INRIA Focus Research Team, Bologna, Italy
Venue:
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Year:
2012

Citing 15
Cited 0

Well-structured transition systems everywhere!

Theoretical Computer Science
The Structure and Semantics of Actor Languages

Proceedings of the REX School/Workshop on Foundations of Object-Oriented Languages
General decidability theorems for infinite-state systems

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A foundation for actor computation

Journal of Functional Programming
Computation: finite and infinite machines

Computation: finite and infinite machines
Viptos: a graphical development and simulation environment for TinyOS-based wireless sensor networks

Proceedings of the 3rd international conference on Embedded networked sensor systems
Supporting reconfigurable object distribution for customized web applications

Proceedings of the 2007 ACM symposium on Applied computing
Scala Actors: Unifying thread-based and event-based programming

Theoretical Computer Science
Classes and inheritance in actor-oriented design

ACM Transactions on Embedded Computing Systems (TECS)
Actor frameworks for the JVM platform: a comparative analysis

PPPJ '09 Proceedings of the 7th International Conference on Principles and Practice of Programming in Java
Procedural embedding of knowledge in planner

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Towards context-aware web applications

DAIS'07 Proceedings of the 7th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Erlang

Communications of the ACM
Analysis of deadlocks in object groups

FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Forward analysis of depth-bounded processes

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a relevant feature: the dynamic creation of names in combination with fields gives rise to Turing completeness. On the other hand, restricting to stateless actors gives rise to systems for which properties such as termination are decidable. Such decidability result holds in actors with states when the number of actors is finite and the state is read-only.