Constraint automata are formalisms to describe the behavior and possible data flow in coordination models. In this paper we introduce a linear time temporal logic, called temporal logic of steps (TLS), for specifying the executions of constraint automata. TLS is the first attempt in presenting a linear temporal logic for constraint automata. Having TLS in hand, we are able to design model checking algorithms for verification of concurrent systems modeled by constraint automata. © 2008 Springer-Verlag.
CITATION STYLE
Navidpour, S., & Izadi, M. (2008). Linear temporal logic of constraint automata. In Communications in Computer and Information Science (Vol. 6 CCIS, pp. 972–975). https://doi.org/10.1007/978-3-540-89985-3_146
Mendeley helps you to discover research relevant for your work.