The following pages link to The equational theory of pomsets (Q1119012):
Displayed 50 items.
- Developments in concurrent Kleene algebra (Q299202) (← links)
- Concurrent Kleene algebra with tests and branching automata (Q299205) (← links)
- Concurrent Kleene algebra and its foundations (Q549679) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- On the homomorphism order of labeled posets (Q634750) (← links)
- Free shuffle algebras in language varieties (Q671351) (← links)
- Branching automata with costs -- a way of reflecting parallelism in costs (Q703495) (← links)
- Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) (Q783293) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Axiomatizing shuffle and concatenation in languages (Q1383153) (← links)
- Series-parallel languages and the bounded-width property (Q1566734) (← links)
- Asynchronous cellular automata for pomsets (Q1583242) (← links)
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words (Q1605337) (← links)
- Two equational theories of partial words (Q1643141) (← links)
- On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
- CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
- Schedulers and finishers: on generating and filtering the behaviours of an event structure (Q1786565) (← links)
- Algebra and theory of order-deterministic pomsets (Q1815430) (← links)
- Decidability of split equivalence (Q1854504) (← links)
- Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
- Lattice-based sum of t-norms on bounded lattices (Q2042882) (← links)
- Operational semantics with semicommutations (Q2043812) (← links)
- A categorical framework for learning generalised tree automata (Q2104477) (← links)
- Learning pomset automata (Q2233430) (← links)
- Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations (Q2256965) (← links)
- An application of temporal projection to interleaving concurrency (Q2403529) (← links)
- Labeled posets are universal (Q2472843) (← links)
- Posets with interfaces as a model for concurrency (Q2672275) (← links)
- Causality in Bounded Petri Nets is MSO Definable (Q2820695) (← links)
- The Laws of Programming Unify Process Calculi (Q2908555) (← links)
- Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers (Q2941142) (← links)
- Exploring an Interface Model for CKA (Q2941164) (← links)
- Preference Decomposition and the Expressiveness of Preference Query Languages (Q2941167) (← links)
- On Locality and the Exchange Law for Concurrent Processes (Q3090834) (← links)
- (Q3121529) (← links)
- Behavioural Analysis of Sessions Using the Calculus of Structures (Q3179170) (← links)
- Schedulers and Finishers: On Generating the Behaviours of an Event Structure (Q3179396) (← links)
- Event Correlation with Boxed Pomsets (Q3614848) (← links)
- Unifying Petri Net Semantics with Token Flows (Q3636837) (← links)
- Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
- Languages under concatenation and shuffling (Q4327410) (← links)
- Nonfinite axiomatizability of the equational theory of shuffle (Q4645164) (← links)
- Algebraic and graph-theoretic properties of infinite<i>n</i>-posets (Q4680742) (← links)
- Equational Theories of Scattered and Countable Series-Parallel Posets (Q5041243) (← links)
- Languages of higher-dimensional automata (Q5076390) (← links)
- Convolution and concurrency (Q5084483) (← links)
- (Q5089295) (← links)
- Free shuffle algebras in language varieties extended abstract (Q5096327) (← links)
- Nonfinite axiomatizability of shuffle inequalities (Q5096740) (← links)