Action refinement.

MaRDI QIDQ2760253zbMATH OpenFDO

Authors Roberto Gorrieri, Arend Rensink

Publication date 2001

zbMATH Keywords

semantic substitionsyntactic substitionvertical implementation

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Review text

The paper gives a comprehensive overview of the action refinement research results obtained in the last decade. Various different approaches are analysed and contrasted to each other in a uniform framework. Two running examples, a toy data base and a critical section problem, are analysed and discussed to show benefits and disadvantages of various models. The paper discusses both atomic and non-atomic types of refinements, semantic versus syntactic substitution, dependency-based action refinement, and vertical implementation. There are no proofs, only references to the original papers.NEWLINENEWLINEFor the entire collection see [Zbl 0971.00006].

Recommendations

• scientific article; zbMATH DE number 1361504
• Data refinement of remote procedures
• scientific article; zbMATH DE number 4180788
• Refinement of actions in event structures and causal trees
• scientific article; zbMATH DE number 176759

Cited in

(23)

• Partitioned PLTL model-checking for refined transition systems
• Relating trace refinement and linearizability
• A logic for the stepwise development of reactive systems
• Vertical implementation
• On hierarchically developing reactive systems
• Hybrid dynamic logic institutions for event/data-based systems
• A calculus of concurrent graph-rewriting processes
• Product action.
• Refinement of actions for real-time concurrent systems with causal ambiguity
• Unification and combination of a class of traversal strategies made with pattern matching and fixed-points
• Taking decisions late: end-based choice combined with action refinement
• Refinement of actions in a real-time process algebra with a true concurrency model
• Dynamic logic with binders and its application to the development of reactive systems
• scientific article; zbMATH DE number 5119885 (Why is no real title available?)
• Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
• Interleaving vs True Concurrency: Some Instructive Security Examples
• General refinement. II: Flexible refinement
• Contexts, refinement and determinism
• Model Checking for Action Abstraction
• scientific article; zbMATH DE number 5053644 (Why is no real title available?)
• Action Refinement in Process Algebra and Security Issues
• Towards the hierarchical verification of reactive systems
• Revisiting sequential composition in process calculi

This page was built for publication: Action refinement.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760253)