The incompleteness of Misra and Chandy's proof systems (Q1064051)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The incompleteness of Misra and Chandy's proof systems |
scientific article; zbMATH DE number 3919793
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The incompleteness of Misra and Chandy's proof systems |
scientific article; zbMATH DE number 3919793 |
Statements
The incompleteness of Misra and Chandy's proof systems (English)
0 references
1985
0 references
In this paper we show that \textit{J. Misra} and \textit{K. M. Chandy}'s proof systems for networks of communicating processes [cf. e.g. IEEE Trans. Software Eng. SE-7, 417-426 (1981; Zbl 0468.68030)] are incomplete.
0 references
relative completeness
0 references
temporal logic
0 references
networks of communicating processes
0 references
0 references
0.86557996
0 references
0.86005753
0 references
0.85891545
0 references
0.8487945
0 references
0 references
0.84709084
0 references
