Reasoning over networks by symbolic methods

DOI10.1007/S002000050123MaRDI QIDQ1304767zbMATH OpenOpenAlexFDO

Authors Thomas Sturm

Publication date 8 March 2000

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002000050123

zbMATH Keywords

analysis, sizing, and error diagnosis of physical networksautomatic reasoningelectrical networkserror detectionnetwork analysisquantifier elimination procedurereal quantifier eliminationtest point

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Applications of model theory (03C98) Symbolic computation and algebraic computation (68W30) Analytic circuit theory (94C05)

Recommendations

• scientific article; zbMATH DE number 1302474
• Simulation and optimization by quantifier elimination
• A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications

Cited in

(6)

• Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package.
• Linear problems in valued fields
• Quantified constraints under perturbation
• Quantified set inversion algorithm with applications to control
• On network models and the symbolic solution of network equations.
• Better answers to real questions

Describes a project that uses

Uses Software

• REDLOG
• QEPCAD
• GUARDIAN

This page was built for publication: Reasoning over networks by symbolic methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304767)