Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
94
click to vote
FORMATS
2005
Springer
104
views
Formal Methods
»
more
FORMATS 2005
»
Is Timed Branching Bisimilarity an Equivalence Indeed?
15 years 8 months ago
Download
www.cs.vu.nl
Wan Fokkink, Jun Pang, Anton Wijs
Real-time Traffic
FORMATS 2005
|
claim paper
Related Content
»
Is Timed Branching Bisimilarity a Congruence Indeed
»
A Global Timed Bisimulation Preserving Abstraction for Parametric TimeInterval Automata
»
Characterizing EF and EX Tree Logics
more »
Post Info
More Details (n/a)
Added
27 Jun 2010
Updated
27 Jun 2010
Type
Conference
Year
2005
Where
FORMATS
Authors
Wan Fokkink, Jun Pang, Anton Wijs
Comments
(0)
Researcher Info
Formal Methods Study Group
Computer Vision