Stably computable properties of network graphs

Lecture Notes in Computer Science

Volumn 3560, Issue , 2005, Pages 63-74

  Angluin, Dana ^a   Aspnes, James ^a   Chan, Melody ^a   Fischer, Michael J ^a   Jiang, Hong ^a   Peralta, René ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; FUNCTIONS; SET THEORY;

AD-HOC COMMUNICATION NETWORKS; NETWORK GRAPH; WEAKLY CONNECTED NETWORKS;

GRAPH THEORY;

EID: 26444540789     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11502593_8     Document Type: Conference Paper

References (22)

1. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, ACM Press (2004) 290-299
2. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Technical Report YALEU/DCS/TR-1280, Yale University Department of Computer Science (2003)
3. Diamadi, Z., Fischer, M.J.: A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences 6 (2001) 72-82
4. Also appears as Yale Technical Report TR-1207, January 2001, available at URL ftp://ftp.cs.yale.edu/pub/TR/tr1207.ps.
5. Bernardinello, L., Cindio, F.D.: A survey of basic net models and modular net classes. In Rozenberg, G., ed.: Advances in Petri Nets: The DEMON Project. Volume 609 of Lecture Notes in Computer Science, Springer-Verlag (1992) 304-351
6. Esparza, J., Nielsen, M.: Decibility issues for Petri nets - a survey. Journal of Informatik Processing and Cybernetics 30 (1994) 143-160
7. Esparza, J.: Decidability and complexity of Petri net problems-an introduction. In Rozenberg, G., Reisig, W., eds.: Lectures on Petri Nets I: Basic models. Springer Verlag (1998) 374-428 Published as LNCS 1491.
8. Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13 (1984) 441-460
9. Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics 16 (1966) 285-296
10. Hopcroft, J., Pansiot, J.: On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science 8 (1978) 135-159
11. Berry, G., Boudol, G.: The Chemical Abstract Machine. Theoretical Computer Science 96 (1992) 217-248
12. Ibarra, O.H., Dang, Z., Egecioglu, O.: Catalytic p systems, semilinear sets, and vector addition systems. Theor. Comput. Sci. 312 (2004) 379-399
13. Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM 30 (1983) 323-342
14. Milner, R.: Bigraphical reactive systems: basic theory. Technical report, University of Cambridge (2001) UCAM-CL-TR-523.
15. Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proceedings of the 6th Annual International Conference on Mobile computing and networking, ACM Press (2000) 56-67
16. Madden, S.R., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a Tiny AGgregation service for ad-hoc sensor networks. In OSDI 2002: Fifth Symposium on Operating Systems Design and Implementation (December, 2002)
17. Fang, Q., Zhao, F., Guibas, L.: Lightweight sensing and communication protocols for target enumeration and aggregation. In: Proceedings of the 4th ACM International Symposium on Mobile ad hoc networking & computing, ACM Press (2003) 165-176
18. Zhao, F., Liu, J., Liu, J., Guibas, L., Reich, J.: Collaborative signal and information processing: An information directed approach. Proceedings of the IEEE 91 (2003) 1199-1209
19. Grossglauser, M., Tse, D.N.C.: Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Transactions on Networking 10 (2002) 477-486
20. Kahn, J.M., Katz, R.H., Pister, K.S.J.: Next century challenges: mobile networking for "Smart Dust". In: MobiCom '99: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, ACM Press (1999) 271-278
21. Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Smart dust protocols for local detection and propagation. In: POMC '02: Proceedings of the second ACM international workshop on Principles of mobile computing, ACM Press (2002) 9-16
22. Itkis, G., Levin, L.A.: Fast and lean self-stabilizing asynchronous protocols. In: Proceeding of 35th Annual Symposium on Foundations of Computer Science, IEEE Press (1994) 226-239