4.2 Article

Non-standard semantics of hybrid systems modelers

Journal

JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Volume 78, Issue 3, Pages 877-910

Publisher

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcss.2011.08.009

Keywords

Hybrid systems; Hybrid systems modelers; Non-standard analysis; Non-standard semantics; Constructive semantics; Kahn process networks; Compilation of hybrid systems

Funding

  1. SYNCHRONICS large scale initiative of INRIA

Ask authors/readers for more resources

Hybrid system modelers have become a corner stone of complex embedded system development. Embedded systems include not only control components and software, but also physical devices. In this area, Simulink is a de facto standard design framework, and Modelica a new player. However, such tools raise several issues related to the lack of reproducibility of simulations (sensitivity to simulation parameters and to the choice of a simulation engine). In this paper we propose using techniques from non-standard analysis to define a semantic domain for hybrid systems. Non-standard analysis is an extension of classical analysis in which infinitesimal (the epsilon and eta in the celebrated generic sentence for all epsilon there exists eta ... of college maths) can be manipulated as first class citizens. This approach allows us to define both a denotational semantics, a constructive semantics, and a Kahn Process Network semantics for hybrid systems, thus establishing simulation engines on a sound but flexible mathematical foundation. These semantics offer a clear distinction between the concerns of the numerical analyst (solving differential equations) and those of the computer scientist (generating execution schemes). We also discuss a number of practical and fundamental issues in hybrid system modelers that, give rise to non-reproducibility of results, non-determinism, and undesirable side effects. Of particular importance are cascaded mode changes (also called zero-crossings in the context of hybrid systems modelers). (C) 2011 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
Article Computer Science, Hardware & Architecture

Solving problems on generalized convex graphs via mim-width

Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniel Paulusma

Summary: This article discusses the convexity and mim-width of bipartite graphs, and it proves that for certain families of graphs 7-t, the 7-t-convex graphs can be solved in polynomial time for NP-complete problems. It also explores the bounded and unbounded mim-width of 7-t-convex graphs for different sets 7-t.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Performance modeling and analysis for randomly walking mobile users with Markov chains

Keqin Li

Summary: In this paper, we propose a computation offloading strategy to satisfy all UEs served by an MEC and develop an efficient method to find such a strategy. By using Markov chains to characterize UE mobility and calculating the joint probability distribution of UE locations, we can obtain the average response time of UEs and predict the overall average response time of tasks. Additionally, we solve the power constrained MEC speed setting problem.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Correction Computer Science, Hardware & Architecture

Prediction, learning, uniform convergence, and scale-sensitive dimensions (vol 56, pg 174, 1998)

Peter L. Bartlett, Philip M. Long

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Fast and succinct population protocols for Presburger arithmetic

Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza

Summary: This paper presents a construction method that produces population protocols with a small number of states, while achieving near-optimal expected number of interactions, for deciding Presburger predicates.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Orienting undirected phylogenetic networks

Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple

Summary: This paper investigates the relationship between undirected and directed phylogenetic networks, and provides corresponding algorithms. The study reveals that the directed phylogenetic network is unique under specific conditions. Additionally, an algorithm for directing undirected binary networks is described, applicable to certain classes of directed phylogenetic networks.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs

Francesco Betti Sorbelli, Alfredo Navarra, Lorenzo Palazzetti, Cristina M. Pinotti, Giuseppe Prencipe

Summary: This study discusses the deployment of IoT sensors in an area that needs to be monitored. Drones are used to collect data from the sensors, but they have energy and storage constraints. To maximize the overall reward from the collected data and ensure compliance with energy and storage limits, an optimization problem called Multiple-drone Data-collection Maximization Problem (MDMP) is proposed and solved using an Integer Linear Programming algorithm.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

On the complexity of the storyplan problem

Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nollenburg, Antonios Symvonis

Summary: In this study, we investigate the problem of representing a graph as a storyplan, which is a model for dynamic graph visualization. We prove the NP-completeness of this problem and propose two parameterized algorithms as solutions. We also demonstrate that partial 3-trees always admit a storyplan and can be computed in linear time. Additionally, we show that even if the vertex appearance order is given, the problem of choosing how to draw the frames remains NP-complete.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Perpetual maintenance of machines with different urgency requirements

Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik

Summary: This passage describes the Bamboo Garden Trimming Problem and presents approximation algorithms for both Discrete BGT and Continuous BGT.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)