An approach to understanding policy based on autonomy and voluntary cooperation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3775 LNCS, Issue , 2005, Pages 97-108

  Burgess, Mark ^a  

^a OSLO METROPOLITAN UNIVERSITY   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS AGENTS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION MANAGEMENT; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PUBLIC POLICY; COMPUTERS;

GLOBAL AUTHORITY; MANAGEMENT ABSTRACTIONS; POLITICAL AUTONOMY; VOLUNTARY COOPERATION;

ADAPTIVE SYSTEMS; ARTIFICIAL INTELLIGENCE;

AUTONOMOUS NETWORKS; DISTRIBUTED EFFECTS; POLICY BASED MANAGEMENT; POLICY CONFLICT; POLICY-BASED; SATISFACTORY MODELING; VOLUNTARY COOPERATION;

EID: 33646735764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11568285_9     Document Type: Conference Paper

References (29)

1. M.S. Sloman and J. Moffet. Policy hierarchies for distributed systems management. Journal of Network and System Management., 11(9):1404, 1993.
2. E.C. Lupu and M. Sloman. Towards a role based framework for distributed systems management. Journal of Network and Systems Management, 5, 1996.
3. J. Parrow. An Introduction to the π-Calculus, in The Handbook of Process Algebra., page 479. Elsevier, Amsterdam, 2001.
4. Z. Fu and S.F. Wu, Automatic generation of ipsec/vpn security policies in an intradomain environment, Proceedings of the 12th internation workshop on Distributed System Operation and Management (IFIP/IBEE)., INRIA Press:279, 2001.
5. R. Sailer, A. Acharya, M. Beigi, R. Jennings, and D. Verma. Ipsecvalidate - a tool to validate ipsec configurations. Proceedings of the Fifteenth Systems Administration Conference (LISA XV) (USENIX Association: Berkeley, CA), page 19, 2001.
6. N. Damianou, N. Dulay, E.G. Lupu, and M. Sloman. Ponder: a language for specifying security and management policies for distributed systems, Imperial College Research Report DoC 2000/1, 2000.
7. M. Burgess. On the theory of system administration. Science of Computer Programming, 49:1, 2003.
8. A. Couch and N. Daniels. The maelstrom: Network service debugging via "ineffective procedures", Proceedings of the Fifteenth Systems Administration Conference (LISA XV) (USENIX Association: Berkeley, CA), page 63, 2001.
9. M. Burgess. Cfengine's immunity model of evolving configuration management. Science of Computer Programming, 51:197, 2004.
10. M. Burgess, A site configuration engine. Computing systems (MIT Press; Cambridge MA), 8:309, 1995.
11. R. Axelrod, The Complexity of Cooperation: Agent-based Models of Competition and Collaboration, Princeton Studios in Complexity, Princeton, 1997.
12. R. Axelrod. The Evolution of Co-operation. Penguin Books, 1990 (1984).
13. J.D. Carrillo and M. Dewatripont. Promises, promises. Technical Report 172782000000000058, UCLA Department of Economics, Levines's Bibliography.
14. L. Snyder. Formal models of capability-based protection systems. IEEE Transactions on Computers, 30:172, 1981.
15. M. Burgess. Analytical Network and System Administration - Managing Human-Computer Systems. J. Wiley & Sons, Chichester, 2004.
16. Tuva Hassel Stang, Fahimeh Pourbayat, Mark Burgess, Geoffrey Canright, Kenth Engø, and Åsmund Weltzien. Archipelago: A network security analysis tool. In Proceedings of The 17th Annual Large Installation Systems Administration Conference (LISA 2003), San Diego, California, USA, October 2003.
17. G. Canright and K. Engø-Monsen. A natural definition of clusters and roles in undirected graphs. Science of Computer Programming, 53:195, 2004.
18. M. Burgess, G. Canright, and K. Engø. A graph theoretical model of computer security: from file access to social engineering. International Journal of Information Security, 3:70-85, 2004.
19. R. Ortalo. A flexible method for information system security policy specifications, Lecture Notes on Computer Science, 1485:67-85, 1998.
20. J. Glasgow, G. MacEwan, and P. Panagaden. A logic for reasoning about security. ACM Transactions on Computer Systems, 10:226-264, 1992.
21. E. Lupu and M. Sloman. Conflict analysis for management policies. In Proceedings of the Vth International Symposium on Integrated Network Management IM'97, pages 1-14. Chapman & Hall, May 1997.
22. B.F. Chellas. Modal Logic: An Introduction. Cambridge University Press, 1980.
23. H. Prakken and M. Sergot. Dyadic: deontic logic and contrary-to-duty obligations. In Defeasible Deontic logic: Essays in Nonmonotonic Normative Reasoning, volume 263 of Synthese library. Kluwer Academic Publisher, 1997.
24. S.A. Kripke. Semantical considerations in modal logic. Acta Philosophica Fenica, 16:83-94, 1963.
25. S. Fagernes and M. Burgess. The effects of 'tit for tat' policy for rejecting 'spam' or denial of service floods. In Proceedings of the 4th System Administration and Network Engineering Conference (SANE 2004), 2004.
26. M. Burgess and S. Fagernes. Pervasive computing management ii: Voluntary cooperation. IEEE eTransactions on Network and Service Management, page (submitted).
27. A.K. Bandara, E.C. Lupu, J. Moffett, and A. Russo. A goal-based approach to policy refinement. In Proceedings of the 5th IEEE Workshop on Policies for Distributed Systems and Networks, 2004.
28. A.K. Bandara, F.C. Lupu, J. Moffett, and A. Russo. Using event calculus to formalise policy specification and analysis. In Proceedings of the 4th IEEE Workshop on Policies for Distributed Systems and Networks, 2003.
29. A.L. Lafuente and U. Montanari. Quantitative mu-calculus and ctl defined over constraint semirings. Electronic Notes on Theoretical Computing Systems QAPL, pages 1-30, 2005.