Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
In the paper a novel methodology, TS-U, is proposed based on existing model checking techniques that were extended to successfully model the systems in a ubiquitous environment by introducing time and space constraints relevant in modeling of some ubiquitous system for its validation. Method proposed requires only slight modification of the existing model checking tools by introducing the notion of a Transition Checking Matrix (TCM) which holds time and space constraints for model’s transitions. By applying TS-U methodology, regular CTL formulae can be used without modifications to successfully check the system’s model as in the traditional model checking based on the Kripke structure.