Decidability Problems for Actor Systems

  • Frank S. de Boer
  • Mahdi M. Jaghoori
  • Cosimo Laneve
  • Gianluigi Zavattaro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7454)


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.


Wireless Sensor Network Transition System Operational Semantic Actor Language Reachability Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS, pp. 313–321. IEEE (1996)Google Scholar
  2. 2.
    Agha, G.: The Structure and Semantics of Actor Languages. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1989. LNCS, vol. 430, pp. 1–59. Springer, Heidelberg (1990)Google Scholar
  3. 3.
    Agha, G., Mason, I., Smith, S., Talcott, C.: A foundation for actor computation. Journal of Functional Programming 7, 1–72 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Armstrong, J.: Erlang. Communications of ACM 53(9), 68–75 (2010)CrossRefGoogle Scholar
  5. 5.
    Chang, P.-H., Agha, G.: Supporting reconfigurable object distribution for customized web applications. In: SAC, pp. 1286–1292 (2007)Google Scholar
  6. 6.
    Chang, P.-H., Agha, G.: Towards Context-Aware Web Applications. In: Indulska, J., Raymond, K. (eds.) DAIS 2007. LNCS, vol. 4531, pp. 239–252. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Cheong, E., Lee, E.A., Zhao, Y.: Viptos: a graphical development and simulation environment for tinyos-based wireless sensor networks. In: SenSys, pp. 302–302 (2005)Google Scholar
  8. 8.
    de Boer, F., Jaghoori, M., Laneve, C., Zavattaro, G.: Decidability Problems for Actor Systems. Technical report (2012),
  9. 9.
    de Boer, F.S., Grabe, I., Steffen, M.: Termination detection for active objects. Journal of Logic and Algebraic Programming (2012)Google Scholar
  10. 10.
    Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theoretical Computer Science 256, 63–92 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Giachino, E., Laneve, C.: Analysis of Deadlocks in Object Groups. In: Bruni, R., Dingel, J. (eds.) FMOODS/FORTE 2011. LNCS, vol. 6722, pp. 168–182. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  12. 12.
    Haller, P., Odersky, M.: Scala actors: Unifying thread-based and event-based programming. Theoretical Computer Science 410(2-3), 202–220 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Hewitt, C.: Procedural embedding of knowledge in planner. In: Proc. the 2nd International Joint Conference on Artificial Intelligence, pp. 167–184 (1971)Google Scholar
  14. 14.
    Johnsen, E.B., Owe, O.: An asynchronous communication model for distributed concurrent objects. Software and System Modeling 6(1), 39–58 (2007)CrossRefGoogle Scholar
  15. 15.
    Karmani, R.K., Shali, A., Agha, G.: Actor frameworks for the jvm platform: a comparative analysis. In: PPPJ, pp. 11–20. ACM (2009)Google Scholar
  16. 16.
    Lee, E.A., Liu, X., Neuendorffer, S.: Classes and inheritance in actor-oriented design. ACM Transactions in Embedded Computing Systems 8(4) (2009)Google Scholar
  17. 17.
    Lee, E.A., Neuendorffer, S., Wirthlin, M.J.: Actor-oriented design of embedded hardware and software systems. Journal of Circuits, Systems, and Computers 12(3), 231–260 (2003)CrossRefGoogle Scholar
  18. 18.
    Meyer, R.: On Boundedness in Depth in the pi-Calculus. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds.) IFIP TCS 2008. IFIP, vol. 273, pp. 477–489. Springer, Boston (2008)Google Scholar
  19. 19.
    Minsky, M.: Computation: finite and infinite machines. Prentice Hall (1967)Google Scholar
  20. 20.
    Wies, T., Zufferey, D., Henzinger, T.A.: Forward Analysis of Depth-Bounded Processes. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 94–108. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Frank S. de Boer
    • 1
  • Mahdi M. Jaghoori
    • 1
  • Cosimo Laneve
    • 2
  • Gianluigi Zavattaro
    • 2
  1. 1.CWIAmsterdamThe Netherlands
  2. 2.University of Bologna, INRIA Focus Research TeamBolognaItaly

Personalised recommendations