Axiomatizing the subsumption and subword preorders on finite and infinite partial words
From MaRDI portal
Publication:1605337
DOI10.1016/S0304-3975(00)00442-4zbMath0997.68069MaRDI QIDQ1605337
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Towards a language theory for infinite N-free pomsets., Convolution and concurrency, Posets with interfaces as a model for concurrency, CCS with Hennessy's merge has no finite-equational axiomatization, Schedulers and finishers: on generating and filtering the behaviours of an event structure, Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modeling concurrency with partial orders
- The equational theory of pomsets
- Behaviours of concurrent systems
- Four domains for concurrency
- Varieties of ordered algebras
- Partial words and a theorem of Fine and Wilf
- Denotational semantics in the cpo and metric approach
- Series-parallel languages and the bounded-width property
- The Recognition of Series Parallel Digraphs
- Long words: The theory of concatenation and \(\omega\)-power
- Algebraic characterization of petri net pomset semantics
