In this paper we show how an existing technique to decide strong bisimulation on context free processes can be adapted to work on a subset of LOTOS describing this class of non-finite state processes. This decision procedure, originally defined for the Basic Process Algebra is based on the construction of semantic tableaux following the structure of a LOTOS term.
Strong bisimilarity is decidable for lotos context free processes
Fantechi A;Gnesi S;
1993
Abstract
In this paper we show how an existing technique to decide strong bisimulation on context free processes can be adapted to work on a subset of LOTOS describing this class of non-finite state processes. This decision procedure, originally defined for the Basic Process Algebra is based on the construction of semantic tableaux following the structure of a LOTOS term.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_411870-doc_145016.pdf
accesso aperto
Descrizione: Strong bisimilarity is decidable for lotos context free processes
Dimensione
1.59 MB
Formato
Adobe PDF
|
1.59 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
