L.M. Kristensen and T. Mailund. A Compositional Sweep-line State Space Exploration Method. In Proceedings of FORTE'02, volume 2529 of Lecture Notes in Computer Science, pages 327--343. Springer-Verlag, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Checking Language Inclusion On-the-Fly with the.. - Gallasch.. (2005) Self-citation (Kristensen) (Correct)
No context found.
L.M. Kristensen and T. Mailund. A Compositional Sweep-line State Space Exploration Method. In Proceedings of FORTE'02, volume 2529 of Lecture Notes in Computer Science, pages 327--343. Springer-Verlag, 2002.
Path Finding with the Sweep-Line Method using External Storage - Kristensen, Mailund (2003) (4 citations) Self-citation (Kristensen Mailund) (Correct)
No context found.
L.M. Kristensen and T. Mailund. A Compositional Sweep-Line State Space Exploration Method. In Proc. of FORTE'02, volume 2529 of LNCS, pages 327-343. Springer-Verlag, 2002.
A Compositional Sweep-Line State Space Exploration Method - Kristensen, Mailund (2002) (3 citations) Self-citation (Kristensen Mailund) (Correct)
....(s 1 ) n (s n ) ut The fact that the product of progress measures can be used as a progress measure in conjunction with parallel composition is established by the following proposition. The proof of the proposition is rather straightforward and has been omitted here. It can be found in [8]. Proposition 1. Let L i for 1 i n be LTSs with progress measures P i = O i ; v i ; i ) respectively. The product P = O; v; of the P i s as de ned in Def. 4 is a progress measure on L = L 1 k kLn . If P i is a monotone progress measure on L i for 1 i n, then P is a monotone ....
....such that C m C. Similarly, we will say that s 2 C for some C 2 CL is minimal in C if there exists no s 2 C such that (s ) m (s) The correctness of the compositional sweep line algorithm in Fig. 5 follows from Thm. 2 below which uses the following proposition. Its proof can be found in [8]. Proposition 2. Let C 2 CL and let X CL be downwards closed. Then: 1. If C is minimal in over(X) then X [ fCg is downwards closed. 2. If s 2 C is minimal in out(X) then C is minimal in over(X) 3. If C is minimal in over(X) then in(C) out(X) ut Theorem 2. The sweep line algorithm in ....
L.M. Kristensen and T. Mailund. A Compositional Sweep-Line State Space Exploration Method. Technical report, Department of Computer Science, University of Aarhus, 2002. Available via: www.daimi.au.dk/~mailund/ps/lmktm_compo.ps.
Unknown - (Correct)
No context found.
L.M. Kristensen and T. Mailund. A Compositional Sweep-line State Space Exploration Method. In Proceedings of FORTE'02, volume 2529 of Lecture Notes in Computer Science, pages 327--343. Springer-Verlag, 2002.
Efficient Computer-Aided Verification of Parallel and Distributed .. - Mäkelä (2003) (Correct)
No context found.
Lars M. Kristensen and Thomas Mailund. A compositional sweepline state space exploration method. In Peled and Vardi [129], pages 327--343.
Efficient Computer-Aided Verification of Parallel and Distributed .. - Mäkelä (2003) (Correct)
No context found.
Lars M. Kristensen and Thomas Mailund. A compositional sweepline state space exploration method. In Peled and Vardi [129], pages 327--343.
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