Handbook of theoretical computer science (vol. B)
Theory of cellular automata: a survey
Theoretical Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Goal specification, non-determinism and quantifying over policies
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Non-monotonic temporal logics for goal specification
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Hi-index | 0.00 |
Cellular Automata (CA), although has been applied successfully in many applications, was usually only adopted as a strategy for complex system modeling instead of a uniform and concrete simulation model. Moreover, it is very weak in representing global, spatial or temporal factors, which are necessary in urban growth simulations. Motivated by these facts and based on the idea of CA, the language $\mathcal {L}_{UG}$ is proposed to represent the urban growing process. $\mathcal {L}_{UG}$ is a language of a fragment of FOLTL, and the following statements about it hold: firstly, any urban growing process is representable in $\mathcal {L}_{UG}$; and secondly $\mathcal {L}_{UG}$ is more expressive than CA.