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
7
click to vote
CONCUR
2005
Springer
favorite
Email
discuss
report
105
views
Distributed And Parallel Com...
»
more
CONCUR 2005
»
A Ground-Complete Axiomatization of Finite State Processes in Process Algebra
13 years 6 months ago
Download
alexandria.tue.nl
Jos C. M. Baeten, Mario Bravetti
Real-time Traffic
CONCUR 2005
|
Distributed And Parallel Computing
|
claim paper
Related Content
»
Finitely generated free Heyting algebras via Birkhoff duality and coalgebra
»
Compositional Reasoning for Probabilistic FiniteState Behaviors
»
Finite Equational Bases in Process Algebra Results and Open Questions
»
Algebraic signal processing theory sampling for infinite and finite 1D space
»
Axiomatizations for Probabilistic FiniteState Behaviors
»
A Process Algebra for Predictible Control Systems
»
Algebraic Signal Processing Theory 1D Space
»
A Finite Basis for Failure Semantics
»
Bisimilarity Is Not Finitely Based over BPA with Interrupt
more »
Post Info
More Details (n/a)
Added
13 Oct 2010
Updated
13 Oct 2010
Type
Conference
Year
2005
Where
CONCUR
Authors
Jos C. M. Baeten, Mario Bravetti
Comments
(0)
Researcher Info
Distributed And Parallel Computing Study Group
Computer Vision