✦ LIBER ✦

Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas

✍ Scribed by Sebastian Danicic; Robert M. Hierons; Michael R. Laurence

Book ID: 113720743
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 573 KB
Volume: 80
Category: Article
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2010.08.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equivalence of linear, free, liberal, st

Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time

✍ Sebastian Danicic; Mark Harman; Rob Hierons; John Howroyd; Michael R. Laurence 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Equivalence of conservative, free, linea

Equivalence of conservative, free, linear program schemas is decidable

✍ Michael R. Laurence; Sebastian Danicic; Mark Harman; Rob Hierons; John Howroyd 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 312 KB

A program schema deÿnes a class of programs, all of which have identical statement structures, but whose expressions may di er. We prove that given any two structured schemas which are conservative, linear and free, it is decidable whether they are equivalent.

Model-free optimal control design for a

Model-free optimal control design for a class of linear discrete-time systems with multiple delays using adaptive dynamic programming

✍ Zhang, Jilie; Zhang, Huaguang; Luo, Yanhong; Feng, Tao 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 595 KB