## Deriving Liveness Goals from Temporal Logic Specifications (1996)

Venue: | Journal of Symbolic Computation |

Citations: | 2 - 1 self |

### BibTeX

@ARTICLE{Caleiro96derivingliveness,

author = {C. Caleiro and G. Saake and A. Sernadas},

title = {Deriving Liveness Goals from Temporal Logic Specifications},

journal = {Journal of Symbolic Computation},

year = {1996},

volume = {22}

}

### OpenURL

### Abstract

Introduction The use of temporal logic has been widely explored both on the fields of specification and certification of properties of reactive systems (Pnueli, 1977), (Sernadas, 1980), (Fiadeiro and Maibaum, 1992), (Clarke, Grumberg and Kurshan, 1992), (Manna and Pnueli, 1992), (Manna and Pnueli, 1993), (Sernadas, Sernadas and Costa, 1995), (Sernadas, Sernadas and Ramos, 1996) and in monitoring (Hulsmann and Saake, 1991), (Kung, 1984), (Lipeck and Saake, 1987), (Schwiderski, Hartmann and Saake, 1994). The advantages are known to lie on the clear declarative formalization of the system at hand and on the use of temporal verification techniques to prove properties of the specified systems. Temporal logic specification has also given an important contribution towards the establishment of suitable compositional specification frameworks (Barringer, Kuiper and Pnueli, 1984). -- This work was partly supported by CEC under ESPRIT-III BRA WG 6071 IS-CORE (Information S

### Citations

1501 |
The Temporal Logic of Reactive and Concurrent Systems: Specifications. The Temporal Logic of Reactive and Concurrent Systems
- Manna, Pnueli
- 1992
(Show Context)
Citation Context ...explored both on the fields of specification and certification of properties of reactive systems (Pnueli, 1977), (Sernadas, 1980), (Fiadeiro and Maibaum, 1992), (Clarke, Grumberg and Kurshan, 1992), (=-=Manna and Pnueli, 1992-=-), (Manna and Pnueli, 1993), (Sernadas, Sernadas and Costa, 1995), (Sernadas, Sernadas and Ramos, 1996) and in monitoring (Hulsmann and Saake, 1991), (Kung, 1984), (Lipeck and Saake, 1987), (Schwiders... |

1204 |
The temporal logic of programs
- Pnueli
- 1977
(Show Context)
Citation Context ...d is not fully known. And obviously the computation given by executing it is for sure not the most pleasant. Similar problems arise, however, in other approaches to executing temporal logic programs (=-=Abadi and Manna, 1989-=-), (Fisher and Owens, 1992). 6. Conclusion and outlook We have shown how to synthesize a representative canonical G-automaton satisfying a temporal logic specification. Namely, we have managed to deri... |

1108 | Temporal and Modal Logic
- Emerson
- 1990
(Show Context)
Citation Context ...n outlook of possible developments of the proposed techniques. Through the paper, we assume that the reader is conversant with the field of temporal logic specification, for instance at the level of (=-=Emerson, 1990-=-), (Goldblatt, 1987), and with fairness and liveness issues (Francez, 1986), (Gabbay, Pnueli, Shelah and Stavi, 1980). Deriving Liveness Goals from Temporal Logic Specifications 3 In section 2 we intr... |

794 |
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
- CLARKE, EMERSON
- 1982
(Show Context)
Citation Context ...onal temporal logic satisfiability described in (Ben-Ari, Pnueli and Manna, 1983). The approach is therefore similar to the "traditional" methods for synthesizing models from temporal specif=-=ications (Clarke and Emerson, 1981-=-), (Manna and Wolper, 1984), (Pnueli and Rosner, 1988). However, we do not just choose a computation meeting the specification as in (Manna and Wolper, 1984) but we manage to build a G-automaton which... |

476 |
Automata on infinite objects
- Thomas
- 1990
(Show Context)
Citation Context ...nueli, 1993) but use an approach somehow similar to the acceptance structure of other, well known, definitions of automata on infinite computations such as those of Buchi, Muller or Streett automata (=-=Thomas, 1990-=-) or variants of these, eg. 8-automata (Manna and Pnueli, 1987). However, G-automata arise, in our opinion, much more naturally, while still emulating their expressive power. Mainly due to the fact th... |

334 |
On the Synthesis of a Reactive Module
- Pnueli, Rosner
- 1989
(Show Context)
Citation Context ...ri, Pnueli and Manna, 1983). The approach is therefore similar to the "traditional" methods for synthesizing models from temporal specifications (Clarke and Emerson, 1981), (Manna and Wolper=-=, 1984), (Pnueli and Rosner, 1988-=-). However, we do not just choose a computation meeting the specification as in (Manna and Wolper, 1984) but we manage to build a G-automaton which generates all of its models. Note that fairness or l... |

