Theory of traces
The paper gives a good self contained introduction to the theory of traces, a theory which provides a mathematical description of the behaviour of concurrent systems. Its aim is to reconcile the sequential nature of observations of the system behaviour on the one hand and the nonsequential nature of causality between the actions of the system on the other hand. The paper presents a major portion of the theory of traces in a uniform way, holding a good balance between two possible sights of the subject (as partial commutative monoids resp. as labelled partial orders/\(labelled\) acyclic graphs). Furthermore a second part presents applications to Petri nets (condition/\(event\) systems).
- 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
- 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?)
- 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
- Characterizations of the trace
- Shuffle on trajectories: Syntactic constraints
- Trace monoids with some invertible generators: Two decision problems
- Executions: A new partial-order semantics of Petri nets
- Event structures and trace monoids
- Probabilistic estimation of the number of prefixes of a trace
- Combinatorics on traces
- A denotational theory of synchronous reactive systems
- Star-free trace languages
- On undecidability of propositional temporal logics on trace systems
- The expressive power of indeterminate dataflow primitives
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
- The shuffle algebra and its derivations
- Representation of computations in concurrent automata by dependence orders
- Synchronization expressions with extended join operation
- Nonexpressibility of fairness and signaling
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs
- An extension of Kleene's and Ochmański's theorems to infinite traces
- Recognizable trace languages, distributed automata and the distribution problem
- Asynchronous automata versus asynchronous cellular automata
- Lyndon traces and shuffle algebras
- Infinite concurrent systems. I: The relationship between metric and order convergence
- A note on the construction of marked graphs
- The monadic second-order logic of graphs. X: Linear orderings
- The word problem for \(1\mathcal{LC}\) congruences is NP-hard.
- Resource traces: A domain for processes sharing exclusive resources.
- The lattices of prefixes and overlaps of traces
- Algebra and theory of order-deterministic pomsets
- Semi-commutations and Petri nets
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- Compositionality in dataflow synchronous languages: Specification and distributed code generation
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids
- Net models of discrete information transducers. I
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
- Efficient solution of some problems in free partially commutative monoids
- The ideal property and traces
- Trace-oriented models of concurrency
- Traces of operators and their history
- An Automata-Theoretical Characterization of Context-Free Trace Languages
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
- Traceable Sets
- Trace theories and localization
- scientific article; zbMATH DE number 4179485 (Why is no real title available?)
- Linear automata with translucent letters and linear context-free trace languages
- A generalization of traces
- SC-expressions in object-oriented languages
- The Implementation of Mazurkiewicz Traces in POEM
- scientific article; zbMATH DE number 3924146 (Why is no real title available?)
- scientific article; zbMATH DE number 3938548 (Why is no real title available?)
- scientific article; zbMATH DE number 3959809 (Why is no real title available?)
- scientific article; zbMATH DE number 4030996 (Why is no real title available?)
- scientific article; zbMATH DE number 4064449 (Why is no real title available?)
- scientific article; zbMATH DE number 4072393 (Why is no real title available?)
- On a subclass of context-free groups
- scientific article; zbMATH DE number 1101603 (Why is no real title available?)
- On recognizable and rational formal power series in partially commuting variables
- From domains to automata with concurrency
- A Kleene theorem for recognizable languages over concurrency monoids
- Topological aspects of traces
- Characterizations of the decidability of some problems for regular trace languages
- scientific article; zbMATH DE number 4119618 (Why is no real title available?)
- On the synchronization of traces
- scientific article; zbMATH DE number 4121456 (Why is no real title available?)
- Logical definability of some rational trace languages
- Probabilistic asynchronous automata
- Weak equivalence of higher-dimensional automata
- Efficient rewriting in cograph trace monoids
- Computing Petri net languages by reductions
- Word problems over traces which are solvable in linear time
- Compositional relational semantics for indeterminate dataflow networks
- Subclasses of recognizable trace languages
- Poset properties of complex traces
- On restarting automata with window size one
- Semi-commutations and rational expressions
- Asynchronous cellular automata for infinite traces
- Recognizable and logically definable languages of infinite computations in concurrent automata
- On the structure of recognizable languages of dependence graphs
- Partially abelian squarefree words
- A remark on the representation of trace monoids
- Connections between a concrete and an abstract model of concurrent systems
- Step traces
- Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
- Languages and logical definability in concurrency monoids
- Recognizable languages in concurrency monoids
- On some decision problems for trace codings
- Logical definability on infinite traces
- On the concatenation of infinite traces
- Möbius functions and confluent semi-commutations
- On a measure for the descriptional complexity of finite automata with translucent words
- The poset of infinitary traces
- Compositionality in dataflow synchronous languages: specification \& code generation
- Local testability from words to traces, a suitable definition
- Infinite traces and symbolic dynamics
- Generating symbolic traces in the insertion modeling system
- The complexity of regular DNLC graph languages
- Word problems over traces which are solvable in linear time
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)