A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Refinement of actions in causality based models
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Process algebra
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Refining interfaces of communicating systems
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Advances in distributed computing (ADC) and colloquium on combining paradigms for software development (CCPSD): Vol. 2
Theoretical Computer Science
Bisimulation and action refinement
Selected papers of the 3rd workshop on Concurrency and compositionality
A hierarchy of system descriptions via atomic linear refinement
Fundamenta Informaticae
Towards action-refinement in process algebras
Information and Computation
Adding action refinement to a finite process algebra
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Split and ST bisimulation semantics
Information and Computation
A causal operational semantics of action refinement
Information and Computation
Proving congruence of bisimulation in functional programming languages
Information and Computation
Comparing syntactic and semantic action refinement
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
The limit of splitn-language equivalence
Information and Computation
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
From SOS rules to proof principles: an operational metatheory for functional languages
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation - Special issue on EXPRESS 1997
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Communication and Concurrency
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Action Refinement as an Implementation Relations
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Action Systems and Action Refinement in the Development of Parallel Systems - An Algebraic Approach
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Weak Sequential Composition in Process Algebras
CONCUR '94 Proceedings of the Concurrency Theory
Action Refinement and Property Inheritance in Systems of Sequential Agents
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Methodological Aspects of Action Refinement
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Interleaving semantics and action refinement with atomic choice
Advances in Petri Nets 1992, The DEMON Project
Fully abstract models for a process language with refinement
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
A Categorial View of Process Refinement
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement
Deciding and Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Relating communicating processes with different interfaces
Fundamenta Informaticae
Towards the hierarchical verification of reactive systems
Theoretical Computer Science - Logic, semantics and theory of programming
Behaviour Abstraction for Communicating Sequential Processes
Fundamenta Informaticae
General Refinement, Part Two: Flexible Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Contexts, refinement and determinism
Science of Computer Programming
Preserving security properties under refinement
Proceedings of the 7th International Workshop on Software Engineering for Secure Systems
Relating Communicating Processes with Different Interfaces
Fundamenta Informaticae
Behaviour Abstraction for Communicating Sequential Processes
Fundamenta Informaticae
Hi-index | 0.01 |
We investigate criteria to relate specifications and implementations belonging to conceptually different levels of abstraction. For this purpose, we introduce the generic concept of a vertical implementation relation, which is a family of binary relations indexed by a refinement function that maps abstract actions onto concrete processes and thus determines the basic connection between the abstraction levels. If the refinement function is the identity, the vertical implementation relation collapses to a standard (horizontal) implementation relation. As desiderata for vertical implementation relations we formulate a number of congruence-like proof rules (notably a structural rule for recursion) that offer a powerful, compositional proof technique for vertical implementation. As a candidate vertical implementation relation we propose vertical bisimulation. Vertical bisimulation is compatible with the standard interleaving semantics of process algebra; in fact, the corresponding horizontal relation is rooted weak bisimulation. We prove that vertical bisimulation satisfies the proof rules for vertical implementation, thus establishing the consistency of the rules. Moreover, we define a corresponding notion of abstraction that strengthens the intuition behind vertical bisimulation and also provides a decision algorithm for finite-state systems. Finally, we give a number of small examples to demonstrate the advantages of vertical implementation in general and vertical bisimulation in part.