The equational theory of pomsets
- 30 November 1988
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 61 (2-3) , 199-224
- https://doi.org/10.1016/0304-3975(88)90124-7
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The mutual exclusion problemJournal of the ACM, 1986
- Modeling concurrency with partial ordersInternational Journal of Parallel Programming, 1986
- Extending regular expressions with iterated shuffleTheoretical Computer Science, 1985
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984
- A complete inference system for a class of regular behavioursJournal of Computer and System Sciences, 1984
- The power of synchronizing operations on stringsTheoretical Computer Science, 1981
- Shuffle languages, Petri nets, and context-sensitive grammarsCommunications of the ACM, 1981
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- Software Descriptions with Flow ExpressionsIEEE Transactions on Software Engineering, 1978
- Two Complete Axiom Systems for the Algebra of Regular EventsJournal of the ACM, 1966