4,293 research outputs found
The discrete dynamics of small-scale spatial events: agent-based models of mobility in carnivals and street parades
Small-scale spatial events are situations in which elements or objects vary in such away that temporal dynamics is intrinsic to their representation and explanation. Someof the clearest examples involve local movement from conventional traffic modelingto disaster evacuation where congestion, crowding, panic, and related safety issue arekey features of such events. We propose that such events can be simulated using newvariants of pedestrian model, which embody ideas about how behavior emerges fromthe accumulated interactions between small-scale objects. We present a model inwhich the event space is first explored by agents using ?swarm intelligence?. Armedwith information about the space, agents then move in an unobstructed fashion to theevent. Congestion and problems over safety are then resolved through introducingcontrols in an iterative fashion and rerunning the model until a ?safe solution? isreached. The model has been developed to simulate the effect of changing the route ofthe Notting Hill Carnival, an annual event held in west central London over 2 days inAugust each year. One of the key issues in using such simulation is how the processof modeling interacts with those who manage and control the event. As such, thischanges the nature of the modeling problem from one where control and optimizationis external to the model to one where this is intrinsic to the simulation
Model Checking Trust-based Multi-Agent Systems
Trust has been the focus of many research projects, both theoretical and practical, in
the recent years, particularly in domains where open multi-agent technologies are applied
(e.g., Internet-based markets, Information retrieval, etc.). The importance of trust in such
domains arises mainly because it provides a social control that regulates the relationships
and interactions among agents. Despite the growing number of various multi-agent applications, they still encounter many challenges in their formal modeling and the verification
of agentsâ behaviors. Many formalisms and approaches that facilitate the specifications of
trust in Multi-Agent Systems (MASs) can be found in the literature. However, most of these
approaches focus on the cognitive side of trust where the trusting entity is normally capable
of exhibiting properties about beliefs, desires, and intentions. Hence, the trust is considered
as a belief of an agent (the truster) involving ability and willingness of the trustee to perform some actions for the truster. Nevertheless, in open MASs, entities can join and leave
the interactions at any time. This means MASs will actually provide no guarantee about the
behavior of their agents, which makes the capability of reasoning about trust and checking
the existence of untrusted computations highly desired.
This thesis aims to address the problem of modeling and verifying at design time
trust in MASs by (1) considering a cognitive-independent view of trust where trust ingredients are seen from a non-epistemic angle, (2) introducing a logical language named Trust
Computation Tree Logic (TCTL), which extends CTL with preconditional, conditional, and graded trust operators along with a set of reasoning postulates in order to explore its capabilities, (3) proposing a new accessibility relation which is needed to define the semantics
of the trust modal operators. This accessibility relation is defined so that it captures the
intuition of trust while being easily computable, (4) investigating the most intuitive and
efficient algorithm for computing the trust set by developing, implementing, and experimenting different model checking techniques in order to compare between them in terms of
memory consumption, efficiency, and scalability with regard to the number of considered
agents, (5) evaluating the performance of the model checking techniques by analyzing the
time and space complexity.
The approach has been applied to different application domains to evaluate its computational performance and scalability. The obtained results reveal the effectiveness of the
proposed approach, making it a promising methodology in practice
Characterising and modeling the co-evolution of transportation networks and territories
The identification of structuring effects of transportation infrastructure on
territorial dynamics remains an open research problem. This issue is one of the
aspects of approaches on complexity of territorial dynamics, within which
territories and networks would be co-evolving. The aim of this thesis is to
challenge this view on interactions between networks and territories, both at
the conceptual and empirical level, by integrating them in simulation models of
territorial systems.Comment: Doctoral dissertation (2017), Universit\'e Paris 7 Denis Diderot.
Translated from French. Several papers compose this PhD thesis; overlap with:
arXiv:{1605.08888, 1608.00840, 1608.05266, 1612.08504, 1706.07467,
1706.09244, 1708.06743, 1709.08684, 1712.00805, 1803.11457, 1804.09416,
1804.09430, 1805.05195, 1808.07282, 1809.00861, 1811.04270, 1812.01473,
1812.06008, 1908.02034, 2012.13367, 2102.13501, 2106.11996
Proceedings of the Joint Automated Reasoning Workshop and Deduktionstreffen: As part of the Vienna Summer of Logic â IJCAR 23-24 July 2014
Preface
For many years the British and the German automated reasoning communities have successfully run independent series of workshops for anybody working in the area of automated reasoning. Although open to the general
public they addressed in the past primarily the British and the German communities, respectively. At the occasion of the Vienna Summer of Logic the two series have a joint event in Vienna as an IJCAR workshop. In the spirit of the two series there will be only informal proceedings with abstracts of the works presented. These are collected in this document. We have tried to maintain the informal open atmosphere of the two series and have welcomed in particular research students to present their work. We have solicited for all work related to automated reasoning and its applications with a particular interest in work-in-progress and the presentation of half-baked ideas.
As in the previous years, we have aimed to bring together researchers from all areas of automated reasoning in order to foster links among researchers from various disciplines; among theoreticians, implementers and users alike, and among international communities, this year not just the British and German communities
Zero-one laws with respect to models of provability logic and two Grzegorczyk logics
It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in almost no models of that size. Therefore, many properties of models, such as having an even number of elements, cannot be expressed in the language of first-order logic. Halpern and Kapron proved zero-one laws for classes of models corresponding to the modal logics K, T, S4, and S5 and for frames corresponding to S4 and S5. In this paper, we prove zero-one laws for provability logic and its two siblings Grzegorczyk logic and weak Grzegorczyk logic, with respect to model validity. Moreover, we axiomatize validity in almost all relevant finite models, leading to three different axiom systems
LIPIcs, Volume 277, GIScience 2023, Complete Volume
LIPIcs, Volume 277, GIScience 2023, Complete Volum
- âŠ