Timed tree automata with an application to temporal logic
β Scribed by Salvatore La Torre; Margherita Napoli
- Publisher
- Springer-Verlag
- Year
- 2001
- Tongue
- English
- Weight
- 210 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Based on the discrete definition of biological regulatory networks developed by ReneΒ΄Thomas, we provide a computer science formal approach to treat temporal properties of biological regulatory networks, expressed in computational tree logic. It is then possible to build all the models satisfying a s
Up to categorical equivalence, abelian lattice-ordered groups with strong unit coincide with Chang's MV-algebrasαthe Lindenbaum algebras of the infinite-valued Εukasiewicz calculus. While the property of being a strong unit is not definable even in first-order logic, MV-algebras form an equational c