231 | On the temporal analysis of fairness - Gabbay, Pnueli, et al. - 1980 |

229 | Abstract and Concrete Categories - Adámek, Herrlich, et al. - 1990 |

200 |
Logics of Time and Computation
- Goldblatt
- 1987
(Show Context)
Citation Context ...ible developments of the proposed techniques. Through the paper, we assume that the reader is conversant with the field of temporal logic specification, for instance at the level of (Emerson, 1990), (=-=Goldblatt, 1987-=-), and with fairness and liveness issues (Francez, 1986), (Gabbay, Pnueli, Shelah and Stavi, 1980). Deriving Liveness Goals from Temporal Logic Specifications 3 In section 2 we introduce and illustrat... |

164 | The temporal logic of branching time - Ben-Ari, Pnueli, et al. - 1983 |

160 |
Synthesis of communicating processes from temporal logic specifications
- Manna, Wolper
- 1984
(Show Context)
Citation Context ...bility described in (Ben-Ari, Pnueli and Manna, 1983). The approach is therefore similar to the "traditional" methods for synthesizing models from temporal specifications (Clarke and Emerson=-=, 1981), (Manna and Wolper, 1984-=-), (Pnueli and Rosner, 1988). However, we do not just choose a computation meeting the specification as in (Manna and Wolper, 1984) but we manage to build a G-automaton which generates all of its mode... |

86 | METATEM: A framework for programming in temporal logic - Barringer, Fisher, et al. - 1989 |

74 | Completing the temporal picture
- Manna, Pnueli
- 1989
(Show Context)
Citation Context ...hall mean that, in general, a formula like ra cannot be expected to hold. We start by taking a brief look at some classes of formulae commonly used in systems specification (Manna and Pnueli, 1989), (=-=Manna and Pnueli, 1991-=-). Example 2.7. (Specifiable properties) Let '; / be formulae with no temporal operators and a be a prime action symbol over the same signature. We note the ability to specify, for instance: safety: (... |

63 | Object specification logic - Sernadas, Sernadas, et al. - 1995 |

55 |
Monitoring Dynamic Integrity Constraints Based on Temporal Logic
- Lipeck, Saake
- 1987
(Show Context)
Citation Context ...han, 1992), (Manna and Pnueli, 1992), (Manna and Pnueli, 1993), (Sernadas, Sernadas and Costa, 1995), (Sernadas, Sernadas and Ramos, 1996) and in monitoring (Hulsmann and Saake, 1991), (Kung, 1984), (=-=Lipeck and Saake, 1987-=-), (Schwiderski, Hartmann and Saake, 1994). The advantages are known to lie on the clear declarative formalization of the system at hand and on the use of temporal verification techniques to prove pro... |

