Trace consistency and inevitability

DOI10.1007/3-540-62034-6_54MaRDI QIDQ6567776zbMATH OpenFDO

Authors R. Ramanujam

Publication date 5 July 2024

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1104444
• Inevitability in concurrent systems
• Concurrent systems and inevitability
• scientific article; zbMATH DE number 1302050
• On undecidability of propositional temporal logics on trace systems

Cites work

• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• scientific article; zbMATH DE number 177511 (Why is no real title available?)
• A logical study of distributed transition systems
• A partial approach to model checking
• Concurrent systems and inevitability
• Defining conditional independence using collapses
• On undecidability of propositional temporal logics on trace systems
• Proving partial order properties
• Rational and recognizable complex trace languages
• Verification of distributed programs using representative interleaving sequences

This page was built for publication: Trace consistency and inevitability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567776)