Stepwise refinement of action systems

Back, Ralph-Johan; Sere, Kaisa

doi:10.1007/3-540-51305-1_7

Cited by 85 publications

(59 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Due to the simplicity of the model, action systems have been used as a basis for several theories of program refinement [3,4,7,41,46,50]. Part of the simplicity of action systems is due to the inherent interleaving semantics assumption, which ensures that statements are executed one after another (even under parallel composition), and hence, a concurrent system is viewed as a sequential program with a non-deterministic choice over all parallel actions.…”

Section: Related Workmentioning

confidence: 99%

“…We present our methods using the action systems framework, which has been used as a basis for several theories of program refinement [3,7,4,5]. In its simplest form, an action system consists of a set of actions (i.e., guarded statements) and a loop that at each iteration non-deterministically chooses then executes an enabled action from the set of actions.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Deriving real-time action systems with multiple time bands using algebraic reasoning

Dongol

Hayes

Derrick

2014

Science of Computer Programming

View full text Add to dashboard Cite

The verify-while-develop paradigm allows one to incrementally develop programs from their specifications using a series of calculations against the remaining proof obligations. This paper presents a derivation method for real-time systems with realistic constraints on their behaviour. We develop a high-level intervalbased logic that provides flexibility in an implementation, yet allows algebraic reasoning over multiple granularities and sampling multiple sensors with delay. The semantics of an action system is given in terms of interval predicates and algebraic operators to unify the logics for an action system and its properties, which in turn simplifies the calculations and derivations.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Deriving real-time action systems with multiple time bands using algebraic reasoning

Dongol

Hayes

Derrick

2014

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…5 A small application: action-system decomposition Action systems comprise a formalism for reasoning about parallel programs [2,4]. The intuition is that an action system do x 1 [] .…”

Section: Expressing Relations Between Programsmentioning

confidence: 99%

“…Action systems comprise a formalism for reasoning about parallel programs [2,4]. The intuition is that an action system is an iteration of a fixed number of demonic choices that terminates when none of the conjunctive actions are enabled any longer.…”

Section: Introductionmentioning

confidence: 99%

On Two Dually Nondeterministic Refinement Algebras

Solin

2006

Relations and Kleene Algebra in Computer Science

View full text Add to dashboard Cite

Abstract.A dually nondeterministic refinement algebra with a negation operator is proposed. The algebra facilitates reasoning about totalcorrectness preserving program transformations and nondeterministic programs. The negation operator is used to express enabledness and termination operators through a useful explicit definition. As a small application, a property of action systems is proved employing the algebra. A dually nondeterministic refinement algebra without the negation operator is also discussed.

show abstract

“…One of the possible approaches is to remove all architectural decisions from the specification language, in order to be able to concentrate on the algorithmic aspects. This approach has been taken in, for example, action systems or IO-automata [5,17,3,20,19]. A second approach is the use of knowledge-based or episternic logics and language constructs [11,12,21,10].…”

Section: Introductionmentioning

confidence: 99%

Layers as knowledge transitions in the design of distributed systems

Janssen

1995

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Knowledge based logics allow to give generic specifications of classes of network protocols. This genericity is combined with methods to derive sequentially structured or layered implementations of distributed algorithms. Knowledge based logic is used to specify layers in such algorithms as knowledge transitions. The resulting layered implementations are transformed to distributed algorithms by means a transformation rule based on the principle of communication closed layers.In this way a class of solutions to a problem for different architectures can be derived along the same lines simultaneously. This design technique for distributed algorithms is applied to a number of examples including different versions of the Two-Phase Commit protocol.

show abstract

Stepwise refinement of action systems

Cited by 85 publications

References 10 publications

Deriving real-time action systems with multiple time bands using algebraic reasoning

Deriving real-time action systems with multiple time bands using algebraic reasoning

On Two Dually Nondeterministic Refinement Algebras

Layers as knowledge transitions in the design of distributed systems

Contact Info

Product

Resources

About