Analysis of discrete event coordination

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

Volumn 430 LNCS, Issue , 1990, Pages 414-453

  Kurshan, R P ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Coordination analysis; Formal verification; Homomorphism; Reduction; Refinement

Indexed keywords

FELT; FORMAL VERIFICATION; REDUCTION;

ANALYSIS ALGORITHMS; COMPONENT STATE; COORDINATION ANALYSIS; HARDWARE AND SOFTWARE; HOMOMORPHISM; REFINEMENT; STATE MACHINE MODELS; SYSTEM COMPONENTS;

AUTOMATA THEORY;

EID: 85031714668     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52559-9_74     Document Type: Conference Paper

References (24)

1. M. O. Rabin, D. Scott, “Finite Automata and their Decisions Problems”, IBM J. Res. and Dev. 3 (1959) 114-125. (Reprinted in [Mo64] 63-91.)
2. M. L. Tsetlin, “Non-primitive Circuits” (in Russian) Problemy Kibernetiki 2 (1959).
3. J. R. Büchi, “On a Decision Method in Restricted Second-Order Arithmetic”, Proc. Internat. Cong, on Logic, Methodol. and Philos, of Sei., 1960, 1-11 (Stanford Univ. Press, 1962).
4. M. O. Rabin, “Decidability of Second-Order Theories and Automata on Infinite Trees”, Trans. Amer. Math. Soc. 141 (1969) 1-35.
5. M. O. Rabin, Automata on Infinite Objects and Church’s Problem. Amer. Math. Soc., 1972.
6. Y. Choueka, “Theories of Automata on oo-Tapes: A Simplified Approach”, J. Comput. Syst. Sei. 8 (1974), 117-141.
7. P. Haimos, Lectures on Boolean Algebras, Springer-Verlag, N.Y., 1974.
8. B. Gopinath, R. P. Kurshan, “The Selection/Resolution Model of Coordinating Concurrent Processes”, internal AT&T report.
9. S. Aggarwal, R. P. Kurshan, K. K. Sabnani, “A Calculus for Protocol Specification and Validation” in Protocol Specification, Testing and Verification, III, North-Holland, 1983, 19-34.
10. D. L. Dill, E. M. Clarke, “Automatic Verification of Asynchronous Circuits Using Temporal Logic”, Proc. Chapel Hill Conf. VLSI, Computer Sei. Press (1985) 127-143.
11. R. P. Kurshan, “Modelling Concurrent Processes”, Proc. Symp. Applied Math. 3 (1985) 45-57.
12. A. P. Sistla, M. Y. Vardi, P. Wolper, “The Complementation Problem for Büchi Automata, with Applications to Temporal Logic”, in Proc. 12th Internat. Coll. on Automata, Languages and Programming, Led. Notes Comp. Sei., 1985, SpringerVerlag.
13. W. W. Wadge, E. A. Ashcroft, LUCID, The Dataflow Programming Language, Academic Press, 1985.
14. J. Katzenelson and R. P. Kurshan, “S/R: A Language For Specifying Protocols and Other Coordinating Processes”, Proc. 5th Ann. Int’l Phoenix Conf. Comput. Commun., IEEE, 1986, 286-292.
15. M. C. Brown, E. M. Clarke, “SML-A High Level Language for the Design and Verification of Finite State Machines”, in From HDL Descriptions to Guaranteed Correct Circuit Designs (D. Borrione, ed.) North-Holland (1987) 269-292.
16. I. Gertner, R. P. Kurshan, “Logical Analysis of Digital Circuits”, Proc. 8th Intn’l. Conf. Comput. Hardware Description Languages, 1987, 47-67.
17. R. P. Kurshan, “Reducibility in Analysis of Coordination”, LNCIS 103 (1987) Springer Verlag, 19-39.
18. R. P. Kurshan, “Complementing Deterministic Biichi Automata in Polynomial Time”, J. Comput. Syst. Sci. 35 (1987) 59-71.
19. P. J. Ramadge, W. M. Wonham, “Supervisory Control of a Class of Discrete-Event Processes”, SIAM J. Contr. Opt. 25 (1987) 206-230.
20. S. Safra, “On the Complexity of w-Automata”, 29th FOCS (1988) 319-327.
21. J. Barwise, “Mathematical Proofs of Computer System Correctness”, Notices AMS 36 (1989) 884-851.
22. R. P. Kurshan, K. McMillan, “A Structural Induction Theorem for Processes”, Proc. 8th ACM Symp. PODC (1989) 239-247.
23. R. P. Kurshan, K. McMillan, “Analysis of Digital Circuits Through Symbolic Reduction”, IEEE Trans. CAD/ICS, to appear.
24. Z. Har’El, R. P. Kurshan, “Software for analytical Development of Communication Protocols”, AT&T Tech. J., to appear.