The sweep-line state space exploration method (Q418783): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(8 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Lars Michael Kristensen / rank
Normal rank
 
Property / author
 
Property / author: Lars Michael Kristensen / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPIN / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DiVinE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LoLA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Murphi / rank
 
Normal rank
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.12.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133556419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of McMillan's unfolding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Petri nets. 1: Basic models. Advances in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: State space reduction using partial order techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ComBack Method – Extending Hash Compaction with Backtracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3045260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloured Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3045268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Concurrency and Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods in Computer-Aided Design / rank
 
Normal rank

Revision as of 06:23, 5 July 2024

scientific article
Language Label Description Also known as
English
The sweep-line state space exploration method
scientific article

    Statements

    The sweep-line state space exploration method (English)
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    explicit state space exploration
    0 references
    model checking
    0 references
    concurrent systems
    0 references
    verification
    0 references
    state explosion
    0 references
    sweep-line method
    0 references
    coloured Petri nets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers