541,600 research outputs found
Preface Volume 63
AbstractThis volume contains the Proceedings of the First Workshop on Security of Mobile Multiagent Systems (SEMAS'2001). The Workshop was held in Montreal, Canada on May 29, 2001, as satellite event to the 5th International Conference on Autonomous Agents 2001The far reaching influence of the Internet has resulted in an increased interest in agent technologies, which are poised to play a key role in the implementation of successful Internet and WWW-based applications in the future. While there is still considerable hype concerning agent technologies, there is also an increasing awareness of the problems involved. Although there is a large body of work on cryptographic techniques that provide basic building-blocks to solve specific security problems, relatively little work has been done in investigating security in the multiagent system context. The introduction of mobile software agents significantly increases the risks involved in Internet and WWW-based applications. The aim of this workshop was to bring together people from the two relevant research fields, software security and agent-oriented programming. This volume covers actual research papers on security protocols and security policies to enforce security of mobile or multiagent systems but also introduces ideas how to use mobile agents to ensure security of a distributed system.The papers in this volume were reviewed by the program committee consisting, besides editor, of
Sahin Albayrak(Technical University Berlin)David Basin(Department of Computer Science, University of Freiburg)Ciaran Bryce(University of Geneve)Hans-Juergen Buerckert(German Research Center for Artificial Intelligence, DFKI)Guenther Karjoth(IBM Research Zuerich)Luc Moreau(Department of Computer Science, University of Southhampton)Volker Roth(Fraunhofer Gesellschaft IGD, Darmstadt)Helmut Schwigon(Bundesamt fuer Sicherheit in der Informationstechnik, BonnVipin Swarup(The MITRE Corp., Boston)Christian Tschudin(Uppsala University)Jan Vitek(Purdue University)This volume will be published as volume 63 in the series Electronic Notes in Theoretical Computer Science (ENTCS). This series is published electronically through the facilities of Elsevier Science B.V. and its auspices. The volumes in the ENTCS series can be accessed at the URL http://www.elsevier.nl/locate/entcsWe are very grateful to the following persons, whose help has been crucial for the success of CMCS'2000: Adele E. Howe, for her help with the organization of the Workshop as satellite event of AA'2001 and Mike Mislove, one of the Managing Editors of the ENTCS series, for his assistance with the use of the ENTCS style files.December 15, 2001 Dieter Hutte
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems
We prove a general finite convergence theorem for "upward-guarded" fixpoint
expressions over a well-quasi-ordered set. This has immediate applications in
regular model checking of well-structured systems, where a main issue is the
eventual convergence of fixpoint computations. In particular, we are able to
directly obtain several new decidability results on lossy channel systems.Comment: 16 page
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Computational Social Choice is an interdisciplinary research area involving
Economics, Political Science, and Social Science on the one side, and
Mathematics and Computer Science (including Artificial Intelligence and
Multiagent Systems) on the other side. Typical computational problems studied
in this field include the vulnerability of voting procedures against attacks,
or preference aggregation in multi-agent systems. Parameterized Algorithmics is
a subfield of Theoretical Computer Science seeking to exploit meaningful
problem-specific parameters in order to identify tractable special cases of in
general computationally hard problems. In this paper, we propose nine of our
favorite research challenges concerning the parameterized complexity of
problems appearing in this context
Real-time and Probabilistic Temporal Logics: An Overview
Over the last two decades, there has been an extensive study on logical
formalisms for specifying and verifying real-time systems. Temporal logics have
been an important research subject within this direction. Although numerous
logics have been introduced for the formal specification of real-time and
complex systems, an up to date comprehensive analysis of these logics does not
exist in the literature. In this paper we analyse real-time and probabilistic
temporal logics which have been widely used in this field. We extrapolate the
notions of decidability, axiomatizability, expressiveness, model checking, etc.
for each logic analysed. We also provide a comparison of features of the
temporal logics discussed
A guided tour of asynchronous cellular automata
Research on asynchronous cellular automata has received a great amount of
attention these last years and has turned to a thriving field. We survey the
recent research that has been carried out on this topic and present a wide
state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat
- …