Trust Domains: An Algebraic, Logical, and Utility-Theoretic Approach

Anderson, Gabrielle; Collinson, Matthew; Pym, David J.

doi:10.1007/978-3-642-38908-5_18

Cited by 2 publications

(9 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A costs-efficient analysis in terms of modal logic is to be found in (Anderson et al 2013). In the context of propagation, transitivity is a natural property to study.…”

Section: Related Workmentioning

confidence: 99%

Trust and distrust in contradictory information transmission

et al. 2017

View full text Add to dashboard Cite

We analyse the problem of contradictory information distribution in networks of agents with positive and negative trust. The networks of interest are built by ranked agents with different epistemic attitudes. In this context, positive trust is a property of the communication between agents required when message passing is executed bottom-up in the hierarchy, or as a result of a sceptic agent checking information. These two situations are associated with a confirmation procedure that has an epistemic cost. Negative trust results from refusing verification, either of contradictory information or because of a lazy attitude. We offer first a natural deduction system called SecureNDsim to model these interactions and consider some meta-theoretical properties of its derivations. We then implement it in a NetLogo simulation to test experimentally its formal properties. Our analysis concerns in particular: conditions for consensus-reaching transmissions; epistemic costs induced by confirmation and rejection operations; the influence of ranking of the initially labelled nodes on consensus and costs; complexity results.

show abstract

“…A costs-efficient analysis in terms of modal logic is to be found in (Anderson et al 2013). In the context of propagation, transitivity is a natural property to study.…”

Section: Related Workmentioning

confidence: 99%

Trust and distrust in contradictory information transmission

et al. 2017

View full text Add to dashboard Cite

show abstract

“…The mathematical formulation of this set-up is established within a calculus of resources and processes, and its associated modal logic, introduced in [2]. This modelling framework builds directly on the ideas presented in [14,12,11,13], in which a mathematical account of the classical view of distributed systems -as described, for example, in [15] -is given.…”

Section: ! !mentioning

confidence: 99%

“…Our existing formal characterization of trust domains is built on a mathematical systems modelling framework [14,1,2]. The key components of our approach are the following: first, a resource-sensitive process algebra, with a decision-theoretic notion of utility-centric choice, and a corresponding, resourcesensitive modal logic of processes; second, a conceptual notion of trust domain, characterized using our algebraic, logical, and utility-theoretic tools; and third, a meta-theory of how trust domains can be constructed, which provides a topological interpretation of how different agents' trust interacts.…”

Section: ! !mentioning

confidence: 99%

“…First, in Section 3.1, we explain our previous work in system modelling based on concepts of location, resource, process, and environment [11,13,12,14]. Second, in Section 3.2, we explain our approach, building on [1,2], to integrating cost as a basis for determining choices made during process execution. Third, in Section 3.3, we describe formally a process algebra with contextual costs, supporting the approach sketched in the previous section, and establish its essential meta-theory.…”

Section: Systems Modelling and Decision-makingmentioning

confidence: 99%

“…Establishing the boundaries of what an agent, or group of agents, trusts, is extremely useful when attempting to understand the interconnected, information-rich ecosystems upon which the world is moreor-less wholly dependent. The trust domain of an entity (an agent or collection of agents) consists of an ecosystem of other agents with which the entity willing to interact [1,2]. This interaction may consist of work sharing, resource sharing, location sharing, and so on.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Trust domains in system models: algebra, logic, utility, and combinators

Anderson

Pym

2015

Journal of Logic and Computation

Self Cite

View full text Add to dashboard Cite

Understanding the boundaries of trust is a key aspect of accurately modelling the structure and behaviour of multi-agent systems with heterogeneous motivating factors. Reasoning about these boundaries in highly interconnected, information-rich ecosystems is complex, and dependent upon modelling at the correct level of abstraction. Building on an established mathematical systems modelling framework that captures the classical view of distributed systems, we develop a modelling framework that incorporates both logical and cost-based descriptions of systems, which allows us to establish a definition of an agent's trust domain based on the satisfaction of logical properties at acceptable utility (handled here simply as cost) to the agent, of verification. In addition to the technical properties of the modelling framework itself, we establish a theory of logical combinators, including substitution, for composing trust domains to form relatively complex models of trust. We illustrate the ideas with examples throughout.

show abstract

Trust Domains: An Algebraic, Logical, and Utility-Theoretic Approach

Cited by 2 publications

References 13 publications

Trust and distrust in contradictory information transmission

Trust and distrust in contradictory information transmission

Trust domains in system models: algebra, logic, utility, and combinators

Contact Info

Product

Resources

About