Bisimulation Respecting First Order Operations
نویسنده
چکیده
We identify two features of common process algebra operations their rst order avour and the fact that they respect bisimulation in a uniform manner For this purpose two notions are introduced rst a notion of rst order de nable operations on process graphs and second respect for sequence extension In the rst part of the paper those rst order de nable operations are characterised whose de ning formulas respect sequence extension The second part uses the resulting format to calculate modal preconditions it gives an algorithm that reduces modal truth in the output of certain process graph operations to modal truth in the inputs of this operation
منابع مشابه
Game Constructions that Are Safe for Bisimulation
The notion of bisimulation is extended to Game Logic (GL), a logic for reasoning about winning strategies in 2-player games. We show that all game constructions of GL are safe for bisimulation, i.e. that an atomic bisimulation can be lifted to non-atomic games constructed by the operations of GL. As a consequence, bisimilar states satisfy the same GL-formulas.
متن کاملComputing Maximal Bisimulations
We present and compare several algorithms for computing the maximal strong bisimulation, the maximal divergence-respecting delay bisimulation, and the maximal divergence-respecting weak bisimulation of a generalised labelled transition system. These bisimulation relations preserve CSP semantics, as well as the operational semantics of programs in other languages with operational semantics descr...
متن کاملThe Higher-Order, Call-by-Value Applied Pi-Calculus
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this calculus. Such development has been notoriously difficult because of the subtle interactions among generative names, processes as data, and the algebraic operations. We handle them by carefully defining the calculus and...
متن کاملDynamic Odds & Ends
Modal logic becomes action logic by adding programs as in propositional dynamic logic or the μ– calculus. Modal languages can be seen as decidable fragments of first-order logic that admit a natural bisimulation, and hence enjoy a good model theory. Recently, much stronger 'guarded fragments' of firstorder logic have been identified that enjoy the same pleasant features. The latter can serve as...
متن کاملSafety for bisimulation in monadic second-order logic
We characterize those formulas of MSO monadic second order logic that are safe for bisim ulation formulas de ning binary relations such that any bisimulation is also a bisimulation with respect to these de ned relations Every such formula is equivalent to one constructed from calculus tests atomic actions and the regular operations The proof uses a characterization of completely additive calcul...
متن کامل