A. Kerbrat. Reachable state space analysis of LOTOS specifications. In Proceedings of the 7th international conference on formal description techniques, pages 161--176, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Symbolic Verification with Gap-Order Constraints - Fribourg, Richardson (1996) (5 citations) (Correct)
....of logic programming techniques. 0 This work was performed while the second author was a visiting research fellow at the Ecole Normale Sup erieure, funded by EC HCM grants Compulog ERBCHBGCT 930365 and Logic Program Synthesis and Transformation CHRX.CT.93 0414. Existing methods (e.g. [6, 9]) make use of an approximation operation called widening. One of the drawbacks of widening is that it decreases the accuracy of the resulting invariant. Our new method reduces the need for widening by exploiting two techniques for calculating precise fixed points. As in [6] the automaton is ....
....and replaced by meta transitions (thick lines) 4 Example: A Read Write File System In this section we outline the analysis of an automaton describing a set of readers and writers. The behaviour to be verified is that no reads can take place when the system is writing. The example is presented in [9] as a LOTOS specification in three parts: the reader, the writer, and the control process. A system with r max readers and dmax writers is formed by synchronising the readers and the writers with the control process, which can then be seen as a single automaton. Unless the number of readers and ....
[Article contains additional citation context not shown here]
A. Kerbrat. Reachable state space analysis of LOTOS specifications. In Proceedings of the 7th international conference on formal description techniques, pages 161--176, 1994.
Symbolic Verification with Gap-Order Constraints - Fribourg, Richardson (1996) (5 citations) (Correct)
....to specify the initial inputs to the automaton, but can leave them as uninstantiated parameters, or partially specify them using gap order constraints. 1 Introduction In this paper we present a new method for determining state invariants for finite state automata with counters. Existing methods [Hal93, Ker94b] make use of an approximation operation called widening. One of the drawbacks of widening is that it decreases the accuracy of the resulting invariant. Our new method reduces the need for widening by exploiting two techniques for calculating precise fixed points. As in [Hal93] the automaton is ....
....the invariant at s to the other states. 4 Example: a read write file system In this section we outline the analysis of an automaton describing a set of readers and writers. The behaviour to be verified is that no reads can take place when the system is writing. The example is presented in [Ker94b] as a LOTOS specification in three parts: the reader, the writer, and the control process. A system with r max readers and d max writers is formed by synchronising the readers and the writers with the control process, which can then be seen as a single automaton. Unless 2 These differ from the ....
[Article contains additional citation context not shown here]
A. Kerbrat. Reachable state space analysis of LOTOS specifications. In Proceedings of the 7th international conference on formal description techniques, pages 161--176, 1994.
Symbolic Verification with Gap-Order Constraints - Fribourg, Richardson (1996) (5 citations) (Correct)
....the initial inputs to the automaton, but can leave them as uninstantiated parameters, or partially specify them using gap order constraints. 1 Introduction In this paper we present a new method for determining state invariants for finite state automata with counters. Existing methods (e.g. [5, 7]) make use of an approximation operation called widening. One of the drawbacks of widening is that it decreases the accuracy of the resulting invariant. Our new method reduces the need for widening by exploiting two techniques for calculating precise fixed points. As in [5] the automaton is ....
....describing a set of readers and writers. The behaviour to be verified is that no reads can take place when the system is writing. 2 These differ from the meta transitions derived for the simple circuits in that they are fixed points, such that = The example is presented in [7] as a LOTOS specification in three parts: the reader, the writer, and the control process. A system with r max readers and dmax writers is formed by synchronising the readers and the writers with the control process, which can then be seen as a single automaton. Unless the number of readers and ....
[Article contains additional citation context not shown here]
A. Kerbrat. Reachable state space analysis of LOTOS specifications. In Proceedings of the 7th international conference on formal description techniques, pages 161--176, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC