Is timed branching bisimilarity a congruence indeed?

Reference : Is timed branching bisimilarity a congruence indeed?


	Document type :	Scientific journals : Article
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/182

Title :	Is timed branching bisimilarity a congruence indeed?
Language :	English
Author, co-author :	Fokkink, W. J. [> >]
	Pang, Jun [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Wijs, A. J. [> >]
Publication date :	2008
Journal title :	Fundamenta Informaticae
Publisher :	IOS Press
Volume :	87
Issue/season :	3-4
Pages :	287–311
Peer reviewed :	Yes
Audience :	International
ISSN :	0169-2968
Target :	Researchers
Permalink :	http://hdl.handle.net/10993/182

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	FI08.pdf		Author postprint	195.62 kB	View/Open

All documents in ORBi^lu are protected by a user license.