This book is about the verification of reactive systems. A reactive system is a system that maintains an ongoing interaction with its environment, as opposed to computing some final …
Concurrency is pervasive in large systems. Unexpected interference among threads often results in “Heisenbugs” that are extremely difficult to reproduce and eliminate. We have …
Progress, Justness, and Fairness Page 1 69 Progress, Justness, and Fairness ROB VAN GLABBEEK and PETER HÖFNER, Data61, CSIRO and UNSW, Australia Fairness assumptions …
D Peled - … Aided Verification: 5th International Conference, CAV' …, 1993 - Springer
Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this …
M Abadi, L Lamport - ACM Transactions on Programming Languages …, 1993 - dl.acm.org
A rigorous modular specification method requires a proof rule asserting that if each component behaves correctly in isolation, then it behaves correctly in concert with other …
The volume of process-related data is growing rapidly: more and more business operations are being supported and monitored by information systems. Industry 4.0 and the …
D Peled - … Aided Verification: 6th International Conference, CAV' …, 1994 - Springer
Partial order model-checking is an approach to reduce time and memory in model-checking concurrent programs. On-the-fly model-checking is a technique to eliminate part of the …
RJR Back, R Kurki-Suonio - Proceedings of the second annual ACM …, 1983 - dl.acm.org
The behavior of a net of interconnected, communicating processes is described in terms of the joint actions in which the processes can participate. A distinction is made between …
TA Henzinger, Z Manna, A Pnueli - Real-Time: Theory in Practice: REX …, 1992 - Springer
We incorporate time into an interleaving model of concurrency. In timed transition systems, the qualitative fairness requirements of traditional transition system are replaced (and …