Semi-commutations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3970130 (Why is no real title available?)
- Combinatorial problems of commutation and rearrangements
- Maximal serializability of iterated transactions
- Partial commutations and faithful rational transductions
- Recognizable subsets of some partially Abelian monoids
Cited in
(36)- Regular languages and partial commutations
- The star problem and the finite power property in trace monoids: Reductions beyond C4
- Semiretractions and commutative bands
- Semi-trace morphisms and rational transductions
- 2-asynchronous automata
- Semi-commutativity and the McCoy condition.
- Synchronization expressions with extended join operation
- Two techniques in the area of the star problem in trace monoids
- The word problem for \(1\mathcal{LC}\) congruences is NP-hard.
- Synchronization languages
- Reordering Derivatives of Trace Closures of Regular Languages.
- Checking conformance for time-constrained scenario-based specifications
- Synchronization languages and rewriting systems
- Operational semantics with semicommutations
- Theory of traces
- On the synchronization of semi-traces
- Semi-commutations and rational expressions
- Atomic semicommutations
- An extension of Kleene's and Ochmański's theorems to infinite traces
- Characterization of Star-Connected Languages Using Finite Automata
- scientific article; zbMATH DE number 3954296 (Why is no real title available?)
- A theory of regular MSC languages
- Compositionality in dataflow synchronous languages: Specification and distributed code generation
- Topological characterisation of multi-buffer simulation
- An extended framework for passive asynchronous testing
- Efficiency of automata in semi-commutation verification techniques
- Modelling concurrency with semi-commutations
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
- A canonical automaton for one-rule length-preserving string rewrite systems
- Semi-commutations and Petri nets
- A normalized form for FIFO protocols traces, application to the replay of mode-based protocols
- On regular compatibility of semi-commutations
- Semi-commutations and Partial commutations
- On lexicographic semi-commutations
- Semicommutations and algebraic languages
- scientific article; zbMATH DE number 176161 (Why is no real title available?)
This page was built for publication: Semi-commutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094144)
