Article

Free access

Interleaving set temporal logic

Authors:

Shmuel Katz,

Doron PeledAuthors Info & Claims

PODC '87: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing

Pages 178 - 190

https://doi.org/10.1145/41840.41855

Published: 01 December 1987 Publication History

PDF eReader

References

[1]

K.Abrahamson, Decidability and expressiveness of logics of programs, Ph.D. thesis, University of Washington at Seattle, 1980.

Digital Library

Google Scholar

[2]

K.R.Apt, N.Francez, S.Katz, Appraising fairness in Languages for distributed programming, 14th Symposium on principles of programming languages, Munich, W.Germany, 1987.

Digital Library

Google Scholar

[3]

K.R.Apt, N.Francez, W.P.de Roever, A proof system for Communicating Sequential Processes, ACM TOPLAS Vol 2(1980), 359- 385.

Digital Library

Google Scholar

[4]

M.Ben-Ari, Z.Manna, A.Pnueli, The temporal logic of branching time, Acta informatica 20(1983), 207-226.

Google Scholar

[5]

E.Best, B.RandeU, A formal model of atomicity in asynchronous systems, Acta informatica, 16(1981), 93-124.

Google Scholar

[6]

L.Bouge, Repeated snapshots in synchronous systems and their implementation in CSP, Tech. Rep. No 84, L.I.T.P., Universite Paris 7, Paris, October 1985.

Google Scholar

[7]

K.M.Chandy, L.Lamport, Distributed snapshots" determining global states of distributed systems, ACM Transactions on computer systems, Vol.3,No.l, 63-75

Digital Library

Google Scholar

[8]

E.M.Clarke, E.A.Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Logics of programs, Workshop, Yorktown Heights, New York, 1981, Lectttre notes in Computer Science, Springer-Verlag, 131, 52-71.

Digital Library

Google Scholar

[9]

C.Courcoubetis, M.Y.Vardi, P.Wolper, Reasoning about fair concurrent programs, 18th ACM Symposium on theory of computing, Berkeley, California, 1986, 283-294.

Digital Library

Google Scholar

[10]

E.W.Dijkstra, The distributed snapshot algorithm of K.M.Chandy and L.Lamport, EWD864a.

Google Scholar

[11]

Tz.Elrad, N.Francez, Decomposition of distributed programs into communication-closed layers, Science of computer programming 2(1982), 155-173

Google Scholar

[12]

E.A.Emerson, Alternative semantics for temporal logic, Theoretical computer science 26(1983), 121-130.

Google Scholar

[13]

E.A.Emerson, LY.Halpem, "Sometimes" and "not never" revisited: on branching versus linear time temporal logic, Journal of the ACM 33(1986), 151-178.

Digital Library

Google Scholar

[14]

E.A.Emerson, J.Y.Halpem, Decision procedures and expressiveness in temporal logic of branching time, Journal of computer and system science, 30, 1985, 1-24.

Digital Library

Google Scholar

[15]

E.A.Emerson, C.L.Lei, Temporal model checking under generalized fairness constraints, Proc. 18th Hawaii international conference on system sciences, 1985, 277-288.

Google Scholar

[16]

E.A.Emerson, C.L.Lei, Modalities for model checking: Branching time strikes back, Proc. 12th ACM Symposium on principles of programming languages, New Orleans, Louisiana, 1985, 84-96.

Digital Library

Google Scholar

[17]

