English
Related papers

Related papers: Bisimulation equivalence of DAE systems

200 papers

We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time spectrum between two finite-state…

Computer Science and Game Theory · Computer Science 2023-06-22 Benjamin Bisping , David N. Jansen , Uwe Nestmann

The objective of this paper is to report some computational results for the theory of DAE stability boundary, with the aim of advancing applications in power system voltage stability studies. Firstly, a new regularization transformation for…

Systems and Control · Electrical Eng. & Systems 2025-08-06 Zhenyao Li , Yifan Yao , Deqiang Gan

This paper proposes a bisimulation theory based on multiparty session types where a choreography specification governs the behaviour of session typed processes and their observer. The bisimulation is defined with the observer cooperating…

Logic in Computer Science · Computer Science 2015-07-01 Dimitrios Kouzapas , Nobuko Yoshida

The Lie linearizability criteria are extended to complex functions for complex ordinary differential equations. The linearizability of complex ordinary differential equations is used to study the linearizability of corresponding systems of…

Classical Analysis and ODEs · Mathematics 2011-07-25 S. Ali , F. M. Mahomed , Asghar Qadir

We introduce methods for deriving analytic solutions from differential-algebraic systems of equations (DAEs), as well as methods for deriving governing equations for analytic characterization which is currently limited to very small systems…

General Mathematics · Mathematics 2021-02-05 Samiya A Alkhairy

Computationally expensive simulators, implementing mathematical models in computer codes, are commonly approximated using statistical emulators. We develop and assess novel emulation methods for systems best modelled via a chain, series or…

Methodology · Statistics 2021-08-26 Samuel E. Jackson , David C. Woods

Enabling preserving bisimilarity is a refinement of strong bisimilarity, which preserves safety as well as liveness properties. To define it properly, labelled transition systems needed to be upgraded with a successor relation, capturing…

Logic in Computer Science · Computer Science 2023-09-01 Rob van Glabbeek , Peter Höfner , Weiyou Wang

By dividing hypergeometric series representations of the inverse sine by sin^-1 (x) and integrating, new double series representations of integers and constants arise. Binomial coefficients and the sine integral are thus combined in double…

Number Theory · Mathematics 2010-09-17 John M. Campbell

The study of bifurcations of differential-algebraic equations (DAEs) is the topic of interest for many applied sciences, such as electrical engineering, robotics, etc. While some of them were investigated already, the full classification of…

Dynamical Systems · Mathematics 2022-01-13 Ivan Ovsyannikov , Haibo Ruan

We introduce the notion of a bicocycle double cross product (resp. sum) Lie group (resp. Lie algebra), and a bicocycle double cross product bialgebra, generalizing the unified products. On the level of Lie groups the construction yields a…

Quantum Algebra · Mathematics 2022-04-05 O. Esen , P. Guha , S. Sütlü

In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this paper, we give a natural definition of strong bisimulation for…

Logic in Computer Science · Computer Science 2014-05-12 Holger Hermanns , Jan Krčál , Jan Křetínský

Enabling preserving bisimilarity is a refinement of strong bisimilarity that preserves safety as well as liveness properties. To define it properly, labelled transition systems needed to be upgraded with a successor relation, capturing…

Logic in Computer Science · Computer Science 2023-09-18 Rob van Glabbeek , Peter Höfner , Weiyou Wang

We introduce a data-driven approach to computing finite bisimulations for state transition systems with very large, possibly infinite state space. Our novel technique computes stutter-insensitive bisimulations of deterministic systems,…

Logic in Computer Science · Computer Science 2024-05-27 Alessandro Abate , Mirco Giacobbe , Yannik Schnitzer

Quantum processes describe concurrent communicating systems that may involve quantum information. We propose a notion of open bisimulation for quantum processes and show that it provides both a sound and complete proof methodology for a…

Logic in Computer Science · Computer Science 2012-01-04 Yuxin Deng , Yuan Feng

Abstract differential-algebraic equations (ADAEs) of a semilinear type are studied. Theorems on the existence and uniqueness of solutions and the maximal interval of existence, on the global solvability of the ADAEs, the boundedness of…

Analysis of PDEs · Mathematics 2026-03-03 Maria Filipkovska

This presentation explains why models with a dynamical symmetry often work extraordinarily well even in the presence of large symmetry breaking interactions. A model may be a caricature of a more realistic system with a "quasi-dynamical"…

Nuclear Theory · Physics 2011-06-09 D. J. Rowe

Consider a multivariable state space system and associated transfer function G({\lambda}). The aim of this paper is to define and analyze two vector spaces of matrix pencils associated with the matrix G({\lambda}) and show that almost all…

Optimization and Control · Mathematics 2024-05-28 Avisek Bist , Namita Behera

Simulation and bisimulation metrics for stochastic systems provide a quantitative generalization of the classical simulation and bisimulation relations. These metrics capture the similarity of states with respect to quantitative…

Computer Science and Game Theory · Computer Science 2015-07-01 Krishnendu Chatterjee , Luca de Alfaro , Rupak Majumdar , Vishwanath Raman

Modern modeling languages for general physical systems, such as Modelica, Amesim, or Simscape, rely on Differential Algebraic Equations (DAE), i.e., constraints of the form f(dot{x},x,u)=0. This drastically facilitates modeling from first…

Programming Languages · Computer Science 2021-01-20 Albert Benveniste , Benoît Caillaud , Mathias Malandain

The aim of this paper is twofold. First, we introduce a new class of linearizations, based on the generalization of a construction used in polynomial algebra to find the zeros of a system of (scalar) polynomial equations. We show that one…

Numerical Analysis · Mathematics 2014-08-26 Federico Poloni
‹ Prev 1 4 5 6 7 8 10 Next ›