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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
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
27
click to vote
CSL
2006
Springer
favorite
Email
discuss
report
95
views
Automated Reasoning
»
more
CSL 2006
»
Weak Bisimulation Approximants
14 years 2 months ago
Download
www.newton.ac.uk
Abstract. Bisimilarity and weak bisimilarity are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached
Will Harwood, Faron Moller, Anton Setzer
Real-time Traffic
Automated Reasoning
|
Basic Parallel Processes
|
CSL 2006
|
Tight Ordinal Bound
|
Weak Bisimilarity
|
claim paper
Related Content
»
Approximating Labelled Markov Processes Again
»
Derivation of Characteristic Formulae
»
A Characterisation of Weak Bisimulation Congruence
»
Weak bisimulation for Probabilistic Timed Automata
»
Notes on Generative Probabilistic Bisimulation
»
A Syntactical Approach to Weak BiSimulation for Coalgebras
»
Symbolic Bisimulations for Probabilistic Systems
»
Approximate bisimulation relations for constrained linear systems
»
Weak Equivalences in PsiCalculi
more »
Post Info
More Details (n/a)
Added
22 Aug 2010
Updated
22 Aug 2010
Type
Conference
Year
2006
Where
CSL
Authors
Will Harwood, Faron Moller, Anton Setzer
Comments
(0)
Researcher Info
Automated Reasoning Study Group
Computer Vision