article

Open access

A superimposition control construct for distributed systems

Editor: Andrew W. Appel Author:

Shmuel KatzAuthors Info & Claims

ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 15, Issue 2

Pages 337 - 356

https://doi.org/10.1145/169701.169682

Published: 01 April 1993 Publication History

PDF eReader

References

[1]

APT. K. R., AND CLER~ONT, PH. Two normal form theorems for CSP programs. RC 10975, IBM, T. J. Watson Research Center, Yorktown Heights, N.Y., Feb. 1985.

Google Scholar

[2]

BACK, R. J. R., AND KURKI-SuoNIO, R. Decentralization of process nets with centralized control. Dist. Comput., 3, Springer-Verlag, Berlin, Germany (1989), 73-87.

Google Scholar

[3]

BouGE, L., AND FR~NCEZ, N. A compositional approach to superimposition. In Proceedings of ACM POPL88 Symposium (Jan. 1988).

Crossref

Google Scholar

[4]

CHANDY, K. M., AND LAMPORT, L. Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst., 3, i (Feb. 1985), 63-75.

Crossref

Google Scholar

[5]

CHANDY, K. M., AND MISRA, J. An example of stepwise refinement of distributed algorithms: Quiescence detection. ACM 8, 3 (July 1986), 326-343.

Crossref

Google Scholar

[6]

CHANDY, K. M, AND MIS~, J. Parallel Program Design: A Foundation. Addison-Wesley, Reading, Mass., 1988.

Crossref

Google Scholar

[7]

CHANDY, K. M., MISRA, J., AND H~s, L. Distributed deadlock detection. ACM Trans. Comput. Syst., 1, 2, (May 1983), 144 156.

Crossref

Google Scholar

[8]

DIJKSTRA, E. W., AND SCHOLTEN, C. S. Termination detection for diffusing computations. Inf. Process. Lett., 11, 1, North-Holland, New York (Aug. 1980), 1-4.

Google Scholar

[9]

DOLEV, D., AND SHAVIT, N. Bounded concurrent time-stamp systems are constructible. Proceedings of 21st ACM Symposium on Theory of Computing (May 1989), 454-466.

Crossref

Google Scholar

[10]

DON~UE, J.E. Complementary definitions of programming language semantics. LNCS 42, Springer-Verlag, New York, 1976.

Crossref

Google Scholar

[11]

ELRAD, T., AND FRANCEZ, N. Decomposition of distributed programs into communication closed layers. Sci. Comput. Program. 2, 2 (1982), 155-173.

Google Scholar

[12]

FORMAN, I. On the design of large distributed systems. MCC Tech. Rep. STP-098-86 (rev. 1.0), Jan. 1987. Preliminary version in Proceedings oflnternational Conference on Computer Languages, (Miami Beach, Fla., Oct. 1986).

Google Scholar

[13]

F~cEz, N. Distributed termination. ACM Trans. Program. Lang. Svst., 2, i (Jan. 1980), 42-55.

Crossref

Google Scholar

[14]

FRANCEZ, N., I~ALPERN, B., AND TAUBENFELD, G. Script: A communication abstraction mechanism and its verification. Sci. Comput. Program., 6 (1986), 35-88.

Crossref

Google Scholar

[15]

GERTH, R., AND SHRIRA, L. On proving communication closedness of distributed layers. In Proceedings of the 6th Conference on Foundations of Software Technology and Theoret~cal Computer Science (New Delhi, 1986), LNCS 241, K. V. Nori, Ed., 330-343.

Crossref

Google Scholar

[16]

HAREL, D., AND PNUELI, A. On the development of reactive systems. In Proceedtngs of Advanced Institute on Logics and Models for Verification and Speco-cat~on of Concurrent Systems (La Colle Sur Loupe, Oct. 1984).

Google Scholar

[17]

ISRAEL~, A., AND LL M. Bounded rime stamps. In Proceedmgs of 18th IEEE FOCS Symposium, 1987, 371 382.

