A Refinement Relation Supporting the Transition from Unbounded to Bounded Communication Buffers
暂无分享,去创建一个
[1] Manfred Broy,et al. Modelling Operating System Structures by Timed Stream Processing Functions , 1992, J. Funct. Program..
[2] Martín Abadi,et al. Composing Specifications , 1989, REX Workshop.
[3] Martín Abadi,et al. The Existence of Refinement Mappings , 1988, LICS.
[4] Nancy A. Lynch,et al. Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.
[5] Manfred Broy,et al. Specification and Refinement of Finite Dataflow Networks - a Relational Approach , 1994, FTRTFT.
[6] Jifeng He,et al. A Theory of Synchrony and Asynchrony , 1990, Programming Concepts and Methods.
[7] Bowen Alpern,et al. Defining Liveness , 1984, Inf. Process. Lett..
[8] Manfred Broy. Compositional refinement of interactive systems , 1997, JACM.
[9] Joost N. Kok,et al. A Fully Abstract Semantics for Data Flow Nets , 1987, PARLE.
[10] Manfred Broy. (Inter-)Action Refinement: The Easy Way , 1992, NATO ASI PDC.
[11] Rob A. H. van Twist,et al. A Novel Deadlock Free and Starvation Free Packet Switching Communication Processor , 1987, PARLE.
[12] William B. Ackerman,et al. Scenarios: A Model of Non-Determinate Computation , 1981, ICFPC.
[13] Ketil Stølen,et al. A Method for the Development of Totally Correct Shared-State Parallel Programs , 1991, CONCUR.
[14] Robert M. Keller,et al. Denotational Models for Parallel Programs with Indeterminate Operators , 1977, Formal Description of Programming Concepts.
[15] Gilles Kahn,et al. The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.
[16] Frank Dederichs,et al. Assumption/Commitment Rules for Networks of Asynchronously Communicating Agents , 1993 .