J. J. M. M. Rutten. Automata and coinduction (an exercise in coalgebra). Lecture Notes in Computer Science, 1466:194--??, 1998. ISSN 0302-9743.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....used to nd a maximal congruence. This approach is based on partition re nement (e.g. PT87] in which all variables are initially assumed equal and are moved into separate partitions as inequalities are discovered. DFA minimization is the canonical example of bisimulation in coalgebra e.g. Rut98,Kur01] Clearly, the congruence found by the AWZ algorithm is a bisimulation, and has a coinductive de nition. 3 Combining Optimizations, Combining Theories In this section we draw connections between the problem of combining program improvements and the theorem proving literature on ....

J. J. M. M. Rutten. Automata and coinduction (an exercise in coalgebra). Lecture Notes in Computer Science, 1466:194{??, 1998.

....used to find a maximal congruence. This approach is based on partition refinement (e.g. PT87] in which all variables are initially assumed equal and are moved into separate partitions as inequalities are discovered. DFA minimization is the canonical example of bisimulation in coalgebra e.g. Rut98,Kur01] Clearly, the congruence found by the AWZ algorithm is a bisimulation, and has a coinductive definition. 3 Combining Optimizations, Combining Theories In this section we draw connections between the problem of combining program improvements and the theorem proving literature on ....

J. J. M. M. Rutten. Automata and coinduction (an exercise in coalgebra). Lecture Notes in Computer Science, 1466:194--??, 1998.

.... symbolic representation of the states space such as in [HNSY92] and in the use of Binary Decision Diagrams [BCM 90] by application of partial order methods [GW91, Val90] which suppresses unneccesarry interleavings of transitions, or by application of abstractions and symmetries [CFJ93, CGL92, EJ93] So far the most successful results for larger systems have been obtained using the heuristics of Binary Decision Diagrams. However, recent work by Andersen [And95] introduces a new very promising heuristic model checking technique for finite state systems, for which experimental results on ....

E. A. Emerson and C. S. Jutla. Symmetry and Model Checking. Lecture Notes in Computer Science, 697, 1993.

....For CTL there is a straightforward linear time algorithm. As more complex temporal logics were used, more sophisticated algorithms were developed. One general approach is the use of automata. One can often reduce a model checking problem to a nonemptiness problem for a class of automata [12, 13, 15, 4]. In the case of modal mu calculus the rst algorithms appealed to approximants [14] For each subformula Z: there is the formula Z n where n is at most the size of the state space 5 . The question then is how many of these approximants need to be calculated, and to what extent (because ....

Emerson, E. (1985). Automata, tableaux, and temporal logics. Lecture Notes in Computer Science, 193, 79-87.

.... example of an NFA language, consider white mazes on a black background, with a red square a and a green square b: is there a path from a to b An NFA can non deterministically guess a path and con rm its existence, but for any DFA (or even DPDA) there is a maze it will get lost in and loop forever [8] (this is an open question if the DFA can move through walls) The keep your hand on the right hand wall method, for instance, will fail if the maze has a loop with a outside and b inside [21] We will use this as a canonical NFA problem to discuss the computational complexity of NFA languages ....

W. Coy, \Automata in Labyrinths." Lecture Notes in Computer Science 56 65-71. Springer-Verlag, 1977.

....1, 1, which we know from the previous example is the Fibonacci string. For when q = 2 1 5 = 0, 1, 1, 1, the recursion turns out to be X 0 = 0 F = a, X 1 = 1 F =b, X 2 = 2 F =ba, Xi= i F =X i 1 X i 2 the negative image of the Fibonacci recursion as to be expected. Rauzy [Ra84] presented the below method, which brought more insight from the combinatorial point of view, to generate the Sturmian strings ( and only Sturmian strings ) which essentially is the same method as the above iteration since the set of A n and B n terms generated with it coincide with the set of ....

Rauzy G., ( 1984 ), Automata on Infinite Words, Mots Infinis en Arithmtique ( Editors: Nivat, M. & Perrin, D. ), Lecture Notes in Computer Science, Vol.192, pp.165171

.... space exploration, either by symbolic representation of the states space such as in [13] and in the use of Binary Decision Diagrams [8] by application of partial order methods [12, 23] which suppresses unnecesarry interleavings of transitions, or by application of abstractions and symmetries [9, 10, 11]. So far the most successful results for larger systems have been obtained using the heuristics of Binary Decision Diagrams. However, recent work by Andersen [4] introduces a new very promising heuristic model checking technique for finite state systems, for which experimental results on specific ....

E. A. Emerson and C. S. Jutla. Symmetry and Model Checking. Lecture Notes in Computer Science, 697, 1993.

....For CTL there is a straightforward polynomial time algorithm. As more complex temporal logics were used, more sophisticated algorithms were developed. One general approach is the use of automata. One can often reduce a model checking problem to a nonemptiness problem for a class of automata [12, 13, 15, 4]. In the case of modal mu calculus the first algorithms appealed to approximants [14] For each subformula oeZ: Phi there is the formula oeZ n Phi where n is at most the size of the state space 5 . The question then is how many of these approximants need to be calculated, and to what extent ....

Emerson, E. (1985). Automata, tableaux, and temporal logics. Lecture Notes in Computer Science, 193, 79-87.

....For CTL there is a straightforward polynomial time algorithm. As more complex temporal logics were used, more sophisticated algorithms were developed. One general approach is the use of automata. One can often reduce a model checking problem to a nonemptiness problem for a class of automata [12, 13, 15, 3]. In the case of modal mu calculus the first algorithms appealed to approximants [14] For each subformula oeZ: Phi there is the formula oeZ n Phi where n is at most the size of the state space 3 . The question then is how many of these approximants need to be calculated, and to what extent ....

Emerson, E. (1985). Automata, tableaux, and temporal logics. Lecture Notes in Computer Science, 193, 79-87.

....Denmark. E mail: kgl iesd.auc.dk. Department of Computer Systems, Box 325, Uppsala University, S751 05, Uppsala, Sweden. E mail: fpaupet,yig docs.uu.se. partial order methods [2, 3] which suppresses unnecessary interleavings of transitions, or by application of abstractions and symmetries [4, 5, 6]. In the last few years, model checking has been extended to real time systems, with time considered to be a dense linear order. A timed extension of finite automata through addition of a finite set of realvalued clock variables has been put forward [7] so called timed automata) and the ....

