Time-constrained automata

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

Volumn 527 LNCS, Issue , 1991, Pages 408-423

  Merritt, Michael ^a   Modugno, Francesmary ^b   Tuttle, Mark R ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATION THEORY;

AUTONOMOUS COMPONENTS; BOUNDED FAIRNESS; COMPOSITIONAL MODELING; CONCURRENT AND DISTRIBUTED SYSTEMS; CONCURRENT SYSTEMS; FUNDAMENTAL PROPERTIES; REAL-TIME COMPUTATIONS; TIMING PROPERTIES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84936039193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54430-5_103     Document Type: Conference Paper

References (28)

1. Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking for real-time systems. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, pages 414-425. IEEE, June 1990.
2. Rajeev Alur and Thomas A. Henzinger. Real-time logics: Complexity and expressiveness. In Proceedings of the Sth Annual IEEE Symposium on Logic in Computer Science, pages 390-401. IEEE, June 1990.
3. Hagit Attiya and Nancy Lynch. Time bounds for real-time process control in the presence of timing uncertainty. Technical Memo MIT/LCS/TM-403, MIT Laboratory for Computer Science, July 1989.
4. Bard Bloom. Constructing two-writer atomic registers. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pages 249-259. ACM, August 1987.
5. K. Mani Chandy and Jayadev Misra. The drinking philosophers problem. ACM Transactions on Programming Languages and Systems, 6(4):632-646,1984.
6. David L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. PhD thesis, Department of Computer Science, Carnegie Mellon University, February 1988. Available as Technical Report CMU-CS-88-119.
7. Nissim Francez. Fairness. Springer-Verlag, Berlin, 1986.
8. Richard Gerber and Insup Lee. CCSR: A calculus for communicating shared resources. In J. C. M. Baeten and J. W. Klop, editors, Lecture Notes in Computer Science, volume 458, Proceedings of Concur '90, pages 263-277. Springer-Verlag, August 1990.
9. Maurice Herlihy. Impossibility and universality results for wait-free synchronization. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pages 276-290. ACM, August 1988.
10. Eyal Harel, Oma Lichtenstein, and Amir Pnueli. Explicit clock temporal logic. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, pages 401-413. IEEE, June 1990.
11. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hal International, Englewood Cliffs, New Jersey, 1985.
12. Bengt Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Uppsala University, Uppsala, Sweden, 1987. Published by Direkt Offset, Nyström & Co AB, Uppsala.
13. R. Koymans, R. K. Shyamasundar, W. P. de Roever, R. Gerth, and S. Arun-Kumar. Compositional semantics for real-time distributed computing. Information and Computation, 79:210-256,1988.
14. Nancy A. Lynch and Hagit Attiya. Using mappings to prove timing properties. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pages 265-280. ACM, August 1990.
15. Leslie Lamport. A temporal logic of actions. Research Report 57, DEC Systems Research Center, January 1991.
16. Harry R. Lewis. A logic of concrete time intervals. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, pages 380-389. IEEE, June 1990. Also available at Harvard Technical Report TR-07-90.
17. Nancy A. Lynch and Michael J. Fischer. On describing the behavior and implementation of distributed systems. Theoretical Computer Science, 13(l):17-43, January 1981.
18. Nancy A. Lynch and Michael Merritt. Introduction to the theory of nested transactions. Theoretical Computer Science, 62:123-185, 1988. Earlier versions appeared in Proceedings of the International Conference on Database Theory, 1986, and as MIT Technical Report MIT/LCS/TR-367.
19. Nancy A. Lynch, Yishay Mansour, and Alan Pekete. Data link layer: Two impossibility results. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pages 149-170. ACM, August 1988. Also available as MIT Technical Report MIT/LCS/TM-355.
20. Nancy A. Lynch, Michael Merritt, William E. Weihl, and Alan Fekete. A theory of atomic transactions. In Proceedings of the International Conference on Database Theory, 1988. Also available as MIT Technical Memo MIT/LCS/TM-362.
21. Nancy A. Lynch and Mark R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pages 137-151. ACM, August 1987. A full version is available as MIT Technical Report MIT/LCS/TR-387.
22. Nancy A. Lynch and Mark R. Tuttle. An introduction to input/output automata. CWI-Quarterly, 2(3), 1989. Also available as MIT Technical Memo MIT/LCS/TM-373.
23. Robin Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science 92. Springer-Verlag, Berlin, 1980.
24. Paron Moller and Chris Tofts. A temporal calculus of communicating systems. In J. C. M. Baeten and J. W. Klop, editors, Lecture Notes in Computer Science, volume 458, Proceedings of Concur '90, pages 401-415. Springer-Verlag, August 1990.
25. A. Udaya Shankar and Simon S. Lam. Time-dependent distributed systems: Proving safety, liveness and real-time properties. Distributed Computing, pages 61-79,1987.
26. Mark R. Tuttle. Hierarchical correctness proofs for distributed algorithms. Master’s thesis, Massachusetts Institute of Technology, Laboratory for Computer Science, April 1987. Available as MIT Technical Report MIT/LCS/TR-387.
27. Jennifer L. Welch, Leslie Lamport, and Nancy A. Lynch. A lattice-structured proof of a minimum spanning tree algorithm. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pages 28-43. ACM, August 1988.
28. Wang Yi. Real-time behaviour of asynchronous agents. In J. C. M. Baeten and J. W. Klop, editors, Lecture Notes in Computer Science, volume 458, Proceedings of Concur '90, pages 502-520. Springer-Verlag, August 1990.