Recent Submissions

  • Fair Omega-regular Games 

    Hausmann, Daniel; Piterman, Nir; Saglam, Irmak; Schmuck, Anne-Kathrin (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 

    Hausmann, Daniel; Lehaut, Mathieu; Piterman, Nir (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 

    Kharraz, Karam; Azzopardi, Shaun; Schneider, Gerardo; Leucker, Martin (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, ...
  • Modelling Flocks of Birds and Colonies of Ants from the Bottom Up 

    De Nicola, Rocco; Di Stefano, Luca; Inverso, Omar; Valiani, Serenella (2023)
  • Games for Efficient Supervisor Synthesis 

    Hausmann, Daniel; Prabhat, Kumar Jha; Piterman, Nir (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) 

    Görlitz, Oliver; Hausmann, Daniel; Humml, Merlin; Pattinson, Dirk; Prucker, Simon; Schröder, Lutz (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 

    Azzopardi, Shaun; Lidell, David; Piterman, Nir; Schneider, Gerardo (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 ...
  • Language Support for Verifying Reconfigurable Interacting Systems 

    Abd Alrahman, Yehia; Azzopardi, Shaun; Di Stefano, Luca; Piterman, Nir (2023)
    Reconfigurable interacting systems consist of a set of autonomous agents, with integrated interaction capabilities that feature opportunistic interaction. Agents seemingly reconfigure their interactions interfaces by forming ...
  • Towards Next-Gen Machine Learning Asset Management Tools 

    Idowu, Samuel O. (2023-10-26)
    Context: The proficiency of machine learning (ML) systems in solving many real-world problems effectively has enabled a paradigm shift toward ML-enabled systems. In ML-enabled software, significant software code artifacts ...
  • Improving the Performance of Machine Learning-based Methods for Continuous Integration by Handling Noise 

    Al-Sabbagh, Khaled (2023-08-22)
    Background: Modern software development companies are increasingly implementing continuous integration (CI) practices to meet market demands for delivering high-quality features. The availability of data from CI systems ...
  • EXPERIENCES OF SPEAKING WITH CONVERSATIONAL AI IN LANGUAGE EDUCATION 

    Ericsson, Elin (2023-08-17)
    This thesis explores the application of digital tools in Swedish language education, specifically in relation to speaking skills. It focuses on dialogue- based, computer-assisted language learning, which enables students ...
  • Games for Efficient Supervisor Synthesis 

    Hausmann, Daniel; Kumar Jha, Prabhat; Piterman, Nir (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 ...
  • Understanding, Implementing, and Supporting Security Assurance Cases in Safety-Critical Domains 

    Mohamad, Mazen (2023-05-25)
    The increasing demand for connectivity in safety-critical domains has made security assurance a crucial consideration. In safety-critical industry, software, and connectivity have become integral to meeting market expectations. ...
  • The Role of Discretion from the Perspective of Social Work Professionalism and Automated Decision Making 

    Svensson, Lupita; Ranerup, Agneta (2022)
    This article addresses the gap in knowledge about how new digital technology affects decision making and social caseworkers’ professionalism. The aim is to enhance the understanding of how digital discretion—as a result ...
  • Frame Shifting and Frame Blending in Digital Transformation 

    Ivarsson, Frida (2023-05-04)
    As organizations embrace digital technologies in new ways, they experience a process known as digital transformation. This process is not just about technological changes – digital transformation also involves ...
  • Designing Human-Centered Hybrid Decision Support Systems 

    Cao, Lu (2023-04-19)
    Innovative decision support systems (DSSs) are revolutionizing key processes in organizations. These systems are used in managerial decision-making to solve increasingly complicated decision tasks, for example, using ...
  • ICT and discretion: An “up-to-date” view of what we want to know and how it can be studied 

    Ranerup, Agneta (Presented at 20th Scandinavian Workshop on E-Government (SWEG): From Government automation to AI, 1-2 February, 2023, Örebro University., 2023)
    The discretion of street-level bureaucrats is increasingly affected by public sector digitalisation. The aim of this study was to provide a scoping review with “state of the art” of research about information and communication ...
  • Platformization: Digital Materiality at the Limits of Discourse 

    Gustavsson, Mikael (2023-04-13)
    The digital platform has served us well as a metaphor for an imaginary ‘something’ made comprehensible through theories such as matchmaking, externalities, and network effects. But as much as metaphors and theories can ...
  • A Survey on Satisfiability Checking for the μ -Calculus Through Tree Automata 

    Hausmann, Daniel; Piterman, Nir (2022)
    Algorithms for model checking and satisfiability of the modal μ -calculus start by converting formulas to alternating parity tree automata. Thus, model checking is reduced to checking acceptance by tree automata and ...

View more