Google Scholar

[18]

KATZ, S., AND PELED, D. Interleaving set temporal logic. Theor. Comput. Sct., 75 (1990), 263-287.

Crossref

Google Scholar

[19]

KATZ, S., AND S~MUELI, O. Cooperative distributed algorithms for dynamic cycle preventmn. IEEE Trans. Softw. Eng. SE-13, 5 (May 1987), 540-552.

Crossref

Google Scholar

[20]

LAMPORT, L. Solved problems, unsolved problems, and non-problems in concurrency. In Proceedings of 3rd ACM PODC Symposium (Vancouver, 1984), 1-11.

Crossref

Google Scholar

[21]

LEHMANN, D., PNUELI, A., AND STAVI, J. Impartiality, justice, fairness: The ethics of concurrent termination. In The Proceedings of 8th ICALP (Acco, Israel, July 1981). LNCS 115, 0. Kariv and S. Even, Eds., Springer-Verlag, 1981, 264-277.

Crossref

Google Scholar

[22]

LICHTENSTEIN, O., PNUELI, A., AND ZUCK, L. The glory of the past. In Logics of Programs Symposium, LNCS 193, Springer-Verlag, (New York, 1985), 196 218.

Crossref

Google Scholar

[23]

LISKOV, B., AND SCHEIFLER, R. Guardians and actions: Linguistlc support for robust, distributed programs. ACM Trans. Program. Lang. Syst., 5, 3 (July 1983).

Crossref

Google Scholar

[24]

ToPoR, R. Termination detection for distributed computatlons. Inf. Process. Lett., 18 (Jan. 1984), 33-36.

Google Scholar

Cited By

View all

Sanwal UHoang TPetre LPetre I(2022)Scalable reaction network modeling with automatic validation of consistency in Event-BScientific Reports10.1038/s41598-022-05308-612:1Online publication date: 25-Jan-2022
https://doi.org/10.1038/s41598-022-05308-6
Shokri-Manninen FVain JWaldén M(2020)Formal Verification of COLREG-Based Navigation of Maritime Autonomous SystemsSoftware Engineering and Formal Methods10.1007/978-3-030-58768-0_3(41-59)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-58768-0_3
Dubslaff C(2019)Compositional Feature-Oriented SystemsSoftware Engineering and Formal Methods10.1007/978-3-030-30446-1_9(162-180)Online publication date: 18-Sep-2019
https://dl.acm.org/doi/10.1007/978-3-030-30446-1_9
Show More Cited By

Index Terms

A superimposition control construct for distributed systems
1. Computing methodologies
  1. Concurrent computing methodologies
    1. Concurrent programming languages
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Control structures
        Modules / packages
      2. Language types
        Concurrent programming languages

Recommendations

A Universal Control Construct for Abstract State Machines
ABZ 2016: Proceedings of the 5th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z - Volume 9675

Abstract State Machines can be used to specify arbitrary system behaviour. However, when writing executable specifications one often has to write additional statements which organise how, e.g., in which order, the rules are executed. This reduces the ...
A technique for distributed systems specification
PDP '95: Proceedings of the 3rd Euromicro Workshop on Parallel and Distributed Processing

In this paper we show how an object-oriented specification language is useful for the specification of distributed systems. The main constructors in this language are the objects. An object consists of a state, a behaviour and a set of transition rules ...
Modularity in BDI-Based Multi-agent Programming Languages
WI-IAT '09: Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02

This paper proposes a module-based vision for designing BDI-based multi-agent programming languages. The introduced concept of modules enables common programming techniques such as encapsulation and information hiding for BDI-based programs, and ...

Reviews

Reviewer: Marian Gheorghe

Superimposition is a procedure-like control structure whose declaration part contains some schematic abstractions of processes, called roletypes. Each roletype may be related to processes associated with a distributed algorithm. The operations declared in a roletype are interleaved, during the execution, with those of the associated processes. Thus, a roletype can be considered as a supplementary code that is added to the basic processes. Each process and its corresponding role type will execute on the same local state. The elements of the syntax of this concept are introduced, and some problems concerning the correctness of superimposition are described. As the paper shows, superimposition is appropriate for adding functionality to a system in stages (for example, to guarantee for a distributed system that several tasks are executed in some special conditions) or for describing tasks such as monitoring or debugging other algorithms.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Programming Languages and Systems

ACM Transactions on Programming Languages and Systems Volume 15, Issue 2

April 1993

155 pages

ISSN:0164-0925

EISSN:1558-4593

DOI:10.1145/169701

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1993

Published in TOPLAS Volume 15, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

123
Total Citations
View Citations
519
Total Downloads

Downloads (Last 12 months)40
Downloads (Last 6 weeks)8

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sanwal UHoang TPetre LPetre I(2022)Scalable reaction network modeling with automatic validation of consistency in Event-BScientific Reports10.1038/s41598-022-05308-612:1Online publication date: 25-Jan-2022
https://doi.org/10.1038/s41598-022-05308-6
Shokri-Manninen FVain JWaldén M(2020)Formal Verification of COLREG-Based Navigation of Maritime Autonomous SystemsSoftware Engineering and Formal Methods10.1007/978-3-030-58768-0_3(41-59)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.1007/978-3-030-58768-0_3
Dubslaff C(2019)Compositional Feature-Oriented SystemsSoftware Engineering and Formal Methods10.1007/978-3-030-30446-1_9(162-180)Online publication date: 18-Sep-2019
https://dl.acm.org/doi/10.1007/978-3-030-30446-1_9
Baier CDubslaff C(2018)From verification to synthesis under cost-utility constraintsACM SIGLOG News10.1145/3292048.32920525:4(26-46)Online publication date: 12-Nov-2018
https://dl.acm.org/doi/10.1145/3292048.3292052
Chrszon PDubslaff CKlüppelholz SBaier C(2018)ProFeat: feature-oriented engineering for family-based probabilistic model checkingFormal Aspects of Computing10.1007/s00165-017-0432-430:1(45-75)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.1007/s00165-017-0432-4
Benduhn FThüm TSchaefer ISaake G(2017)Modularization of Refinement Steps for Agile Formal MethodsFormal Methods and Software Engineering10.1007/978-3-319-68690-5_2(19-35)Online publication date: 11-Oct-2017
https://doi.org/10.1007/978-3-319-68690-5_2
Chrszon PDubslaff CKlüppelholz SBaier C(2016)Family-Based Modeling and Analysis for Probabilistic Systems --- Featuring ProFeatProceedings of the 19th International Conference on Fundamental Approaches to Software Engineering - Volume 963310.1007/978-3-662-49665-7_17(287-304)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.1007/978-3-662-49665-7_17
Kamali MPetre LSere KDaneshtalab M(2015)Towards correct and reusable Network-on-Chip architecturesModeling and Simulation of Computer Networks and Systems10.1016/B978-0-12-800887-4.00012-2(357-392)Online publication date: 2015
https://doi.org/10.1016/B978-0-12-800887-4.00012-2
Dubslaff CBaier CKlüppelholz S(2015)Probabilistic Model Checking for Feature-Oriented SystemsTransactions on Aspect-Oriented Software Development XII10.1007/978-3-662-46734-3_5(180-220)Online publication date: 20-Mar-2015
https://doi.org/10.1007/978-3-662-46734-3_5
Olszewska MWaldén M(2014)Measuring the Progress of a System DevelopmentSoftware Design and Development10.4018/978-1-4666-4301-7.ch069(1415-1439)Online publication date: 2014
https://doi.org/10.4018/978-1-4666-4301-7.ch069
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.

References

Cited By

Index Terms

Recommendations

A Universal Control Construct for Abstract State Machines

A technique for distributed systems specification

Modularity in BDI-Based Multi-agent Programming Languages

Reviews

Access critical reviews of Computing literature here

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

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