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
118
Voted
MFCS
2005
Springer
121
views
Theoretical Computer Science
»
more
MFCS 2005
»
Concurrent Automata vs. Asynchronous Systems
15 years 8 months ago
Download
www.cmi.univ-mrs.fr
We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk...
Rémi Morin
claim paper
Read More »
« first
‹ previous
1
2