Linear reachability problems and minimal solutions to linear Diophantine equation systems

DOI10.1016/j.tcs.2004.07.015zbMath1071.68055OpenAlexW2150468831MaRDI QIDQ703515

Cheng Li, Gaoyan Xie, Zhe Dang

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.015

zbMATH Keywords

Timed automataReachabilityLinear Diophantine equation systemsMinimal solutionsModel-checking

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computer solution of Diophantine equations (11Y50) Specification and verification (program logics, model checking, etc.) (68Q60) Linear Diophantine equations (11D04)

Uses Software

• SPIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small solutions of linear diophantine equations
• The covering and boundedness problems for vector addition systems
• A theory of timed automata
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Presburger liveness verification of discrete timed automata.
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• A really temporal logic
• Minimal solutions of linear diophantine systems : bounds and algorithms
• Interpolants and Symbolic Model Checking
• On Context-Free Languages

This page was built for publication: Linear reachability problems and minimal solutions to linear Diophantine equation systems