Analysis of synchronous and asynchronous cellular automata using abstraction by temporal logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2998, Issue , 2004, Pages 7-21

  Hagiya, Masami ^a   Takahashi, Koichi ^b   Yamamoto, Mitsuharu ^c   Sato, Takahiro ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^c CHIBA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CELLS; CYTOLOGY; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; TEMPORAL LOGIC;

ASYNCHRONOUS CELLULAR AUTOMATON; LINKED STRUCTURES; REWRITE RULES; TEMPORAL FORMULAE; TRANSITION SYSTEM;

COMPUTER CIRCUITS;

EID: 35048845999     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24754-8_2     Document Type: Article

References (13)

1. Takahashi, K., Hagiya, M.: Abstraction of link structures by regular expressions and abstract model checking of concurrent garbage collection,. In: First Asian Workshop on Programming Languages and Systems, National University of Singapore (2000) 1-8 http://nicosia.is.s.u-tokyo.ac.jp/members/hagiya.html.
2. Takahashi, K., Hagiya, M.: Formal proof of abstract model checking of concurrent garbage collection. In Kamareddine, F., ed.: Workshop on Thirty Five years of Automath, Informal Proceedings, Heriot-Watt University (2002) 115-126 http://nicosia.is.s.u-tokyo.ac.jp/members/hagiya.html.
3. Takahashi, K., Hagiya, M.: Abstraction of graph transformation using temporal formulas. In: Workshop on Model-Checking for Dependable Software-Intensive Systems, International Conference on Dependable Systems and Networks, DSN2003. (2003) http://nicosia.is.s.u-tokyo.ac.jp/members/hagiya.html.
4. Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Logic of Programs: Workshop, Yorktown Heights. Volume 131 of Lecture Notes in Computer Science., Springer Verlag (1981) 52-71
5. Emerson, E.A., Clarke, E.M.: Characterizing correctness properties of parallel programs using fixpoints. In: Automata, Languages and Programming. Volume 85 of Lecture Notes in Computer Science., Springer Verlag (1980) 169-180
6. S. Graf, H. Saidi: Construction of abstract state graphs with PVS. In Grumberg, O., ed.: Proc. 9th INternational Conference on Computer Aided Verification (CAV'97). Volume 1254., Springer Verlag (1997) 72-83
7. Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Symposium on Principles of Programming Languages. (2002) 58-70
8. Vardi, M.Y.: Reasoning about the past with two-way automata. In: Automata, Languages and Programming ICALP 98. Volume 1443 of Lecture Notes in Computer Science., Springer-Verlag (1998) 628-641
9. von Neumann, J.: Theory of Self-Reproducing Automata. Urbana: University of Illinois Press (1966)
10. Wolfram, S.: Cellular Automata and Complexity. Addison-Wesley (1994)
11. Kozen, D., Tiuryn, J.: Logic of programs. In: Formal Models and Sematics. Volume B of Handbook of Theoretical Computer Science. Elsevier Science Publishers (1990) 789-840
12. Andréka, H., Németi, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic 27 (1998) 217-274
13. Alur, R., Courcoubetis, C., Dill, D.: Model checking for real-time systems. In: Proceedings of the Fifth Annual Symposium on Logic in Computer Science, IEEE Computer Society Press (1990) 414-425