English
Related papers

Related papers: Synthesis in Distributed Environments

200 papers

For a given labelled transition system (LTS), synthesis is the task to find an unlabelled Petri net with an isomorphic reachability graph. Even when just demanding an embedding into a reachability graph instead of an isomorphism, a solution…

Computational Complexity · Computer Science 2020-02-20 Uli Schlachter , Harro Wimmel

Petri nets are a popular formalism for modeling and analyzing distributed systems. Tokens in Petri net models can represent the control flow state or resources produced/consumed by transition firings. We define a resource as a part (a…

Logic in Computer Science · Computer Science 2023-06-22 Irina Lomazova , Vladimir Bashkin , Petr Jančar

Nowadays, a globalization of national markets requires developing flexible and demand-driven production systems. Agent-based technology, being distributed, flexible and autonomous is expected to provide a short-time reaction to disturbances…

Multiagent Systems · Computer Science 2011-09-06 S. Kornienko , O. Kornienko , P. Levi

Concurrent programming is used in all large and complex computer systems. However, concurrency errors and system failures (ex: crashes and deadlocks) are common. We find that Petri nets can be used to model concurrent systems and find and…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-04 Marshall Rawson , Michael Rawson

Inspired by a concrete industry problem we consider the input synthesis problem for hybrid systems: given a hybrid system that is subject to input from outside (also called disturbance or noise), find an input sequence that steers the…

Systems and Control · Computer Science 2016-02-22 Takumi Akazaki , Ichiro Hasuo , Kohei Suenaga

Reachability games are two-player games played on a graph, where the objective of $\texttt{REACH}$ player is to reach the target set whereas the objective of $\texttt{SAFE}$ player is to stay away from the target set. Reachability games…

Artificial Intelligence · Computer Science 2026-05-12 Krishnendu Chatterjee , Ehsan Kafshdar Goharshady , Mehrdad Karrabi , Maximilian Seeliger , Đorđe Žikelić

In typical reinforcement learning (RL), the environment is assumed given and the goal of the learning is to identify an optimal policy for the agent taking actions through its interactions with the environment. In this paper, we extend this…

Artificial Intelligence · Computer Science 2019-10-25 Haifeng Zhang , Jun Wang , Zhiming Zhou , Weinan Zhang , Ying Wen , Yong Yu , Wenxin Li

We introduce the notion of online reactive planning with sensing actions for systems with temporal logic constraints in partially observable and dynamic environments. With incomplete information on the dynamic environment, reactive…

Systems and Control · Computer Science 2014-10-02 Jie Fu , Ufuk Topcu

The relationship between topology and dynamics of complex systems has motivated continuing interest from the scientific community. In the present work, we address this interesting topic from the perspective of simple games, involving two…

Social and Information Networks · Computer Science 2024-06-25 Alexandre Benatti , Luciano da F. Costa

The execution of an event in a complex and distributed system where the dependencies vary during the evolution of the system can be represented in many ways, and one of them is to use Context-Dependent Event structures. Event structures are…

Logic in Computer Science · Computer Science 2023-06-22 G. Michele Pinna

This study aims at designing an environment-aware text-to-speech (TTS) system that can generate speech to suit specific acoustic environments. It is also motivated by the desire to leverage massive data of speech audio from heterogeneous…

Audio and Speech Processing · Electrical Eng. & Systems 2022-08-09 Daxin Tan , Guangyan Zhang , Tan Lee

Safe Rust guarantees memory safety through strict compile-time constraints: ownership can be transferred, borrowing can temporarily guarantee either shared read-only or exclusive write access, and ownership and borrowing are scoped by…

Software Engineering · Computer Science 2026-04-06 Kaiwen Zhang , Guanjun Liu

Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish things that the individual agents cannot, or can do things more…

Computer Science and Game Theory · Computer Science 2009-09-29 Vincent Conitzer , Tuomas Sandholm

Petri nets are a mathematical language for modeling and reasoning about distributed systems. In this paper we propose an approach to Petri nets for embedding reversibility, i.e., the ability of reversing an executed sequence of operations…

Logic in Computer Science · Computer Science 2020-10-09 Anna Philippou , Kyriaki Psara

When giving automated feedback to a student working on a beginner's exercise, many programming tutors run into a completeness problem. On the one hand, we want a student to experiment freely. On the other hand, we want a student to write…

Human-Computer Interaction · Computer Science 2020-11-17 Niek Mulleners , Johan Jeuring , Bastiaan Heeren

Reinforcement learning algorithms can train agents that solve problems in complex, interesting environments. Normally, the complexity of the trained agent is closely related to the complexity of the environment. This suggests that a highly…

Artificial Intelligence · Computer Science 2018-03-16 Trapit Bansal , Jakub Pachocki , Szymon Sidor , Ilya Sutskever , Igor Mordatch

In this paper, we propose a solution to the distributed topology formation problem for large-scale sensor networks with multi-source multicast flows. The proposed solution is based on game-theoretic approaches in conjunction with network…

Computer Science and Game Theory · Computer Science 2019-07-24 Minhae Kwon , Hyunggon Park

Norms have been widely proposed as a way of coordinating and controlling the activities of agents in a multi-agent system (MAS). A norm specifies the behaviour an agent should follow in order to achieve the objective of the MAS. However,…

Computational Complexity · Computer Science 2022-11-30 Davide Dell'Anna , Natasha Alechina , Brian Logan , Maarten Löffler , Fabiano Dalpiaz , Mehdi Dastani

Complex environments and tasks pose a difficult problem for holistic end-to-end learning approaches. Decomposition of an environment into interacting controllable and non-controllable objects allows supervised learning for non-controllable…

Machine Learning · Computer Science 2019-01-30 Andrew Melnik , Sascha Fleer , Malte Schilling , Helge Ritter

We consider turn-based stochastic two-player games with a combination of a parity condition that must hold surely, that is in all possible outcomes, and of a parity condition that must hold almost-surely, that is with probability 1. The…

Computer Science and Game Theory · Computer Science 2026-01-08 Laurent Doyen , Shibashis Guha
‹ Prev 1 8 9 10 Next ›