𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automata for the verification of monadic second-order graph properties

✍ Scribed by Bruno Courcelle; Irène Durand

Book ID
118461169
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
818 KB
Volume
10
Category
Article
ISSN
1570-8683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The monadic second-order logic of graphs
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
✍ Bruno Courcelle 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 342 KB

We consider the class US k of uniformly k-sparse simple graphs, i.e., the class of ÿnite or countable simple graphs, every ÿnite subgraph of which has a number of edges bounded by k times the number of vertices. We prove that for each k, every monadic second-order formula (intended to express a grap

Optimization methods for the verificatio
Optimization methods for the verification of second order sufficient conditions for bang–bang controls
✍ H. Maurer; C. Büskens; J.-H. R. Kim; C. Y. Kaya 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 263 KB

## Abstract It has been common practice to find controls satisfying only necessary conditions for optimality, and then to use these controls assuming that they are (locally) optimal. However, sufficient conditions need to be used to ascertain that the control rule is optimal. Second order sufficien