Representation of computations in concurrent automata by dependence orders (Q1269906): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Theory of traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal and Optimal Computations of Recursive Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From domains to automata with concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelled domains and automata with concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependence orders for computations of concurrent automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics on traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCURRENT AUTOMATA AND DOMAINS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable languages in concurrency monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aperiodic languages in concurrency monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable languages in divisibility monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical definability on infinite traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equational theory of pomsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-free trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communicating sequential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining conditional independence using collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections between a concrete and an abstract model of concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional relational semantics for indeterminate dataflow networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3030239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for concurrency: Towards a classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on finite asynchronous automata / rank
 
Normal rank

Latest revision as of 15:56, 28 May 2024

scientific article
Language Label Description Also known as
English
Representation of computations in concurrent automata by dependence orders
scientific article

    Statements

    Representation of computations in concurrent automata by dependence orders (English)
    0 references
    0 references
    0 references
    0 references
    22 October 1998
    0 references
    finite computation sequences
    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