Computing Behavioural Relations, Logically
نویسندگان
چکیده
This paper develops a model-checking algorithm for a fragment of the modal mu-calculus and shows how it may be applied to the eecient computation of behavioral relations between processes. The algorithm's complexity is proportional to the product of the size of the process and the size of the formula, and thus improves on the best existing algorithm for such a xed point logic. The method for computing preorders that the model checker induces is also more eecient than known algorithms.
منابع مشابه
Characteristic formulae for timed automata
This paper offers characteristic formula constructions in the realtime logic Lν for several behavioural relations between (states of) timed automata. The behavioural relations studied in this work are timed (bi)similarity, timed ready simulation, faster-than bisimilarity and timed trace inclusion. The characteristic formulae delivered by our constructions have size which is linear in that of th...
متن کاملCharacterising Probabilistic Processes Logically
In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the modal mu-calculus and show how to derive characteristic formulae for various simulation-like preorders over finite-state processes without divergence. In addition, we show that even without the fixpoint operators this probabil...
متن کاملBehavioural Subtyping and Property Preservation for Objects Oriented Formalisms
Behavioural typing and subtyping has proved to be a very useful concept for the support of incremental reuse in the area of object-oriented (O-O) languages. With the emergence of formalisms integrating the O-O approach and concurrency, the question arises how behavioural subtyping may be supported by such formalisms. We present a formal framework for the definition of behavioural subtyping in O...
متن کاملBehavioural Types in CoOperative Objects
Behavioural typing and subtyping has proved to be a very useful concept for the support of incremental reuse in the area of object-oriented (O-O) languages. With the emergence of formalisms integrating the O-O approach and Petri nets, the question arises how behavioural subtyping may be supported by such formalisms. We present a formal framework for the definition of behavioural typing in CoOpe...
متن کاملCharacterising Probabilistic Processes Logically - (Extended Abstract)
In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the modal mu-calculus and show how to derive characteristic formulae for various simulation-like preorders over finite-state processes without divergence. In addition, we show that even without the fixpoint operators this probabil...
متن کامل