Helle Hvid Hansen

Helle Hvid Hansen

Auto-generated profile, based on publicly available information

Helle Hvid Hansen

University of Groningen Groningen Netherlands

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2021 in Energy Policy
Verified
Journal Article
Open access
GGGraciela del Carmen Nava Guerrero
Graciela del Carmen Nava Guerrero
HHHelle Hvid Hansen
Helle Hvid Hansen
GKGijsbert Korevaar
Gijsbert Korevaar
Zofia LukszoZofia Lukszo
Zofia Lukszo

3 February 2017 in Logical Methods in Computer Science
Verified
Journal Article
Open access
PDF file
HHHelle Hvid Hansen
Helle Hvid Hansen
CKClemens Kupke
Clemens Kupke
JRJan Rutten
Jan Rutten
Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich theory partly due to their ubiquity in mathematics and computer science. Stream differential equations are a coinductive method for specifying streams and stream operations, and their theory has been developed in many papers over the past two decades. In this paper we present a survey of the many results in this area. Our focus is on the classification of different formats of stream differential equations, their solution methods, and the classes of streams they can define. Moreover, we describe in detail the connection between the so-called syntactic solution method and abstract GSOS.

5 March 2019 in Energies
Verified
Journal Article
Open access
PDF file
GGGraciela del Carmen Nava Guerrero
Graciela del Carmen Nava Guerrero
GKGijsbert Korevaar
Gijsbert Korevaar
HHHelle Hvid Hansen
Helle Hvid Hansen
Zofia LukszoZofia Lukszo
Zofia Lukszo
To reduce greenhouse gas emissions to 80% below 1990 levels by 2050, an energy transition is taking place in the European Union. Achieving these targets requires changes in the heating and cooling sector (H&C). Designing and implementing this energy transition is not trivial, as technology, actors, and institutions interact in complex ways. We provide an illustrative example of the development and use of an agent-based model (ABM) for thermal energy transitions in the built environment, from the perspective of sociotechnical systems (STS) and complex adaptive systems (CAS). In our illustrative example, we studied the transition of a simplified residential neighborhood to heating without natural gas. We used the ABM to explore socioeconomic conditions that could support the neighborhoods’ transition over 20 years while meeting the neighborhoods’ heat demand. Our illustrative example showed that through the use of STS, CAS, and an ABM, we can account for technology, actors, institutions, and their interactions while designing for thermal energy transitions in the built environment.

10 January 2018 in Logical Methods in Computer Science
Verified
Journal Article
Open access
PDF file
JEJörg Endrullis
Jörg Endrullis
HHHelle Hvid Hansen
Helle Hvid Hansen
DHDimitri Hendriks
Dimitri Hendriks
APAndrew Polonsky
Andrew Polonsky
ASAlexandra Silva
Alexandra Silva
We present a coinductive framework for defining and reasoning about the infinitary analogues of equational logic and term rewriting in a uniform, coinductive way. The setup captures rewrite sequences of arbitrary ordinal length, but it has neither the need for ordinals nor for metric convergence. This makes the framework especially suitable for formalizations in theorem provers.Comment: arXiv admin note: substantial text overlap with arXiv:1505.01128, arXiv:1306.6224

20 September 2018
Verified
Book Chapter
Closed access
PDF file
FFFrank M. V. Feys
Frank M. V. Feys
HHHelle Hvid Hansen
Helle Hvid Hansen
LMLawrence S. Moss
Lawrence S. Moss

9 September 2015 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
HHHelle Hvid Hansen
Helle Hvid Hansen
CKClemens Kupke
Clemens Kupke
We present a coalgebraic generalisation of Fischer and Ladner's Propositional Dynamic Logic (PDL) and Parikh's Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a monad T, and modalities are interpreted via a predicate lifting \^I whose transpose is a monad morphism from T to the neighbourhood monad. In this paper, we show that if the monad T carries a complete semilattice structure, then we can define an iteration construct, and suitable notions of diamond-likeness and box-likeness of predicate-liftings which allows for the definition of an axiomatisation parametric in T, \^I and a chosen set of pointwise program operations. As our main result, we show that if the pointwise operations are "negation-free" and Kleisli composition left-distributes over the induced join on Kleisli arrows, then this axiomatisation is weakly complete with respect to the class of standard models. As special instances, we recover the weak completeness of PDL and of dual-free Game Logic. As a modest new result we obtain completeness for dual-free GL extended with intersection (demonic choice) of games.Comment: In Proceedings FICS 2015, arXiv:1509.0282