Mixed product and asynchronous automata
- 31 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 48, 183-199
- https://doi.org/10.1016/0304-3975(86)90094-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On some equations in free partially commutative monoidsTheoretical Computer Science, 1986
- Trace languages defined by regular string languagesRAIRO - Theoretical Informatics and Applications, 1986
- Maximal serializability of iterated transactionsTheoretical Computer Science, 1985
- Recognizable subsets of some partially abelian monoidsTheoretical Computer Science, 1985
- Automates et commutations partiellesRAIRO. Informatique théorique, 1985
- Languages infinitaires et produit de mixageTheoretical Computer Science, 1984
- The serializability of concurrent database updatesJournal of the ACM, 1979
- Concurrent Program Schemes and their InterpretationsDAIMI Report Series, 1977