Article

Free access

Liveness properties as convergence in metric spaces

Authors:

Pierpaolo Degano,

Ugo MontanariAuthors Info & Claims

STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing

Pages 31 - 38

https://doi.org/10.1145/800057.808663

Published: 01 December 1984 Publication History

PDF eReader

Abstract

Four liveness properties of concurrent programs are characterized by the fact that their computations, represented as sequences of partial orderings of events, are convergent in suitable metric spaces. The corresponding topological completions do not therefore contain the infinite computations without the desired properties. The properties are: vitality (i.e. every running process will eventually produce an observable event), global and local fairness, and deadlock freedom. This approach proves fruitful since a universal scheduler is defined, which, when supplied with a particular metric, generates all and only convergent computations. Thus, this scheduler can be used to generate all and only vital, fair or deadlock free computations.

References

[1]

Owicki,S., and Lamport,L. Proving Liveness Properties of Concurrent Programs, ACM TOPLAS 4, 3 (1982), pp. 455-495.

Digital Library

Google Scholar

[2]

Manna,Z., and Pnueli,A. How to Cook a Temporal Proof System for your Pet Language, Proc. 10th POPL, Austin, Texas, 1983.

Digital Library

Google Scholar

[3]

Park,D. On the Semantics of Fair Parallelism, In: Abstract Software Specifications (D. Bjørner Ed.), LNCS, 86, Springer-Verlag, Berlin, 1980, pp. 504-526.

Digital Library

Google Scholar

[4]

Plotkin,G.D. A Powerdomain for Countable Non-determinism, Proc. 9th ICALP (M. Nielsen and E.M. Schmidt Eds), LNCS, 140, Springer-Verlag, Berlin, 1982, pp. 418-428.

Digital Library

Google Scholar

[5]

Nivat,M. Behaviours of Processes and Synchronized Systems of Processes, In: Theoretical Foundations of Programming Methodology (M. Broy and G. Schmidt Eds), Reidel Dodrecht, 1982, pp. 473-550.

Google Scholar

[6]

de Bakker,J.W., and Zucker,J.I. Denotational Semantics of Concurrency, Proc. 14th Symp. on Theory of Computing, pp. 153-158.

Digital Library

Google Scholar

[7]

Milner,R. Calculi for Synchrony and Asynchrony, Internal Report CSR-104-82, Edinburgh University, Edinburgh, February 1982.

Google Scholar

[8]

Castellani,I., Franceschi,P., and Montanari,U. Labeled Event Structures: A Model for Observable Concurrency, Proc. IFIP TC 2 - Working Conference: Formal Description of Programming Concepts II (D. Biørner Ed.), Garmisch - Partenkirchen, 1982, North-Holland, Amsterdam, 1983, pp. 383-399.

Google Scholar

[9]

Castellani,I., and Montanari,U. Graph Grammars for Distributed Systems, Proc. 2nd Int. Workshop on Graph-Grammars and their Applications to Computer Science (H. Ehrig, M.A. Nagel, and G. Rozenberg Eds), Haus Ohrbech, Germany, October 1982, LNCS, 153, Springer-Verlag, Berlin, 1983, pp. 20-38.

Digital Library

Google Scholar

[10]

Degano,P., and Montanari,U. A Model for Distributed Systems Based on Graph Rewriting, Note Cnet 111, Computer Science Dept., Univ. of Pisa, Pisa 1983.

Google Scholar

[11]

Pratt,V.R. On the Composition of Processes, Proc. 9th POPL, Albuquerque, New Mexico, 1982.

Digital Library

Google Scholar

[12]

Degano,P., and Montanari, U. Fair Concurrent Histories as Limit Partial Orderings of Events, Internal Report S-83-19, Computer Science Dept., Univ. of Pisa, Pisa 1983.

Google Scholar

[13]

Milner,R. A Calculus of Communicating Systems, LNCS, 92, Springer-Verlag, Berlin, 1980.

Digital Library

Google Scholar

Cited By

View all

