Article

Free access

A hierarchy of temporal properties (invited paper, 1989)

Authors:

Zohar Manna,

Amir PnueliAuthors Info & Claims

PODC '90: Proceedings of the ninth annual ACM symposium on Principles of distributed computing

Pages 377 - 410

https://doi.org/10.1145/93385.93442

Published: 01 August 1990 Publication History

PDF eReader

References

[1]

B. Alpern and F.B. Schneider, Defining liveness, In}o. Prac. I, ett. 21, 1985, pp. 181- 185.

Google Scholar

[2]

B. Alpern and F.B. Schneider, Recognizing safety and liveness, Dist. Comp. 2, 1987, pp. 117-126.

Digital Library

Google Scholar

[3]

B. Alpern and F.B. Schneider, Verifying temporal properties without temporal logic, A CM Trans. Prog. Lang. Sys. 11, 1989, pp. 147-167.

Digital Library

Google Scholar

[4]

M. Kaminski, A classification of w-regular languages, Theor. Comp. Sci. 36, 1985, pp. 217-229.

Digital Library

Google Scholar

[5]

L. Lamport, Proving the correctness of multiproeess programs, IEEE Trans. Software Engin. 3, 1977, pp. 125-143.

Digital Library

Google Scholar

[6]

L. Lamport, What good is temporal logic, Proc. IFIP 9th World Congress (R.E.A. Mason, ed.), North-Holland, 1983, pp. 657- 668.

Google Scholar

[7]

L.H. Landweber, Decision problems for w-automata, Math. Sys. Theory 4, 1969, pp. 376-384.

Crossref

Google Scholar

[8]

O. Lichtenstein, A. Pnueli, and L. Zuck, The glory of the past, Proc. Conf. Logics of Programs, Lee. Notes in Comp. Set. 193, Springer, 1985, pp. 196-218.

Digital Library

Google Scholar

[9]

Z. Manna, Mathematical Theory of Computation, McGraw-Hill, 1974.

Digital Library

Google Scholar

[10]

R. McNaughton and S. Papert, Counter Free Automata, MIT Press, 1971.

Digital Library

Google Scholar

[11]

Z. Manna and A. Pnueli, How to cook a temporal proof system for your pet language, Proc. lOih A CM Syrup. Princ. of Prog. Lang., 1983, pp. 141-154.

Digital Library

Google Scholar

[12]

Z. Manna and A. Pnueli, Adequate proof principles for invariance and liveness properties of concurrent programs, Sci. Comp. Prog. 32, 1984, pp. 257-289.

Digital Library

Google Scholar

[13]

Z. Manna and A. Pnueli, Specification and verification of concurrent programs by k/- automata, Proc. 14~h A CM Symp. Princ. of Prog. Lang., 1987, pp. 1-12.

Digital Library

Google Scholar

[14]

Z. Manna and A. Pnueli, The anchored version of the temporal framework, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, eds.), Lee. Notes in Comp. Set. 354, Springer, 1989, pp. 201-284.

Digital Library

Google Scholar

[15]

Z. Manna and A. Pnueli, Completing the temporal picture, Proc. 16th Int. Colloq. Ant. Lang. Prog., Lec. Notes in Comp. Sci. 372, Springer, 1989, pp. 534-558.

Digital Library

Google Scholar

[16]

S. Owicki and L. Lamport, Proving liveness properties of concurrent programs, A CM Trans. Prog. Lang. Sys. 4, 1982, pp. 455- 495.

Digital Library

Google Scholar

[17]

A. Pnueli, The temporal logic of programs, Proc. 18th IEEE Symp. Found. of Comp. Sci., 1977, pp. 46-57.

Digital Library

Google Scholar

[18]

M.O. Rabin, Automata on lnfinite Objects and Chute's Problem, Volume 13 of Regional Conference Series in Mathematics, Amer. Math. Soe., 1972.

Digital Library

Google Scholar

[19]

A.P. Sistla, On caracterization of safety and liveness properties in temporal logic, Proc. 4~h A CM Syrup. Princ. of Dist. Comp., 1985, pp. 39-48.

Digital Library

Google Scholar

[20]

R.S. Streett, Propositional dynamic logic of looping and converse is elementarily decidable, Inf. and Cont. 54, 1982, pp. 121-141.

Crossref

Google Scholar

[21]

K. Wagner, On w-regular sets, Inf. and Cont. 43, 1979, pp. 123-177.

Crossref

Google Scholar

[22]

P. Wolper, Temporal logic can be more expressive, Inf. and Cont. 56, 1983, pp. 72-99.

Crossref

Google Scholar

[23]

L. Zuek, Past Temporal Logic, Ph.D. thesis, Weizmann Institute, 1986.

Google Scholar

[24]

L. Zuck, Manuscript, 1987.

Google Scholar

Cited By

View all

