ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
On characterization of safety and liveness properties in temporal logic
Full text PdfPdf (576 KB)
Source Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the fourth annual ACM symposium on Principles of distributed computing table of contents
Minaki, Ontario, Canada
Pages: 39 - 48  
Year of Publication: 1985
ISBN:0-89791-168-7
Author
A. P. Sistla  University of Massachusetts, Amherst, MA
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 49,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/323596.323600
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Aravinda Prasad Sistla, Theoretical issues in the design and verification of distributed systems, 1983
 
2
A.Pnueli, The temporal logic of programs, Proceedings of eighteenth Symposium on Foundations of Computer Science, Providence, RI(1977).
 
3
$.Owlcki, L.Lamport, Proving Llveness properties of Concurrent Programs, Stanford University technical report (1980).
4
A. P. Sistla , E. M. Clarke, The complexity of propositional linear temporal logics, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.159-168, May 05-07, 1982, San Francisco, California, United States  [doi>10.1145/800070.802189]
 
5
B.Alpern, F.Schneider, Defining Liveness, October 1984.
 
6
P.Wolper, Temporal Logic can be more expressive, Information and Control, 1984.
 
7
E.A.Emerson, A.P.Slstla, Deciding Full Branching Time Logic, Information and Control, Vol.61 ,No.3,June 1984.

CITED BY  3
Jan Chomicki , Damian Niwiński, On the feasibility of checking temporal integrity constraints, Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.202-213, May 25-28, 1993, Washington, D.C., United States
Simplice Djoko Djoko , Rémi Douence , Pascal Fradet, Aspects preserving properties, Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, January 07-08, 2008, San Francisco, California, USA
Zohar Manna , Amir Pnueli, A hierarchy of temporal properties (invited paper, 1989), Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.377-410, August 22-24, 1990, Quebec City, Quebec, Canada

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Temporal logic

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS


General Terms:
Design, Performance, Theory, Verification

Collaborative Colleagues:
A. P. Sistla: colleagues

Peer to Peer - Readers of this Article have also read:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player