Q5111454 (Q5111454): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.46298/lmcs-19(4:33)2023 / rank
 
Normal rank
Property / publication date
 
16 January 2024
Timestamp+2024-01-16T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 16 January 2024 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68-XX / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7789005 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1702.07213 / rank
 
Normal rank
Property / title
 
Synchronizability of Communicating Finite State Machines is not Decidable (English)
Property / title: Synchronizability of Communicating Finite State Machines is not Decidable (English) / rank
 
Normal rank
Property / published in
 
Property / published in: Logical Methods in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated verification of automata communicating via FIFO and bag buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Analysis of Asynchronously Communicating Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deciding synchronizability for asynchronously communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding choreography realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizability for Verification of Asynchronously Communicating Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of verifying message passing programs under bounded asynchrony / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Theorem for the Verification of Round-Based Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of programs with half-duplex communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable Topologies for Communicating Automata with FIFO and Bag Channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing Lossy and Perfect Fifo Channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty Session Types Meet Communicating Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kleene theorem and model checking algorithms for existentially bounded communicating automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Analysis of Communicating Pushdown Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-Bounded Analysis of Concurrent Queue Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realisability of choreographies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank

Latest revision as of 10:23, 23 August 2024

scientific article; zbMATH DE number 7204574
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7204574

    Statements

    0 references
    0 references
    27 May 2020
    0 references
    16 January 2024
    0 references
    verification
    0 references
    distributed system
    0 references
    asynchronous communications
    0 references
    choreographies
    0 references
    Synchronizability of Communicating Finite State Machines is not Decidable (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references