R Morin - Mathematical Foundations of Computer Science 2005 - Springer
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 …
R Morin - Proceedings of the 30th international conference on …, 2005 - dl.acm.org
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 …
R MORIN - Lecture notes in computer science, 2005 - pascal-francis.inist.fr
Concurrent automata vs. asynchronous systems CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
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 …
R Morin - Mathematical Foundations of Computer Science 2005 - infona.pl
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 …
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 …
[引用][C]Concurrent Automata vs. Asynchronous Systems
R Morin - Mathematical Foundations of Computer Science 2005, 2005 - Springer
[引用][C]Concurrent automata vs. asynchronous systems
R MORIN - Lecture notes in computer science, 2005 - Springer
[引用][C]Concurrent Automata vs. Asynchronous Systems