Loading...

Linear temporal logic of constraint automata

Navidpour, S ; Sharif University of Technology | 2008

485 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-89985-3_146
  3. Publisher: 2008
  4. Abstract:
  5. 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
  6. Keywords:
  7. Concurrent systems ; Constraint automata ; Coordination model ; Data flow ; Design models ; Linear temporal logic ; Linear time temporal logic ; Weak and Strong Fairness ; Computer science ; Data flow analysis ; Model checking ; Seebeck effect ; Temporal logic ; Automata theory
  8. Source: 13th International Computer Society of Iran Computer Conference on Advances in Computer Science and Engineering, CSICC 2008, Kish Island, 9 March 2008 through 11 March 2008 ; Volume 6 CCIS , 2008 , Pages 972-975 ; 18650929 (ISSN); 3540899847 (ISBN); 9783540899846 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-540-89985-3_146