Theory of traces
From MaRDI portal
DOI10.1016/0304-3975(88)90051-5zbMATH Open0652.68017OpenAlexW1967736886WikidataQ57402292 ScholiaQ57402292MaRDI QIDQ1107296FDOQ1107296
Authors: Ijsbrand Jan Aalbersberg, Grzegorz Rozenberg 
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90051-5
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Rough sets
- Title not available (Why is that?)
- A lattice-theoretical fixpoint theorem and its applications
- Parallel concepts in graph theory
- Title not available (Why is that?)
- Communicating sequential processes
- Matrices de Hankel
- Recognizable subsets of some partially Abelian monoids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Membership problems for regular and context-free trace languages
- Combinatorial problems of commutation and rearrangements
- Notes on finite asynchronous automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semi-commutations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- Title not available (Why is that?)
- On regular trace languages
- A characterization of context-free string languages by directed node- label controlled graph grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
- Maximal serializability of iterated transactions
- Title not available (Why is that?)
- Partial commutations and faithful rational transductions
- Some properties of commutation in free partially commutative monoids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiserialization of iterated transactions
- Square-free words on partially commutative free monoids
- Traces, dependency graphs and DNLC grammars
- Trace languages defined by regular string languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposing partial orderings into chains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions
Cited In (89)
- The poset of infinitary traces
- Word problems over traces which are solvable in linear time
- The shuffle algebra and its derivations
- A denotational theory of synchronous reactive systems
- Star-free trace languages
- On a subclass of context-free groups
- Shuffle on trajectories: Syntactic constraints
- Title not available (Why is that?)
- The monadic second-order logic of graphs. X: Linear orderings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Representation of computations in concurrent automata by dependence orders
- Efficient solution of some problems in free partially commutative monoids
- Synchronization expressions with extended join operation
- The Implementation of Mazurkiewicz Traces in POEM
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids
- On the structure of recognizable languages of dependence graphs
- A remark on the representation of trace monoids
- Probabilistic asynchronous automata
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- Asynchronous automata versus asynchronous cellular automata
- Local testability from words to traces, a suitable definition
- A generalization of traces
- Title not available (Why is that?)
- Characterizations of the decidability of some problems for regular trace languages
- Logical definability on infinite traces
- Trace-oriented models of concurrency
- Semi-commutations and rational expressions
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs
- 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
- Recognizable trace languages, distributed automata and the distribution problem
- Trace monoids with some invertible generators: Two decision problems
- The lattices of prefixes and overlaps of traces
- Event structures and trace monoids
- Lyndon traces and shuffle algebras
- Compositionality in dataflow synchronous languages: Specification and distributed code generation
- Infinite traces and symbolic dynamics
- The ideal property and traces
- The complexity of regular DNLC graph languages
- Word problems over traces which are solvable in linear time
- Probabilistic estimation of the number of prefixes of a trace
- Title not available (Why is that?)
- Weak equivalence of higher-dimensional automata
- Partially abelian squarefree words
- Characterizations of the trace
- 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
- From domains to automata with concurrency
- A kleene theorem for recognizable languages over concurrency monoids
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
- Nonexpressibility of fairness and signaling
- Traceable Sets
- Compositional relational semantics for indeterminate dataflow networks
- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
- Title not available (Why is that?)
- Logical definability of some rational trace languages
- Asynchronous cellular automata for infinite traces
- Algebra and theory of order-deterministic pomsets
- Title not available (Why is that?)
- Traces of operators and their history
- On some decision problems for trace codings
- Recognizable languages in concurrency monoids
- On the concatenation of infinite traces
- Connections between a concrete and an abstract model of concurrent systems
- Computing Petri net languages by reductions
- Languages and logical definability in concurrency monoids
- Resource traces: A domain for processes sharing exclusive resources.
- Title not available (Why is that?)
- Title not available (Why is that?)
- The word problem for \(1\mathcal{LC}\) congruences is NP-hard.
- Net models of discrete information transducers. I
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA
- SC-expressions in object-oriented languages
- Trace theories and localization
- On restarting automata with window size one
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
- Linear automata with translucent letters and linear context-free trace languages
- Subclasses of recognizable trace languages
- An Automata-Theoretical Characterization of Context-Free Trace Languages
- Poset properties of complex traces
- Efficient rewriting in cograph trace monoids
- Semi-commutations and Petri nets
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
- On the synchronization of traces
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)