N.Francez, Fairness, texts and monographs in computer science ('D. Gries, ed.), Springer- Verlag, New York, 1986.

Digital Library

Google Scholar

[18]

E.C.R.Hehner, R.K.Shyamasundar, An implementation of P and V, Information processing letters, 12(1981), 196-198.

Google Scholar

[19]

M.P.Herlihy, J.M.Wing. Axioms for concurrent objects, Fourteenth Symposium on principles of programming languages, Munich, W.Germany, 1987, 13-26.

Digital Library

Google Scholar

[20]

C.A.R.Hoare, Communicating sequential processes, Communication of the ACM, 21 (1978), 666-677.

Digital Library

Google Scholar

[21]

L. Lamport, Paradigms for distributed programs: computing global states, In: Distributed systems - Methods and tools for specification, An advanced course, Munich, 1985, Edited by M.Paul and HJ.Siegert, Lecture notes in Computer Science, Springer-Verlag, 190, 454-468.

Digital Library

Google Scholar

[22]

L. Lamport, What good is temporal logic? Proceedings of IFIP 9~ world congress, Paris, France, September 1983, 657-668.

Google Scholar

[23]

L. Lamport, On interprocess communication, Distributed computing 1(1986), 77-85.

Google Scholar

[24]

L. Lamport, What it means for a concurrent program to satisfy a specification: why no one has specified priority, Proceedings of the 12th ACM Symposium on principles of programming languages, New Orleans, Louisiana, 1985, 78-83.

Digital Library

Google Scholar

[25]

L.Lamport, Time, clocks, and the ordering of events in a distributed system, Communication of the ACM, 21 (1978), 558-565.

Digital Library

Google Scholar

[26]

L.Lamport, Atomicity in distributed algorithms, Manuscript, 24 Jan 1987.

Google Scholar

[27]

D. Lehman, A.Pnueli, J.Stavi, Impartiality, jus tice, fairness: the ethics of concurrent termination, Proceedings of 8a ICALP, Acco, Israel, 3ul, 1981, Lecture notes in computer science, Springer-Verlag, 115 (O. Kariv and S. Even, eds.), 1981.

Digital Library

Google Scholar

[28]

D.Lehrnan, S.Shelah, Reasoning with time and chance. Information and control 53(1982), 165-198.

Google Scholar

[29]

Z. Manna, A.Pnueli, Verification of concurrent programs: the temporal framework, In: The correctness problem in computer science, Edited by R.S.Boyer & J.S.Moore, 1981, 215- 273.

Google Scholar

[30]

Z. Manna, A.Pnueli, Adequate proof principles for invariance and liveness properties of concurrent programs, Science of computer programming 4(I984), 257-289.

Digital Library

Google Scholar

[31]

Z. Manna, A.Pnueli, How to cook a temporal proof system for your pet language, 10th Symposium on principles of programming languages, Austin, Texas, 1983, 141-154.

Digital Library

Google Scholar

[32]

S. Pinter and P. Wolper, A temporal logic for reasoning about partially ordered computations, Proceedings of 3rd ACM Principles of distributed computing, Vancouver, B.C., August 1984, 28-37.

Digital Library

Google Scholar

[33]

G.Plotldn, An operational semantics for CSP, in: Formal description of programming concepts Ii, Bjomer (ed.), North Holland publishing company, IFIP (1983), 199-223.

Google Scholar

[34]

V.Pratt, Modeling concurrency with partial orders, International journal of parallel programming, 15(1986), 33-71.

Crossref

Google Scholar

[35]

W.Reisig, Partial order semantics versus interleaving semantics for CSP like languages and its impact on fairness, 11th ICALP, Antwerp, Belgium, 1984, Lecture notes in Computer Science, Springer-Verlag, 172, 403-413.

Digital Library

Google Scholar

Cited By

View all

Moszkowski BGuelev D(2017)An application of temporal projection to interleaving concurrencyFormal Aspects of Computing10.1007/s00165-017-0417-329:4(705-750)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1007/s00165-017-0417-3
Reisig W(2005)Towards a temporal logic for causality and choice in distributed systemsLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency10.1007/BFb0013037(603-627)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0013037
Katz SPeled D(2005)An efficient verification method for parallel and distributed programsLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency10.1007/BFb0013032(489-507)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0013032
Show More Cited By

Index Terms

Interleaving set temporal logic
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles
2. Theory of computation

Recommendations

Type-2 Fuzzy Logic System and Level Set
SKG '07: Proceedings of the Third International Conference on Semantics, Knowledge and Grid

The basic theory of a type-2 Fuzzy Logic Systems (FLSs) is presented, an efficient and simplified method to convert a type-2 fuzzy to a crisp result in a type-2 FLS is proposed, which is a straightforward way for the liberation of computation complexity,...
Fuzzy Temporal Logic on Fuzzy Temporal Constraint Networks
FSKD '09: Proceedings of the 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 06

The aim of this work is to integrate the ideas of flexibility and uncertainty into Allen’s interval-based temporal logic[1], defining a new formalism which extends classical interval Algebra. We refer to fuzzy temporal constraint satisfaction problem, ...
Fuzzy branching temporal logic

Intelligent systems require a systematic way to represent and handle temporal information containing uncertainty. In particular, a logical framework is needed that can represent uncertain temporal information and its relationships with logical formulae. ...

Comments

Information & Contributors

Information

Published In

PODC '87: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing

December 1987

304 pages

ISBN:089791239X

DOI:10.1145/41840

Editor:
Fred B. Schneider

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 December 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC87

Sponsor:

PODC87: Sixth Annual ACM Symposium on Principles of Distributed Computing

August 10 - 12, 1987

British Columbia, Vancouver, Canada

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
426
Total Downloads

Downloads (Last 12 months)60
Downloads (Last 6 weeks)9

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Moszkowski BGuelev D(2017)An application of temporal projection to interleaving concurrencyFormal Aspects of Computing10.1007/s00165-017-0417-329:4(705-750)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1007/s00165-017-0417-3
Reisig W(2005)Towards a temporal logic for causality and choice in distributed systemsLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency10.1007/BFb0013037(603-627)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0013037
Katz SPeled D(2005)An efficient verification method for parallel and distributed programsLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency10.1007/BFb0013032(489-507)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0013032
van Benthem J(2005)Time, logic and computationLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency10.1007/BFb0013020(1-49)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0013020
Fokkinga MPoel MZwiers J(2005)Modular completeness for Communication Closed LayersCONCUR'9310.1007/3-540-57208-2_5(50-65)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-57208-2_5
Penczek W(2005)Axiomatizations of temporal logics on trace systemsSTACS 9310.1007/3-540-56503-5_45(452-462)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-56503-5_45
Janssen WPoel MZwiers J(2005)Action systems and action refinement in the development of parallel systemsCONCUR '9110.1007/3-540-54430-5_96(298-316)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-54430-5_96
Nicola RFerrari G(2005)Observational logics and concurrency modelsFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-53487-3_53(301-315)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-53487-3_53
Penczek W(2005)A concurrent branching time temporal logicCSL '8910.1007/3-540-52753-2_49(337-354)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-52753-2_49
Stomp F(2005)A derivation of a broadcasting protocol using sequentially phased reasoningStepwise Refinement of Distributed Systems Models, Formalisms, Correctness10.1007/3-540-52559-9_84(696-730)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-52559-9_84
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

Type-2 Fuzzy Logic System and Level Set

Fuzzy Temporal Logic on Fuzzy Temporal Constraint Networks

Fuzzy branching temporal logic

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Type-2 Fuzzy Logic System and Level Set

Fuzzy Temporal Logic on Fuzzy Temporal Constraint Networks

Fuzzy branching temporal logic

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations