Pith. sign in

REVIEW

Bisimulation equivalence of DAE systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1512.04689 v3 pith:TPZQ5TJB submitted 2015-12-15 math.DS

Bisimulation equivalence of DAE systems

classification math.DS
keywords bisimulationsystemslineargeneralrelationabstractionalgorithmcase
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper the notion of bisimulation relation for linear input-state-output systems is extended to general linear differential-algebraic (DAE) systems. Geometric control theory is used to derive a linear-algebraic characterization of bisimulation relations, and an algorithm for computing the maximal bisimulation relation between two linear DAE systems. The general definition is specialized to the case where the matrix pencil $sE - A$ is regular. Furthermore, by developing a one-sided version of bisimulation, characterizations of simulation and abstraction are obtained.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.