Is Timed Branching Bisimilarity an Equivalence Indeed?

W.J. Fokkink; J. Pang; A. Wijs

doi:10.1007/11603009_20

Is Timed Branching Bisimilarity an Equivalence Indeed?

W.J. Fokkink, J. Pang, A. Wijs

Research output: Contribution to Journal › Article › Academic › peer-review

Original language	English
Pages (from-to)	258-272
Journal	Lecture Notes in Computer Science
Volume	3829
DOIs	https://doi.org/10.1007/11603009_20
Publication status	Published - 2005

Bibliographical note

DBLP:conf/formats/FokkinkPW05
Proceedings title: Formal Modeling and Analysis of Timed Systems, Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005, Proceedings
Publisher: Springer
Editors: P. Pettersson, W. Yi

Access to Document

10.1007/11603009_20

Persistent URL (handle)

Persistent link

Cite this

@article{0fd94164b48e486a894dca70f1f9aa5c,

title = "Is Timed Branching Bisimilarity an Equivalence Indeed?",

author = "W.J. Fokkink and J. Pang and A. Wijs",

note = "DBLP:conf/formats/FokkinkPW05 Proceedings title: Formal Modeling and Analysis of Timed Systems, Third International Conference, FORMATS 2005, Uppsala, Sweden, September 26-28, 2005, Proceedings Publisher: Springer Editors: P. Pettersson, W. Yi",

year = "2005",

doi = "10.1007/11603009\_20",

language = "English",

volume = "3829",

pages = "258--272",

journal = "Lecture Notes in Computer Science",