A Compositional Framework for Preference-Aware Agents

@inproceedings{Kapp2016ACF,
  title={A Compositional Framework for Preference-Aware Agents},
  author={Tobias Kapp{\'e} and Farhad Arbab and Carolyn L. Talcott},
  booktitle={V2CPS@IFM},
  year={2016}
}
textabstractA formal description of a Cyber-Physical system should include a rigorous specification of the computational and physical components involved, as well as their interaction. Such a description, thus, lends itself to a compositional model where every module in the model specifies the behavior of a (computational or physical) component or the interaction between different components. We propose a framework based on Soft Constraint Automata that facilitates the component-wise… 

Figures from this paper

A Component-Oriented Framework for Autonomous Agents
TLDR
This work extends Linear Temporal Logic with two unary connectives that reflect the compositional structure of the actions, and shows how it can be used to diagnose undesired behavior by tracing the falsification of a specification back to one or more culpable components.
L O ] 3 1 Ju l 2 01 7 A Component-oriented Framework for Autonomous Agents
TLDR
This work extends Linear Temporal Logic with two unary connectives that reflect the compositional structure of the actions, and shows how it can be used to diagnose undesired behavior by tracing the falsification of a specification back to one or more culpable components.
From Soft Agents to Soft Component Automata and Back
  • C. Talcott
  • Computer Science
    It's All About Coordination
  • 2018
TLDR
A joint project between my group at SRI and Farhad’s group at CWI is developing formal methods to diagnose the cause of undesired behavior of autonomous systems operating in unpredictable environments.
Formal Specification and Analysis of Robust Adaptive Distributed Cyber-Physical Systems
TLDR
This tutorial describes a framework called Soft Agents, formalized in the Maude rewriting logic system, which supports experimenting with, formally testing, and reasoning about specifications of agent systems.
Constraint automata with memory cells and their composition
Soft constraint automata with memory
Soft Constraint Automata with Memory
TLDR
The notion of Soft Constraint Automata is revised, where automata transitions are weighted and consequently each action is associated with a preference value.
Fundamentals of Software Engineering: 8th International Conference, FSEN 2019, Tehran, Iran, May 1-3, 2019, Revised Selected Papers
TLDR
The architecture, and formal syntax and semantics of HPobSAM is presented which is a model for specifying behavioral and structural adaptations to model large-scale systems and address reusability concerns.
...
1
2
...

References

SHOWING 1-10 OF 21 REFERENCES
Composing Constraint Automata, State-by-State
TLDR
A correctness-by-construction approach to component-based software engineering--one of the hallmarks in Sifakis' "rigorous system design"--is facilitated by research on constraint automata verification.
Soft Agents: Exploring Soft Constraints to Model Robust Adaptive Distributed Cyber-Physical Agent Systems
TLDR
A model is proposed, formalized in the Maude rewriting logic system, that allows experimenting with and reasoning about designs of open distributed systems consisting of multiple cyber-physical agents, specifically, where a coherent global view is unattainable and timely consensus is impossible.
Design and Verification of Systems with Exogenous Coordination Using Vereofy
TLDR
A model-checking approach using the tool Vereofy that is based on an exogenous coordination model, where the components are represented by their behavioral interfaces, which supports the verification of the components and their communication structure is reported on.
OnPlan: A Framework for Simulation-Based Online Planning
TLDR
The OnPlan framework is proposed, a mathematical specification of requirements for autonomous systems operating in domains with large probabilistic state spaces and high branching factors, and its ability to provide system autonomy is illustrated empirically on a robotic rescue example.
Modeling component connectors in Reo by constraint automata
A Rewriting Logic Framework for Soft Constraints
Preference and Similarity-Based Behavioral Discovery of Services
TLDR
The obtained general formal tool can be used to represent preference-based and similarity-based queries, which allow a user more freedom in choosing the behavior of the service to finally use, among all possible choices.
Constraint Solving over Semirings
TLDR
A constraint solving framework where all such extensions, as well as classical CSPs, can be cast, and this framework can be used to model both old and new constraint solving schemes, allowing one to formally justify many informally taken choices in existing schemes.
Semiring-based constraint satisfaction and optimization
TLDR
It is shown how this framework can be used to model both old and new constraint solving and optimization schemes, thus allowing one to both formally justify many informally taken choices in existing schemes, and to prove that local consistency techniques can beused also in newly defined schemes.
Conflict-Directed A* Search for Soft Constraints
TLDR
An approach to solving soft constraints that exploits this disparity by re-formulating soft constraints into an optimization part (with unary objective functions), and a satisfiability part that is exploited by a search algorithm that enumerates subspaces with equal valuation.
...
1
2
3
...