Titlebook: Stepwise Refinement of Distributed Systems; Models, Formalisms, J. W. Bakker,W. -P. Roever,G. Rozenberg Conference proceedings 1990 Spring

neutralize

MetateM: A framework for programming in temporal logic,ab87, Gab89] and present a concrete framework, called . for executing (modal and) temporal logics. Our approach is illustrated by the development of an execution mechanism for a propositional temporal logic and for a restricted first order temporal logic.

gastritis

groggy

Blasphemy

COWER

Abadi & Lamport and stark: Towards a proof theory for stuttering, dense domains and refinement mappn the other hand they introduce stuttering and, in the case of refinement mappings, lead to the non-existence of such mappings..Semantically, the these problems are solved satisfactorily in the work of Abadi & Lamport [AL88]. Syntactically, however, their solutions have no obvious prooftheoretic cou

kidney

秘密会议

Refinement of actions in causality based models, by more complicated processes on a lower level. This is done in such a way that the behaviour of the refined system may be inferred compositionally from the behaviour of the original system and from the behaviour of the processes substituted for actions. We define this refinement operation for caus

Control-Group

Transformation of combined data type and process specifications using projection algebras,mework of metric spaces. It allows to combine data type- and process specifications within one formalism. Parameterized projection specifications, corresponding to usual algebraic parameterized specifications, carry over compositionality to combined data type and process specifications. The paramete

PHAG

Various simulations and refinements,ition system. The concept of simulation is presented and proved to be sound for correctness of implementation. The paper provides a rigorous method for the formal development of communicating processes by integrating the event-based approach (such as CSP [3] and CCS [7]) with the state-based techniq

矛盾心理

On decomposing and refining specifications of distributed systems, system is specified through the sequence of messages that can be sent and received in an execution of the system. We use . to specify such sequences in analogy with the way finite automata are used as acceptors of finite strings. Safety properties are specified by the set of transitions of the tran