Symbolic transition graph and its early bisimulation checking algorithms for the π-calculus

Symbolic transition graph is proposed as an intuitive and compact semantic model for the π-calculus processes. Various versions (strong/weak, ground/symbolic) of early operational semantics are given to such graphs. Based on them the corresponding versions of early bisimulation equivalences and obse...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Science China. Technological sciences 1999-08, Vol.42 (4), p.342-353
Hauptverfasser:	Li, Zhoujun, Chen, Huowang, Wang, Bingshan
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Equivalence Semantics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!