Department of Computer Science and Engineering / Institutionen för data- och informationsteknik
Browse by
The Department of Computer Science and Engineering is joint between Chalmers and the University of Gothenburg, where the university part is included in the IT Faculty.
More information: Computer Science and Engineering
Collections in this community
Recent Submissions
-
Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
(2024)We study how to distribute trace languages in a setting where processes communicate via reconfigurable communication channels. That is, the different processes can connect and disconnect from channels at run time. We ... -
Attributed Point-to-Point Communication in R-CHECK
(Lecture Notes in Computer Science (LNCS), 2024)Autonomous multi-agent, or more generally, collective adaptive systems, use different modes of communication to support their autonomy and ease of interaction. In order to enable modelling and reasoning about such systems, ... -
Adding Reconfiguration to Zielonka’s Asynchronous Automata
(Electronic Proceedings in Theoretical Computer Science, EPTCS, 88-102, 2024)We study an extension of Zielonka’s (fixed) asynchronous automata called reconfigurable asynchronous automata where processes can dynamically change who they communicate with. We show that reconfigurable asynchronous ... -
Faster and Smaller Solutions of Obliging Games
(35th International Conference on Concurrency Theory (CONCUR 2024), 2024)Obliging games have been introduced in the context of the game perspective on reactive synthesis in order to enforce a degree of cooperation between the to-be-synthesized system and the environment. Previous approaches to ... -
Pedestrian Behavior Prediction Using Machine Learning Methods
(2024-11-14)Background: Accurate pedestrian behavior prediction is essential for reducing fatalities from pedestrian-vehicle collisions. Machine learning can support automated vehicles to better understand pedestrian behavior in complex ... -
Automata Constructions for LTL with Past
(Department of Computer Science and Engineering University of Gothenburg | Chalmers University of Technology, 2024)Linear temporal logic (LTL) is a popular language in formal verification, especially in the domains of model checking and reactive synthesis. Because its semantics is defined in terms of infinite sequences of symbols ... -
Enhancing Requirements Engineering Practices Using Large Language Models
(2024)Background: Large Language Models (LLMs) offer users natural language interaction, technical insights and task automation capabilities. However, the systematic integration of LLMs within Requirements Engineering ... -
Compositional Verification of Stigmergic Collective System
(2023)Collective adaptive systems may be broadly defined as en sembles of autonomous agents, whose interaction may lead to the emer gence of global features and patterns. Formal verification may provide strong guarantees about ... -
Compositional Verification of Priority Systems Using Sharp Bisimulation
(2023)Sharp bisimulation is a refinement of branching bisimulation, parame terized by a subset of the system’s actions, called strong actions. This parameterization allows the sharp bisimulation to be tailored by the property ... -
Intuitive Modelling and Formal Analysis of Collective Behaviour in Foraging Ants
(2024)We demonstrate a novel methodology that integrates intuitive modelling, simulation, and formal verification of collective behaviour in biological systems. To that end, we consider the case of a colony of foraging ants, ... -
Synthesis for prefix first-order logic on data words
(2024)We study the reactive synthesis problem for distributed systems with an unbounded number of participants interacting with an uncontrollable environment. Executions of those systems are modeled by data words, and specifications ... -
Generic Model Checking for Modal Fixpoint Logics in COOL-MC
(2023)We report on COOL-MC, a model checking tool for fixpoint logics that is parametric in the branching type of models (non-deterministic, game-based, probabilistic etc.) and in the next-step modalities used in formulae. The ... -
Faster Game Solving by Fixpoint Acceleration
(2024)We propose a method for solving parity games with acyclic (DAG) sub-structures by computing nested fixpoints of a DAG attractor function that lives over the non-DAG parts of the game, thereby restricting the domain of the ... -
Fair Omega-regular Games
(27th International Conference on Foundations of Software Science and Computation Structures, 2024)We consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph G=(V,E) and a set of fair moves E_f a subset of E a player is said ... -
Symbolic Solution of Emerson-Lei Games for Reactive Synthesis
(2024)Emerson-Lei conditions have recently attracted attention due to both their succinctness and their favorable closure properties. In the current work, we show how infinite-duration games with Emerson-Lei objectives can be ... -
Synchronous Agents, Verification, and Blame - A Deontic View
(2023)A question we can ask of multi-agent systems is whether the agents’ collective interaction satisfies particular goals or specifications, which can be either individual or collective. When a collaborative goal is not reached, ... -
Games for Efficient Supervisor Synthesis
(2023)In recent years, there has been an increasing interest in the connections between supervisory control theory and reactive synthesis. As the two fields use similar techniques there is great hope that technologies from one ... -
COOL 2 – A Generic Reasoner for Modal Fixpoint Logics (System Description)
(2023)There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a ... -
ppLTLTT : Temporal Testing for Pure-Past Linear Temporal Logic Formulae
(2023)This paper presents ppLTLTT, a tool for translating pure-past linear temporal logic formulae into temporal testers in the form of automata. We show how ppLTLTT can be used to easily extend existing LTL-based tools, such ...
RSS 1.0