Back
  1. Home
  3. Detailed Reference
Download
Article (Scientific journals)
Is timed branching bisimilarity a congruence indeed?
Fokkink, W. J.; PANG, Jun; Wijs, A. J.
2008 • In Fundamenta Informaticae, 87 (3-4), p. 287–311
Peer Reviewed verified by ORBi
Permalink
https://hdl.handle.net/10993/182
 

Files (1)Send toDetailsStatisticsBibliographySimilar publications

Files

Full Text
FI08.pdf
Author postprint (200.31 kB)
Download

All documents in ORBilu are protected by a user license.

Send to


Details


Disciplines :
Computer science
Identifiers :
UNILU:UL-ARTICLE-2009-257
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.
External co-authors :
yes
Language :
English
Title :
Is timed branching bisimilarity a congruence indeed?
Publication date :
2008
Journal title :
Fundamenta Informaticae
ISSN :
0169-2968
Publisher :
IOS Press
Volume :
87
Issue :
3-4
Pages :
287–311
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBilu :
since 22 April 2013

Statistics

Number of views
63 (1 by Unilu)
Number of downloads
17 (0 by Unilu)
More statistics
Scopus citations®
 
4
Scopus citations®
without self-citations
2
WoS citations™
 
5

Bibliography

Similar publications


Contact ORBilu