Recommendations
Cites work
- scientific article; zbMATH DE number 3885321 (Why is no real title available?)
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 3870628 (Why is no real title available?)
- scientific article; zbMATH DE number 3874641 (Why is no real title available?)
- scientific article; zbMATH DE number 3808972 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3896285 (Why is no real title available?)
- scientific article; zbMATH DE number 3903969 (Why is no real title available?)
- scientific article; zbMATH DE number 3921989 (Why is no real title available?)
- scientific article; zbMATH DE number 3924146 (Why is no real title available?)
- scientific article; zbMATH DE number 3956459 (Why is no real title available?)
- scientific article; zbMATH DE number 3970130 (Why is no real title available?)
- scientific article; zbMATH DE number 3972221 (Why is no real title available?)
- scientific article; zbMATH DE number 3978397 (Why is no real title available?)
- scientific article; zbMATH DE number 3978418 (Why is no real title available?)
- scientific article; zbMATH DE number 4020497 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3679192 (Why is no real title available?)
- scientific article; zbMATH DE number 3707757 (Why is no real title available?)
- scientific article; zbMATH DE number 3735177 (Why is no real title available?)
- scientific article; zbMATH DE number 3740770 (Why is no real title available?)
- scientific article; zbMATH DE number 3765174 (Why is no real title available?)
- scientific article; zbMATH DE number 3765179 (Why is no real title available?)
- scientific article; zbMATH DE number 3774866 (Why is no real title available?)
- scientific article; zbMATH DE number 3594628 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 568838 (Why is no real title available?)
- scientific article; zbMATH DE number 3798998 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3307592 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- scientific article; zbMATH DE number 3099365 (Why is no real title available?)
- A characterization of context-free string languages by directed node- label controlled graph grammars
- A lattice-theoretical fixpoint theorem and its applications
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- Combinatorial problems of commutation and rearrangements
- Communicating sequential processes
- Decomposing partial orderings into chains
- Matrices de Hankel
- Maximal serializability of iterated transactions
- Membership problems for regular and context-free trace languages
- Multiserialization of iterated transactions
- Notes on finite asynchronous automata
- On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions
- On regular trace languages
- Parallel concepts in graph theory
- Partial commutations and faithful rational transductions
- Recognizable subsets of some partially Abelian monoids
- Rough sets
- Semi-commutations
- Some properties of commutation in free partially commutative monoids
- Square-free words on partially commutative free monoids
- Trace languages defined by regular string languages
- Traces, dependency graphs and DNLC grammars
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
Cited in
(94)- Connections between a concrete and an abstract model of concurrent systems
- Step traces
- The poset of infinitary traces
- The shuffle algebra and its derivations
- Computing Petri net languages by reductions
- Word problems over traces which are solvable in linear time
- Resource traces: A domain for processes sharing exclusive resources.
- A denotational theory of synchronous reactive systems
- Languages and logical definability in concurrency monoids
- Star-free trace languages
- On a subclass of context-free groups
- Shuffle on trajectories: Syntactic constraints
- The monadic second-order logic of graphs. X: Linear orderings
- scientific article; zbMATH DE number 3959809 (Why is no real title available?)
- scientific article; zbMATH DE number 4030996 (Why is no real title available?)
- Representation of computations in concurrent automata by dependence orders
- scientific article; zbMATH DE number 4119618 (Why is no real title available?)
- Efficient solution of some problems in free partially commutative monoids
- scientific article; zbMATH DE number 4179485 (Why is no real title available?)
- Synchronization expressions with extended join operation
- scientific article; zbMATH DE number 4064449 (Why is no real title available?)
- The word problem for \(1\mathcal{LC}\) congruences is NP-hard.
- The Implementation of Mazurkiewicz Traces in POEM
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids
- Compositionality in dataflow synchronous languages: specification \& code generation
- Net models of discrete information transducers. I
- A remark on the representation of trace monoids
- On the structure of recognizable languages of dependence graphs
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- Asynchronous automata versus asynchronous cellular automata
- Probabilistic asynchronous automata
- Local testability from words to traces, a suitable definition
- A generalization of traces
- Logical definability on infinite traces
- scientific article; zbMATH DE number 3924146 (Why is no real title available?)
- Characterizations of the decidability of some problems for regular trace languages
- Trace-oriented models of concurrency
- SC-expressions in object-oriented languages
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs
- Semi-commutations and rational expressions
- Executions: A new partial-order semantics of Petri nets
- On undecidability of propositional temporal logics on trace systems
- On recognizable and rational formal power series in partially commuting variables
- An extension of Kleene's and Ochmański's theorems to infinite traces
- Möbius functions and confluent semi-commutations
- Generating symbolic traces in the insertion modeling system
- Recognizable trace languages, distributed automata and the distribution problem
- Trace monoids with some invertible generators: Two decision problems
- Event structures and trace monoids
- Trace theories and localization
- The lattices of prefixes and overlaps of traces
- Lyndon traces and shuffle algebras
- Infinite traces and symbolic dynamics
- On restarting automata with window size one
- Compositionality in dataflow synchronous languages: Specification and distributed code generation
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
- Probabilistic estimation of the number of prefixes of a trace
- The complexity of regular DNLC graph languages
- Word problems over traces which are solvable in linear time
- The ideal property and traces
- Recognizable and logically definable languages of infinite computations in concurrent automata
- scientific article; zbMATH DE number 4072393 (Why is no real title available?)
- On a measure for the descriptional complexity of finite automata with translucent words
- Characterizations of the trace
- Weak equivalence of higher-dimensional automata
- Linear automata with translucent letters and linear context-free trace languages
- The expressive power of indeterminate dataflow primitives
- Infinite concurrent systems. I: The relationship between metric and order convergence
- A note on the construction of marked graphs
- Subclasses of recognizable trace languages
- Partially abelian squarefree words
- An Automata-Theoretical Characterization of Context-Free Trace Languages
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
- From domains to automata with concurrency
- A kleene theorem for recognizable languages over concurrency monoids
- Poset properties of complex traces
- Semi-commutations and Petri nets
- Nonexpressibility of fairness and signaling
- Efficient rewriting in cograph trace monoids
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
- On the synchronization of traces
- Traceable Sets
- Compositional relational semantics for indeterminate dataflow networks
- scientific article; zbMATH DE number 3938548 (Why is no real title available?)
- Topological aspects of traces
- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
- Logical definability of some rational trace languages
- Asynchronous cellular automata for infinite traces
- Algebra and theory of order-deterministic pomsets
- scientific article; zbMATH DE number 4121456 (Why is no real title available?)
- On some decision problems for trace codings
- Recognizable languages in concurrency monoids
- On the concatenation of infinite traces
- Traces of operators and their history
This page was built for publication: Theory of traces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107296)
