Adequate proof principles for invariance and liveness properties of concurrent programs
Science of Computer Programming
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
An old-fashioned recipe for real time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
System Specification and Refinement in Temporal Logic
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.01 |
In this paper, we discuss the two approaches to the type of formalism used to express specifications: logic-based approach and model-based approach. Temporal logic and state machine, representatives of formalisms used in each approach, are compared. As a result of this comparison, we know that although temporal logics have many advantages, especially abstraction and flexibility of the specification process, they fail to directly characterize situations easily modeled by model-based formalisms, such as "local" properties of execution sequences. To copy with these drawbacks, we present a new kind of formalism: fair transition system specification (FTSS). This approach combines the best features of temporal logic and state machine methods and it is easy to understand and use. A nontrivial example is used to illustrate our approach and it shows that our FTSS approach is promising.