Neyzov MKuzmin E(2024)Verification of declarative LTL-specification of control programs behaviorModeling and Analysis of Information Systems10.18255/1818-1015-2024-2-120-14131:2(120-141)Online publication date: 13-Jun-2024
https://doi.org/10.18255/1818-1015-2024-2-120-141
Esparza JRubio RSickert S(2024)Efficient Normalization of Linear Temporal LogicJournal of the ACM10.1145/365115271:2(1-42)Online publication date: 10-Apr-2024
https://dl.acm.org/doi/10.1145/3651152
Yaacov TElyasaf AWeiss G(2024)Keeping Behavioral Programs Alive: Specifying and Executing Liveness Requirements2024 IEEE 32nd International Requirements Engineering Conference (RE)10.1109/RE59067.2024.00019(91-102)Online publication date: 24-Jun-2024
https://doi.org/10.1109/RE59067.2024.00019
Show More Cited By

Index Terms

A hierarchy of temporal properties (invited paper, 1989)
1. Software and its engineering
  1. Software creation and management
    1. Software development process management
      1. Software development methods
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Concurrency control
2. Theory of computation

Recommendations

A Hierarchy of Temporal Properties
Proving temporal properties of concurrent programs: a non-temporal approach
Dynamically inferring temporal properties
PASTE '04: Proceedings of the 5th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering

Model checking requires a specification of the target system's desirable properties, some of which are temporal. Formulating a temporal property of the system based on either its abstract model or implementation requires a deep understanding of its ...

Comments

Information & Contributors

Information

Published In

PODC '90: Proceedings of the ninth annual ACM symposium on Principles of distributed computing

August 1990

411 pages

ISBN:089791404X

DOI:10.1145/93385

Chairman:
Cynthia Dwork
Univ. of Montreal, Quebec, Canada

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC90

Sponsor:

PODC90: 9th Annual ACM Symposium in Principles of Distibuted Computing

August 22 - 24, 1990

Quebec, Quebec City, Canada

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

134
Total Citations
View Citations
1,568
Total Downloads

Downloads (Last 12 months)408
Downloads (Last 6 weeks)25

Reflects downloads up to 15 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Neyzov MKuzmin E(2024)Verification of declarative LTL-specification of control programs behaviorModeling and Analysis of Information Systems10.18255/1818-1015-2024-2-120-14131:2(120-141)Online publication date: 13-Jun-2024
https://doi.org/10.18255/1818-1015-2024-2-120-141
Esparza JRubio RSickert S(2024)Efficient Normalization of Linear Temporal LogicJournal of the ACM10.1145/365115271:2(1-42)Online publication date: 10-Apr-2024
https://dl.acm.org/doi/10.1145/3651152
Yaacov TElyasaf AWeiss G(2024)Keeping Behavioral Programs Alive: Specifying and Executing Liveness Requirements2024 IEEE 32nd International Requirements Engineering Conference (RE)10.1109/RE59067.2024.00019(91-102)Online publication date: 24-Jun-2024
https://doi.org/10.1109/RE59067.2024.00019
Liu JShah ARosen EJia MKonidaris GTellex S(2024)Skill Transfer for Temporal Task Specification2024 IEEE International Conference on Robotics and Automation (ICRA)10.1109/ICRA57147.2024.10611432(2535-2541)Online publication date: 13-May-2024
https://doi.org/10.1109/ICRA57147.2024.10611432
Cimatti AGeatti LGigante NMontanari ATonetta S(2024)Fairness, assumptions, and guarantees for extended bounded response LTL+P synthesisSoftware and Systems Modeling (SoSyM)10.1007/s10270-023-01122-423:2(427-453)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s10270-023-01122-4
Chatterjee KGoharshady AGoharshady EKarrabi MŽikelić Đ(2024)Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial ProgramsFormal Methods10.1007/978-3-031-71162-6_31(600-619)Online publication date: 11-Sep-2024
https://doi.org/10.1007/978-3-031-71162-6_31
Abate AGiacobbe MRoy D(2024)Stochastic Omega-Regular Verification and Control with SupermartingalesComputer Aided Verification10.1007/978-3-031-65633-0_18(395-419)Online publication date: 26-Jul-2024
https://doi.org/10.1007/978-3-031-65633-0_18
Hylton ATsuei NRonnenberg MHwang JMallery BQuartin JLevaunt CQuail JCurry J(2023)Toward Time Synchronization in Delay Tolerant Network based Solar System Internetworking2023 IEEE Aerospace Conference10.1109/AERO55745.2023.10115764(1-20)Online publication date: 4-Mar-2023
https://doi.org/10.1109/AERO55745.2023.10115764
Zhu CButler MCirstea CHoang T(2023)A fairness-based refinement strategy to transform liveness properties in Event-B modelsScience of Computer Programming10.1016/j.scico.2022.102907225(102907)Online publication date: Jan-2023
https://doi.org/10.1016/j.scico.2022.102907
Renkin FSchlehuber-Caissier PDuret-Lutz APommellet A(2023)Dissecting ltlsyntFormal Methods in System Design10.1007/s10703-022-00407-661:2-3(248-289)Online publication date: 14-Jul-2023
https://doi.org/10.1007/s10703-022-00407-6
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations