A framework for compositional nonblocking verification of extended finite-state machines (Q262429): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Q246104 / rank
Normal rank
 
Property / author
 
Property / author: Martin Fabian / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 93C65 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 93A13 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C90 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6560833 / rank
 
Normal rank
Property / zbMATH Keywords
 
extended finite-state machines
Property / zbMATH Keywords: extended finite-state machines / rank
 
Normal rank
Property / zbMATH Keywords
 
model checking
Property / zbMATH Keywords: model checking / rank
 
Normal rank
Property / zbMATH Keywords
 
nonblocking
Property / zbMATH Keywords: nonblocking / rank
 
Normal rank
Property / zbMATH Keywords
 
compositional verification
Property / zbMATH Keywords: compositional verification / rank
 
Normal rank
Property / zbMATH Keywords
 
supervisory control theory
Property / zbMATH Keywords: supervisory control theory / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Supremica / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FORCE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1930392193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Nonconflict of Supervisors Using Abstractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional Verification in Supervisory Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional Nonblocking Verification Using Generalized Nonblocking Abstractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONFLICTS AND FAIR TESTING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconflict check by using sequential automaton abstractions based on weak observation equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and control of discrete event systems using finite state machines with variables and their applications in power grids / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:11, 11 July 2024

scientific article
Language Label Description Also known as
English
A framework for compositional nonblocking verification of extended finite-state machines
scientific article

    Statements

    A framework for compositional nonblocking verification of extended finite-state machines (English)
    0 references
    0 references
    0 references
    0 references
    29 March 2016
    0 references
    extended finite-state machines
    0 references
    model checking
    0 references
    nonblocking
    0 references
    compositional verification
    0 references
    supervisory control theory
    0 references
    0 references
    0 references

    Identifiers