The computational complexity of scenario-based agent verification and design (Q2372186): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Modular refinement of hierarchic reactive machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Sequential Conditions by Finite-State Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4824478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSCs: Breathing life into message sequence charts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statecharts: a visual formalism for complex systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SYNTHESIZING STATE-BASED OBJECT SYSTEMS FROM LSC SPECIFICATIONS / 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: Q4413201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Tree Automata and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3833630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional linear temporal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of achievement and maintenance problems in agent-based systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable problems of decentralized observation and control on regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-theoretic techniques for modal logics of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic can be more expressive / rank
 
Normal rank

Latest revision as of 12:46, 26 June 2024

scientific article
Language Label Description Also known as
English
The computational complexity of scenario-based agent verification and design
scientific article

    Statements

    The computational complexity of scenario-based agent verification and design (English)
    0 references
    0 references
    0 references
    25 July 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    scenarios
    0 references
    strategies
    0 references
    AUML
    0 references
    live sequence charts
    0 references
    synthesis
    0 references
    model checking
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references