Theory of traces (Q1107296): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Traces, dependency graphs and DNLC grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace languages defined by regular string languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3657452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membership problems for regular and context-free trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3763601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing partial orderings into chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial problems of commutation and rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3736919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3954801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiserialization of iterated transactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3675512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices de Hankel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communicating sequential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of context-free string languages by directed node- label controlled graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3899505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5840053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3696528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regular trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square-free words on partially commutative free monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial commutations and faithful rational transductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-commutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable subsets of some partially Abelian monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of commutation in free partially commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal serializability of iterated transactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4743720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on finite asynchronous automata / rank
 
Normal rank

Latest revision as of 17:34, 18 June 2024

scientific article
Language Label Description Also known as
English
Theory of traces
scientific article

    Statements

    Theory of traces (English)
    0 references
    1988
    0 references
    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).
    0 references
    dependency graph
    0 references
    synchronization
    0 references
    traces
    0 references
    concurrent systems
    0 references
    Petri nets
    0 references
    condition/event systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers