Deciding Properties of Timed Transition Models

Real-time distributed systems are modeled by a times transition model (TTM). For any finite-state TTM, decision procedures are provided for checking a small but important class of properties (specified in real-time temporal logic). The procedures are linear in the size of the system reachability graph. The class of properties includes invariance, precedence, eventuality and real-time response specifications. >

[1]  Farnam Jahanian,et al.  A Method for Verifying Properties of Modechart Specifications , 1988, RTSS.

[2]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[3]  Zohar Manna,et al.  How to cook a temporal proof system for your pet language , 1983, POPL '83.

[4]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[5]  Nancy G. Leveson,et al.  Safety Analysis Using Petri Nets , 1987, IEEE Transactions on Software Engineering.

[6]  Z. Manna,et al.  Verification of concurrent programs: a temporal proof system , 1983 .

[7]  Jonathan S. Ostroff,et al.  Temporal logic for real-time systems , 1989 .

[8]  J. Ostroff,et al.  State machines, temporal logic and control: A framework for discrete event systems , 1987, 26th IEEE Conference on Decision and Control.

[9]  Aloysius K. Mok,et al.  A Graph-Theoretic Approach for Timing Analysis and its Implementation , 1987, IEEE Transactions on Computers.

[10]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, TOPL.

[11]  K. Mani Chandy.  Parallel program design , 1989 .

[12]  Chin-Laung Lei,et al.  Modalities for model checking (extended abstract): branching time strikes back , 1985, POPL.

[13]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[14]  Miguel Menasche,et al.  PAREDE: An Automated Tool for the Analysis of Time(d) Petri Nets , 1985, Petri Nets and Performance Models.

[15]  E. Emerson,et al.  Modalities for model checking (extended abstract): branching time strikes back , 1985, ACM-SIGACT Symposium on Principles of Programming Languages.

[16]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[17]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[18]  Kurt Mehlhorn,et al.  Graph Algorithm and NP-Completeness , 1984 .

[19]  Zohar Manna,et al.  Proving Precedence Properties: The Temporal Way , 1983, ICALP.

[20]  Wlodzimierz M. Zuberek,et al.  Timed Petri nets and preliminary performance evaluation , 1980, ISCA '80.

[21]  Jonathan S. Ostroff,et al.  Real-time temporal logic decision procedures , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[22]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends , 1986, Current Trends in Concurrency.

[23]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .