Distributed cooperation with action systems

DOI10.1145/48022.48023zbMath0663.68028OpenAlexW2005952505MaRDI QIDQ3814785

Ralph-Johan Back, Reino Kurki-Suonio

Publication date: 1988

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toplas/1988-10/

zbMATH Keywords

fairnessschedulingdistributed systemstemporal logictrue concurrencyprogram verificationguarded commandsmodels of concurrencyaction systemsbroadcasting networkshandshaking mechanismsmultiprocess communication

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Related Items (24)

Verifiable Code Generation from Scheduled Event-B Models ⋮ Generating non-conspiratorial executions ⋮ Highly concurrent logically synchronous multicast ⋮ Simulation relations for fault-tolerance ⋮ Experiments in program verification using Event-B ⋮ Emergence and refinement ⋮ A distributed synchronization scheme for fair multi-process handshakes ⋮ Deadlock-freedom in component systems with architectural constraints ⋮ Formal communication elimination and sequentialization equivalence proofs for distributed system models ⋮ Action systems in incremental and aspect-oriented modeling ⋮ Algebraic reasoning for probabilistic action systems and while-loops ⋮ Operational specification with joint actions: Serializable databases ⋮ On equivalence-completions of fairness assumptions ⋮ Normal forms in total correctness for while programs and action systems ⋮ Ensuring completeness of symbolic verification methods for infinite-state systems ⋮ UNITY and Büchi automata ⋮ Refinement patterns for ASTDs ⋮ Some impossibility results in interprocess synchronization ⋮ Fairness and hyperfairness in multi-party interactions ⋮ Trace-based derivation of a scalable lock-free stack algorithm ⋮ Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability ⋮ Set-Theoretic Models of Computations ⋮ On fairness notions in distributed systems. I: A characterization of implementability ⋮ Understanding, Explaining, and Deriving Refinement

This page was built for publication: Distributed cooperation with action systems