Copyright Information
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of
scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other
copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying
this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without
the explicit permission of the copyright holder.
Sensoria Bibliography Site Extensions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time
Mario Bravetti
abstract:
We present our work on extending the standard machinery for weak bisimulation to deal with: finite-state processes of calculi with a full signature, including static operators like parallel; semantic action refinement and ST bisimulation; maximal-progress, i.e. priority of standard actions over unprioritized actions; representation of time: discrete real-time and Markovian stochastic time. For every such topic we show that it is possible to resort simply to weak bisimulation and that we can exploit this to obtain, via modifications to the standard machinery: finite-stateness of semantic models when static operators are not replicable by recursion, as for CCS with the standard semantics, thus yielding decidability of equivalence; structural operational semantics for terms; a complete axiomatization for finite-state processes via a modification of the standard theory of standard equation sets and of the normal-form derivation procedure.