47 |
A course
- Bell, Machover
- 1977
(Show Context)
Citation Context ...Pnueli and Manna, 1983) and, specifically, of the synthesis method proposed in (Manna and Wolper, 1984). We start by introducing the envisaged 14 C. Caleiro, G. Saake and A. Sernadas tableaux system (=-=Bell and Machover, 1977-=-) for the temporal logic we are using. Insight was also given by similar synthesis approaches for computation tree logics and producing tree automata (Clarke and Emerson, 1981), (Pnueli and Rosner, 19... |

41 |
History-less Checking of Dynamic Integrity Constraints
- Chomicki
- 1992
(Show Context)
Citation Context ...ues is their use for monitoring systems with respect to a given temporal specification. Monitoring of temporal logic constraints is a way to ensure dynamic integrity for example in the database area (=-=Chomicki, 1992-=-), (Kung, 1984), (Lipeck, 1990), (Lipeck, Gertz and Saake, 1994), (Lipeck and Saake, 1987) or in object systems (Schwiderski, Hartmann and Saake, 1994). In (Hulsmann and Saake, 1991), (Lipeck and Saak... |

36 |
Compositional trace–based semantics for probabilistic automata
- Segala
- 1995
(Show Context)
Citation Context ...ion of the strategy proposed and others are a further possible extension of the present work. An interesting line of reserach would be considering some kind of probabilistic automata (Pnueli, 1983), (=-=Segala, 1995-=-). By doing that we also make possible a probabilistic study of the correctness of implementation strategies and open the door to the use of probabilistic temporal logic (Hart and Sharir, 1984). Anoth... |

30 |
Probabilistic temporal logics for finite and bounded models, in: R. De Millo (Ed
- Hart, Sharir
- 1984
(Show Context)
Citation Context ...(Pnueli, 1983), (Segala, 1995). By doing that we also make possible a probabilistic study of the correctness of implementation strategies and open the door to the use of probabilistic temporal logic (=-=Hart and Sharir, 1984-=-). Another important subject is the study of compositionality results. The fact that a system specification can be compiled into a G-automaton may be very interestingly used together with, for instanc... |

29 |
Transformation of Dynamic Integrity Constraints into Transaction Specifications’, Theor
- Lipeck
- 1990
(Show Context)
Citation Context ...systems with respect to a given temporal specification. Monitoring of temporal logic constraints is a way to ensure dynamic integrity for example in the database area (Chomicki, 1992), (Kung, 1984), (=-=Lipeck, 1990-=-), (Lipeck, Gertz and Saake, 1994), (Lipeck and Saake, 1987) or in object systems (Schwiderski, Hartmann and Saake, 1994). In (Hulsmann and Saake, 1991), (Lipeck and Saake, 1987), (Saake, 1991), (Schw... |

28 |
Specification and verification of concurrent programs by 8automata
- Manna, Pnueli
- 1987
(Show Context)
Citation Context ...the acceptance structure of other, well known, definitions of automata on infinite computations such as those of Buchi, Muller or Streett automata (Thomas, 1990) or variants of these, eg. 8-automata (=-=Manna and Pnueli, 1987-=-). However, G-automata arise, in our opinion, much more naturally, while still emulating their expressive power. Mainly due to the fact that they explore transitions rather than states to formulate th... |

27 |
Temporal Aspects of Logical Procedure Definition
- Sernadas
- 1980
(Show Context)
Citation Context ...ton, execution, monitoring. 1. Introduction The use of temporal logic has been widely explored both on the fields of specification and certification of properties of reactive systems (Pnueli, 1977), (=-=Sernadas, 1980-=-), (Fiadeiro and Maibaum, 1992), (Clarke, Grumberg and Kurshan, 1992), (Manna and Pnueli, 1992), (Manna and Pnueli, 1993), (Sernadas, Sernadas and Costa, 1995), (Sernadas, Sernadas and Ramos, 1996) an... |

26 |
Descriptive Specification of Database Object Behaviour
- Saake
- 1991
(Show Context)
Citation Context ...), (Clarke, Grumberg and Kurshan, 1992), (Manna and Pnueli, 1992), (Manna and Pnueli, 1993), (Sernadas, Sernadas and Costa, 1995), (Sernadas, Sernadas and Ramos, 1996) and in monitoring (Hulsmann and =-=Saake, 1991-=-), (Kung, 1984), (Lipeck and Saake, 1987), (Schwiderski, Hartmann and Saake, 1994). The advantages are known to lie on the clear declarative formalization of the system at hand and on the use of tempo... |

24 | R.: From the Past to the Future: Executing Temporal Logic Programs
- Fisher, Owens
- 1992
(Show Context)
Citation Context ...inuing its execution from the reached state. This avoids the use of backtracking strategies which is, of course, very convenient in the case of an interactive prototyping environment as suggested in (=-=Fisher and Owens, 1992-=-). This main advantage is a direct consequence of a compiling instead of interpreting approach to programming languages. Consistency errors can be found at compilation time. While, of course, interpre... |

22 | An institution of object behaviour - Sernadas, Costa, et al. - 1994 |

18 | Concurrent metatem process – a language for distributed ai
- Fisher, Barringer
- 1991
(Show Context)
Citation Context ...parallel composition primitive in order to implement interconnections of concurrent systems. The framework can therefore be rather compositional and therefore used for prototyping concurrent systems (=-=Fisher and Barringer, 1991-=-), (Merz, 1992), (Fisher and Wooldridge, 1993). A severe drawback is that the ideas presented cannot be fully applied to first-order temporal logic (since it is incomplete). But, as pointed out by sev... |

16 | Pnueli A: Temporal proof methodologies for real-time systems
- TA, Manna
- 1991
(Show Context)
Citation Context ...s of specification and certification of properties of reactive systems (Pnueli, 1977), (Sernadas, 1980), (Fiadeiro and Maibaum, 1992), (Clarke, Grumberg and Kurshan, 1992), (Manna and Pnueli, 1992), (=-=Manna and Pnueli, 1993-=-), (Sernadas, Sernadas and Costa, 1995), (Sernadas, Sernadas and Ramos, 1996) and in monitoring (Hulsmann and Saake, 1991), (Kung, 1984), (Lipeck and Saake, 1987), (Schwiderski, Hartmann and Saake, 19... |

16 | System specification and refinement in temporal logic
- Pnueli
(Show Context)
Citation Context ...oth on the fields of specification and certification of properties of reactive systems (Pnueli, 1977), (Sernadas, 1980), (Fiadeiro and Maibaum, 1992), (Clarke, Grumberg and Kurshan, 1992), (Manna and =-=Pnueli, 1992-=-), (Manna and Pnueli, 1993), (Sernadas, Sernadas and Costa, 1995), (Sernadas, Sernadas and Ramos, 1996) and in monitoring (Hulsmann and Saake, 1991), (Kung, 1984), (Lipeck and Saake, 1987), (Schwiders... |

15 | A temporal logic approach to object certi - Sernadas, Sernadas, et al. - 1996 |

14 |
Theoretical Foundations of Handling Large Substitution Sets in Temporal Integrity Monitoring
- Hulsmann, Saake
- 1991
(Show Context)
Citation Context ...Maibaum, 1992), (Clarke, Grumberg and Kurshan, 1992), (Manna and Pnueli, 1992), (Manna and Pnueli, 1993), (Sernadas, Sernadas and Costa, 1995), (Sernadas, Sernadas and Ramos, 1996) and in monitoring (=-=Hulsmann and Saake, 1991-=-), (Kung, 1984), (Lipeck and Saake, 1987), (Schwiderski, Hartmann and Saake, 1994). The advantages are known to lie on the clear declarative formalization of the system at hand and on the use of tempo... |

13 | Executable temporal logic for distributed A.I - Fisher, Wooldridge - 1993 |

12 | 110 Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Springer LNCS 354 - Bakker, Roever, et al. - 1988 |

11 |
A Temporal Framework for Database Specification and Verification
- Kung
- 1984
(Show Context)
Citation Context ...mberg and Kurshan, 1992), (Manna and Pnueli, 1992), (Manna and Pnueli, 1993), (Sernadas, Sernadas and Costa, 1995), (Sernadas, Sernadas and Ramos, 1996) and in monitoring (Hulsmann and Saake, 1991), (=-=Kung, 1984-=-), (Lipeck and Saake, 1987), (Schwiderski, Hartmann and Saake, 1994). The advantages are known to lie on the clear declarative formalization of the system at hand and on the use of temporal verificati... |

11 | Transitional Monitoring of Dynamic Integrity Constraints - Lipeck, Gertz, et al. - 1994 |

10 | A synthesis of two approaches for verifying finite state concurrent systems - Clarke, Grumberg, et al. - 1992 |

8 | Denotational semantics of object specification - Sernadas, Sernadas, et al. - 1998 |

7 | Now you may Compose Temporal Specifications - Barringer, Kuiper, et al. - 1984 |

5 | On the relationship between operational and denotational semantics of temporal logic specification of object behaviour - Caleiro - 1995 |

3 | Operational semantics of temporal object specifications - Caleiro - 1994 |

1 |
Executable modal and temporal logics - a survey
- Fisher, Owens
- 1995
(Show Context)
Citation Context ...fications can therefore be discussed in the context of possible strategies for implementing G-automata features. We therefore expect to give a contribution to the field of executable temporal logics (=-=Fisher and Owens, 1995-=-). Although the logic we present has some useful specific features such as a clear distinction between state variables, action occurrence and action enabling (Sernadas, Sernadas and Costa, 1995), our ... |

1 | Temporal logic as a programming language - Merz - 1992 |

1 |
On the extremely fair termination of probabilistic programs
- Pnueli
- 1983
(Show Context)
Citation Context ... and implementation of the strategy proposed and others are a further possible extension of the present work. An interesting line of reserach would be considering some kind of probabilistic automata (=-=Pnueli, 1983-=-), (Segala, 1995). By doing that we also make possible a probabilistic study of the correctness of implementation strategies and open the door to the use of probabilistic temporal logic (Hart and Shar... |

1 | Deriving Liveness Goals from Temporal Logic Specifications 33 - Schwiderski, Hartmann, et al. - 1994 |