An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / cites work
 
Property / cites work: A syntactic congruence for rational \(\omega\)-languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational and recognizable complex trace languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of distributed programs using representative interleaving sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Event fairness and non-interleaving concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3752578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining partial-order reductions with on-the-fly model-checking. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving partial order properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic approach for checking closure properties of Ω-regular languages / 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 complementation problem for Büchi automata with applications to temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An expressively complete linear time temporal logic for Mazurkiewicz traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stubborn attack on state explosion / 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: Reasoning about infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic can be more expressive / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:11, 28 May 2024

scientific article
Language Label Description Also known as
English
An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
scientific article

    Statements

    An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (English)
    0 references
    0 references
    0 references
    0 references
    30 March 1999
    0 references
    concurrency theory
    0 references
    specification languages
    0 references
    linear temporal logic
    0 references

    Identifiers