This paper presents a new format for process algebras, the extended tyft/tyxt format which generalises the tyft/tyxt format of Groote and Vaandrager. The format differs from most previous formats in that the labels on transitions are treated as manysorted terms. Bisimulation is a congruence for all operators defined by extended transition system specifications in this format. When one extended ...

State space minimization techniques are crucial for combating state explosion. A variety of explicitstate verification tools use bisimulation minimization to check equivalence between systems, to minimize components before composition, or to reduce a state space prior to model checking. Experimental results on bisimulation minimization in symbolic model checking contexts, however, are mixed. Th...

In this paper we propose a notion of weak bisimulation for a class of weighted automata with unobservable transitions where weights are taken from an idempotent semiring. In particular the (max/+), (min/+) or (max/min) dioid are considered. The proposed bisimulation is a natural extension of Milner’s well known weak bisimulation for untimed automata (i. e., weighted automata over the boolean se...

We provide time lower bounds for sequential and parallel algorithms deciding bisimulation on labeled transition systems that use partition refinement. For this is $\Omega((m \mkern1mu {+} n ) \mkern-1mu \log n)$ $\Omega(n)$, where $n$ the number of states $m$ transitions. The lowerbounds are obtained by analysing families deterministic systems, ultimately with two actions in case, one action al...