Semi-commutations
From MaRDI portal
Publication:1094144
DOI10.1016/0890-5401(87)90040-XzbMath0629.68078MaRDI QIDQ1094144
Mireille Clerbout, Michel Latteux
Publication date: 1987
Published in: Information and Computation (Search for Journal in Brave)
Related Items
Two techniques in the area of the star problem in trace monoids, On the synchronization of semi-traces, A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols, Theory of traces, On lexicographic semi-commutations, 2-asynchronous automata, An extended framework for passive asynchronous testing, Regular languages and partial commutations, Semi-trace morphisms and rational transductions, Modelling concurrency with semi-commutations, The word problem for \(1\mathcal{LC}\) congruences is NP-hard., Characterization of Star-Connected Languages Using Finite Automata, On regular compatibility of semi-commutations, Reordering Derivatives of Trace Closures of Regular Languages., A canonical automaton for one-rule length-preserving string rewrite systems, Semicommutations and algebraic languages, Decidability of the star problem in \(A^*\times{}\{ b\}^*\), Semi-commutations and rational expressions, Operational semantics with semicommutations, Synchronization expressions with extended join operation, Semi-commutations and Petri nets, Topological Characterisation of Multi-Buffer Simulation, Synchronization languages, A theory of regular MSC languages, Compositionality in dataflow synchronous languages: Specification and distributed code generation, Synchronization languages and rewriting systems, The star problem and the finite power property in trace monoids: Reductions beyond C4, Atomic semicommutations, An extension of Kleene's and Ochmański's theorems to infinite traces, Checking conformance for time-constrained scenario-based specifications
Cites Work