Bodei CFerrari GPriami C(2015)Pierpaolo DeganoEssays Dedicated to Pierpaolo Degano on Programming Languages with Applications to Biology and Security - Volume 946510.5555/2963891.2963892(1-6)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.5555/2963891.2963892
Bodei CFerrari GPriami C(2015)Pierpaolo DeganoProgramming Languages with Applications to Biology and Security10.1007/978-3-319-25527-9_1(1-6)Online publication date: 20-Nov-2015
https://doi.org/10.1007/978-3-319-25527-9_1
Rao S(2009)A foundation for system safety using predicate logic2009 3rd Annual IEEE Systems Conference10.1109/SYSTEMS.2009.4815769(42-47)Online publication date: Mar-2009
https://doi.org/10.1109/SYSTEMS.2009.4815769
Show More Cited By

Index Terms

Liveness properties as convergence in metric spaces
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Process validation
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Deadlocks
2. Theory of computation
  1. Models of computation
    1. Concurrency
      1. Parallel computing models
  2. Semantics and reasoning
    1. Program semantics
      1. Denotational semantics

Recommendations

Convergence Properties of Feasible Descent Methods for Solving Variational Inequalities in Banach Spaces

This work is concerned with the analysis of convergence properties of feasible descent methods for solving monotone variational inequalities in Banach spaces.
Enhanced metric regularity and Lipschitzian properties of variational systems

This paper mainly concerns the study of a large class of variational systems governed by parametric generalized equations, which encompass variational and hemivariational inequalities, complementarity problems, first-order optimality conditions, and ...
Properties of several metric spaces of fuzzy sets
Abstract
This paper discusses the properties of the spaces of fuzzy sets in a metric space equipped with the endograph metric and the sendograph metric, respectively. We first give some relations among the endograph metric, the sendograph metric and the Γ-...

Comments

Information & Contributors

Information

Published In

STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing

December 1984

547 pages

ISBN:0897911334

DOI:10.1145/800057

Chairman:
Richard DeMillo

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 1984

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
262
Total Downloads

Downloads (Last 12 months)41
Downloads (Last 6 weeks)13

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bodei CFerrari GPriami C(2015)Pierpaolo DeganoEssays Dedicated to Pierpaolo Degano on Programming Languages with Applications to Biology and Security - Volume 946510.5555/2963891.2963892(1-6)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.5555/2963891.2963892
Bodei CFerrari GPriami C(2015)Pierpaolo DeganoProgramming Languages with Applications to Biology and Security10.1007/978-3-319-25527-9_1(1-6)Online publication date: 20-Nov-2015
https://doi.org/10.1007/978-3-319-25527-9_1
Rao S(2009)A foundation for system safety using predicate logic2009 3rd Annual IEEE Systems Conference10.1109/SYSTEMS.2009.4815769(42-47)Online publication date: Mar-2009
https://doi.org/10.1109/SYSTEMS.2009.4815769
Gorrieri R(2008)Ugo Montanari and Concurrency TheoryConcurrency, Graphs and Models10.1007/978-3-540-68679-8_24(403-408)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1007/978-3-540-68679-8_24
Nicola RDegano PMeseguer J(2008)Ugo Montanari in a NutshellConcurrency, Graphs and Models10.1007/978-3-540-68679-8_1(1-8)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1007/978-3-540-68679-8_1
Degano PDe Nicola RMontanari U(2005)Partial ordering derivations for CCSFundamentals of Computation Theory10.1007/BFb0028836(520-533)Online publication date: 3-Aug-2005
https://doi.org/10.1007/BFb0028836
de Bakker JKok JMeyer JOlderog EZucker J(2005)Contrasting themes in the semantics of imperative concurrencyCurrent Trends in Concurrency10.1007/BFb0027040(51-121)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0027040
Klarlund N(2005)Liminf progress measuresMathematical Foundations of Programming Semantics10.1007/3-540-55511-0_25(477-491)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-55511-0_25
Nolte DPriese L(2005)Fairness in models with true concurrencyCONCUR '9110.1007/3-540-54430-5_106(455-469)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-54430-5_106
Darondeau P(2005)Concurrency and computabilitySemantics of Systems of Concurrent Processes10.1007/3-540-53479-2_9(223-238)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-53479-2_9
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.

Abstract

References

Cited By

Index Terms

Recommendations

Convergence Properties of Feasible Descent Methods for Solving Variational Inequalities in Banach Spaces

Enhanced metric regularity and Lipschitzian properties of variational systems

Properties of several metric spaces of fuzzy sets

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

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