E. A. Emerson and C. S. Jutla. Symmetry and Model Checking. Lecture Notes in Computer Science, 697,

....transition graph M and some state s in M we have M; s j= f , in which case M is called a model for f . The decision problem of a temporal logic formula is to test whether or not the given formula is satis able. We have following results for the decision problems of CTL and CTL. Theorem 1 ([9, 5]) Given a CTL formula f , f is satis able if and only if it is satis able in a nite state transition graph with number of nodes at most double exponential in the length of the formula f . Theorem 2 ( 6] The decision problem of CTL (resp. CTL) is complete for deterministic double (resp. ....

E. A. Emerson. Automata, tableaux, and temporal logic. Proc. Conf. on Logics of Programs, Lecture Notes in Computer Science, R. Parikh, ed., vol. 193, pp 79-88, Springer, Berlin, 1985.

....algorithm of tableaux tailored specifically for the considered logic. It was first proposed by Emerson and Halpern [4] in the early seventies. They studied extensively the Computation Tree Logic, CTL, and gave a tableaux algorithm of model checking for formulas of that logic. A bit later Emerson [3] gave an equivalent algorithm of model checking based on the theory of Buchi and Streett automata. Often propositional temporal logic are expressive enough. This gives a clue to (low level) decidability. 8 Conclusion and perspectives In the next part we will present the versions of tableaux ....

G.A.Emerson, Automata, tableaux, and temporal logics, w: Lecture Notes in Computer Science, vol. 183

.... that avoid exhaustive state space exploration, either by symbolic representation of the states space using Binary Decision Diagrams [5] by application of partial order methods [11, 21] which suppresses unnecessary interleavings of transitions, or by application of abstractions and symmetries [7, 8, 10]. In the last few years, model checking has been extended to real time systems, with time considered to be a dense linear order. A timed extension of finite automata through addition of a finite set of real valued clock variables has been put forward [3] so called timed automata) and the ....

E. A. Emerson and C. S. Jutla. Symmetry and Model Checking. Lecture Notes in Computer Science, 697, 1993. In Proceedings of CAV'93.

....Denmark. E mail: kgl iesd.auc.dk. z Department of Computer Systems, Box 325, Uppsala University, S751 05, Uppsala, Sweden. E mail: fpaupet,yig docs.uu.se. partial order methods [2, 3] which suppresses unnecessary interleavings of transitions, or by application of abstractions and symmetries [4, 5, 6]. In the last few years, model checking has been extended to real time systems, with time considered to be a dense linear order. A timed extension of finite automata through addition of a finite set of realvalued clock variables has been put forward [7] so called timed automata) and the ....

E. A. Emerson and C. S. Jutla. Symmetry and Model Checking. Lecture Notes in Computer Science, 697, 1993. In Proceedings of CAV'93.

No context found.

J. J. M. M. Rutten. Automata and coinduction (an exercise in coalgebra). Lecture Notes in Computer Science, 1466:194--??, 1998. ISSN 0302-9743.

No context found.

E. Allen Emerson and A. Prasad Sistla, Eds., Computer-Aided Verification, CAV '00, vol. 1855 of Lecture Notes in Computer Science, Chicago, IL, July 2000. Springer-Verlag.

No context found.

Automata, Languages and Programming #ICALP '91#, J. L. Albert, B. Monien, and M. R. Artalejo, eds., Vol. 510 of Lecture Notes in Computer Science, Madrid, July 1991, Springer-Verlag, pp. 217# 228.

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