Automata and concurrency (Q794437): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some extended semaphore primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Asynchronous Control Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on: ''A comparison of two synchronizing concepts'' by P. B. Hansen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of two synchronizing concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5535414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Theory of Universal Speed-Independent Modules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reduction of asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über Möglichkeiten zur Simulation Endlicher Automaten durch eine Art Sequentieller Netzwerke aus einfachen Bausteinen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetische Prädikate über einem Bereich endlicher Automaten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible Automaten und Einfache Universelle 2‐Dimensionale Thue‐Systeme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Approach to Self-Correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the aggregation of preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206323 / rank
 
Normal rank

Latest revision as of 13:07, 14 June 2024

scientific article
Language Label Description Also known as
English
Automata and concurrency
scientific article

    Statements

    Automata and concurrency (English)
    0 references
    0 references
    1983
    0 references
    Nets of asynchronous parallel automata are defined. The author gives properties of these nets, e.g. compares them with Petri nets. He shows modular decomposition of Petri nets by nets over a given base.
    0 references
    0 references
    0 references
    modular Petri nets
    0 references
    simulation
    0 references
    concurrency
    0 references
    Nets of asynchronous parallel automata
    0 references
    modular decomposition
    0 references
    0 references