A Calculus for the Specification, Design, and Verification of Distributed Concurrent Systems
Author:
Open Access
- 5 September 2024
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 36 (3) , 1-54
Abstract
A calculus for the specification and verification of distributed concurrent interactive real-time systems is introduced. Systems are specified by their interface behavior formalized by interface predicates and interface assertions. System designs in terms of architectures of distributed networks of interactive systems are constructed by concurrent composition of subsystems. The specification of system designs is calculated from the specifications of their subsystems. Verification is done by proof rules, which are based on the concepts of causality and realizability justified by the operational model in terms of generalized Moore machines, Moore machines not restricted to finite state spaces. The calculus supports interface specification and reasoning both about untimed as well as timed distributed concurrent systems. This includes the design of cyber-physical systems. Real-time is used, in particular, to specify time-sensitive behavior and to prove properties related to causality and realizability, properties that hold for all Moore machines. On this basis, a calculus is worked out and illustrated by small examples. The calculus is shown to be sound and relatively complete.Keywords
This publication has 38 references indexed in Scilit:
- Computability and realizability for interactive computationsInformation and Computation, 2015
- Verifying of interface assertions for infinite state Mealy machinesJournal of Computer and System Sciences, 2014
- Fixed Points in Metric SemanticsElectronic Notes in Theoretical Computer Science, 2001
- The chemical abstract machineTheoretical Computer Science, 1992
- An extensional fixed-point semantics for nondeterministic data flowTheoretical Computer Science, 1991
- Scenarios: A model of non-determinate computation1981
- A Calculus of Communicating Systems1980
- An axiomatic proof technique for parallel programs IActa Informatica, 1976
- A method for synthesizing sequential circuitsBell System Technical Journal, 1955
- Recursive predicates and quantifiersTransactions of the American Mathematical Society, 1943