A. Parashkevov and J. Yantchev, "Space Efficient Reachability Analysis Through Use of Pseudo-Root States," Proceedings of Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'97, Twente, The Netherlands, 1997. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Communication and Synchronization Using Bounded Channels in .. - Ashenden, Esser, Wilsey (1999) (2 citations) (Correct)
....However, it appears that this decision hasadverse consequences for formal verification of models. Themain problem is that the state space of a model that uses unbounded buffers is potentially infinite. An important class of formal verification techniques is based on state space exploration [10, 15, 17], including those embodied in automatic verification tools [9, 14, 16] verification using these tools is intractable when statespace explosion occurs. Hence it is desirable to allow specification of buffer bounds for channels so that formal verification techniques and tools can be brought to ....
A. Parashkevov and J. Yantchev, "Space Efficient Reachability Analysis Through Use of Pseudo-Root States," Proceedings of Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'97, Twente, The Netherlands, 1997.
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