Modeling concurrency with partial orders
International Journal of Parallel Programming
On the semantics of concurrency: partial orders and transition systems
The International Joint Conference on theory and practice of software development on TAPSOFT '87
The equational theory of pomsets
Theoretical Computer Science
Full abstraction for series-parallel pomsets
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Metric pomset semantics for a concurrent language with recursion
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
An Eilenberg theorem for ∞ -languages
Proceedings of the 18th international colloquium on Automata, languages and programming
Denotational semantics in the cpo and metric approach
Theoretical Computer Science
Handbook of logic in computer science (vol. 4)
Concatenable weighted pomsets and their applications to modelling processes of Petri nets
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Partial words and a theorem of Fine and Wilf
Theoretical Computer Science
Series-parallel languages and the bounded-width property
Theoretical Computer Science
Long words: the theory of concatenation and &ohgr;-power
Theoretical Computer Science
Concurrency, Modularity, and Synchronization
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Pomset Semantics for True Concurrency with Synchronization and Recursion (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Series-Parallel Posets: Algebra, Automata and Languages
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Algebraic Characterization of Petri Net Pomset Semantics
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
CCS with Hennessy's merge has no finite-equational axiomatization
Theoretical Computer Science - Expressiveness in concurrency
| Hi-index | 5.23 |
We consider two-sorted algebras of finite and infinite partial words equipped with the subsumption preorder and the operations of series and parallel product and omega power. It is shown that the valid equations and inequations of these algebras can be described by an infinite collection of simple axioms, and that no finite axiomatization exists. We also prove similar results for two related preorders, namely for the induced partial subword preorder and the partial subword preorder. Along the way of proving these results, we provide a concrete description of the free algebras in the corresponding varieties in terms of generalized series-parallel partial words.