Hardness of preorder checking for basic formalisms (Q650916): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001225349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding bisimilarity is P-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of verifying concurrent transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding true concurrency equivalences on safe, finite nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence-checking on infinite-state systems: Techniques and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on Web Services Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of equivalence problems for concurrent systems of finite agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of equivalence checking for composed finite-state systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying abstractions of timed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484486 / rank
 
Normal rank

Latest revision as of 18:05, 4 July 2024

scientific article
Language Label Description Also known as
English
Hardness of preorder checking for basic formalisms
scientific article

    Statements

    Hardness of preorder checking for basic formalisms (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2011
    0 references
    0 references
    behavioral preorders and equivalences
    0 references
    preorder and equivalence checking
    0 references
    non-flat finite-state systems
    0 references
    timed automata
    0 references
    computational complexity
    0 references
    0 references