Pushdown automata, multiset automata, and Petri nets (Q5941098): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59556974 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for process generating context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebra of communicating processes with abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary bisimulation decision procedure for arbitrary context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation collapse and the process taxonomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4355677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes canoniques de graphes algébriques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regular structure of prefix rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm to decide on the equivalence of stateless DPDA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation equivalence is decidable for all context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the decidability of bisimulation for normed BPA- processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable equivalences for basic process algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for deciding bisimilarity of normed context-free processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of bisimilarity for Petri nets and some related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets and regular processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique decomposition of processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of ends, pushdown automata, and second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic pushdown automata is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for normed pushdown processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets and regular languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:20, 3 June 2024

scientific article; zbMATH DE number 1635263
Language Label Description Also known as
English
Pushdown automata, multiset automata, and Petri nets
scientific article; zbMATH DE number 1635263

    Statements

    Pushdown automata, multiset automata, and Petri nets (English)
    0 references
    0 references
    0 references
    20 August 2001
    0 references
    0 references
    automata
    0 references
    bisimulation
    0 references
    concurrency
    0 references
    Petri nets
    0 references
    rewrite 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