English
Related papers

Related papers: Compositionality for Quantitative Specifications

200 papers

In this paper I elaborated on the idea of David Harel and Amir Pnueli to think systems and their interaction from the point of view of their compositional behaviour. The obvious idea to base the composition of systems on the concept of…

Software Engineering · Computer Science 2021-02-19 Johannes Reich

In this paper we propose a compositional scheme for the construction of abstractions for networks of control systems using the interconnection matrix and joint dissipativity-type properties of subsystems and their abstractions. In the…

Optimization and Control · Mathematics 2016-12-30 Majid Zamani , Murat Arcak

This work investigates whether time series of natural phenomena can be understood as being generated by sequences of latent states which are ordered in systematic and regular ways. We focus on clinical time series and ask whether clinical…

Machine Learning · Computer Science 2025-08-29 Michael Hagmann , Michael Staniek , Stefan Riezler

Composition is a powerful principle for systems biology, focused on the interfaces, interconnections, and orchestration of distributed processes to enable integrative multiscale simulations. Whereas traditional models focus on the structure…

Other Quantitative Biology · Quantitative Biology 2024-11-25 Eran Agmon

In two earlier papers we derived congruence formats with regard to transition system specifications for weak semantics on the basis of a decomposition method for modal formulas. The idea is that a congruence format for a semantics must…

Logic in Computer Science · Computer Science 2019-08-20 Wan Fokkink , Rob van Glabbeek , Bas Luttik

We present work in progress on the temporal progression of compositionality in noun-noun compounds. Previous work has proposed computational methods for determining the compositionality of compounds. These methods try to automatically…

Computation and Language · Computer Science 2019-06-13 Prajit Dhar , Janis Pagel , Lonneke van der Plas

We develop a method to control discrete-time systems with constant but initially unknown parameters from linear temporal logic (LTL) specifications. We introduce the notions of (non-deterministic) parametric and adaptive transition systems…

Systems and Control · Computer Science 2017-03-23 Sadra Sadraddini , Calin Belta

Computability theory is traditionally conceived as the theoretical basis of informatics. Nevertheless, numerous proposals transcend computability theory, in particular by emphasizing interaction of modules, or components, parts,…

Software Engineering · Computer Science 2024-08-28 Peter Fettke , Wolfgang Reisig

We consider the setting of component-based design for real-time systems with critical timing constraints. Based on our earlier work, we propose a compositional specification theory for timed automata with I/O distinction, which supports…

Software Engineering · Computer Science 2012-06-21 Chris Chilton , Marta Kwiatkowska , Xu Wang

Humans and animals developed a sophisticated motor control apparatus and there is much evidence that it has a modular structure. The modularity offers a range of benefits, e.g. ability to learn dissociable motion styles without interference…

Robotics · Computer Science 2016-05-20 Kirill Makukhin

Leveraging the compositional nature of our world to expedite learning and facilitate generalization is a hallmark of human perception. In machine learning, on the other hand, achieving compositional generalization has proven to be an…

Machine Learning · Computer Science 2023-07-13 Thaddäus Wiedemer , Prasanna Mayilvahanan , Matthias Bethge , Wieland Brendel

We introduce a performance-driven framework for constructing strictly causal forward-oriented observables in strongly non-stationary time series. The method combines a robustly normalized composite of heterogeneous indicators with a…

Computational Finance · Quantitative Finance 2026-03-17 Lucas A. Souza

Behavioural metrics provide a quantitative refinement of classical two-valued behavioural equivalences on systems with quantitative data, such as metric or probabilistic transition systems. In analogy to the linear-time/branching-time…

Logic in Computer Science · Computer Science 2025-01-28 Jonas Forster , Lutz Schröder , Paul Wild , Harsh Beohar , Sebastian Gurke , Barbara König , Karla Messing

The ability to plan with temporal abstractions is central to intelligent decision-making. Rather than reasoning over primitive actions, we study agents that compose pre-trained policies as temporally extended actions, enabling solutions to…

Machine Learning · Computer Science 2026-02-24 Jesse Farebrother , Matteo Pirotta , Andrea Tirinzoni , Marc G. Bellemare , Alessandro Lazaric , Ahmed Touati

Controller synthesis techniques for continuous systems with respect to temporal logic specifications typically use a finite-state symbolic abstraction of the system model. Constructing this abstraction for the entire system is…

Systems and Control · Computer Science 2017-08-10 Kaushik Mallik , Anne-Kathrin Schmuck , Sadegh Soudjani , Rupak Majumdar

In tasks like semantic parsing, instruction following, and question answering, standard deep networks fail to generalize compositionally from small datasets. Many existing approaches overcome this limitation with model architectures that…

Computation and Language · Computer Science 2023-07-06 Ekin Akyürek , Jacob Andreas

This thesis is concerned with quantitative verification, that is, the verification of quantitative properties of quantitative systems. These systems are found in numerous applications, and their quantitative verification is important, but…

Logic in Computer Science · Computer Science 2022-04-26 Uli Fahrenberg

Qualitative numerical planning is classical planning extended with non-negative real variables that can be increased or decreased "qualitatively", i.e., by positive indeterminate amounts. While deterministic planning with numerical…

Artificial Intelligence · Computer Science 2020-11-30 Blai Bonet , Hector Geffner

This paper describes a method for compiling a constraint-based grammar into a potentially more efficient form for processing. This method takes dependent disjunctions within a constraint formula and factors them into non-interacting groups…

cmp-lg · Computer Science 2008-02-03 John Griffith

This paper presents a compositional framework for the construction of symbolic models for a network composed of a countably infinite number of finite-dimensional discrete-time control subsystems. We refer to such a network as infinite…

Systems and Control · Electrical Eng. & Systems 2021-10-29 Siyuan Liu , Navid Noroozi , Majid Zamani
‹ Prev 1 4 5 6 7 8 10 Next ›