S. Aggarwal, R.P. Kurshan, and D. Sharma. A language for the specification and analysis of protocols. In IFIP Protocol Specification, Testing, and Verification III, pages 35--50, 1983. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Reachability Analysis of Hierarchical Reactive.. - Alur, Grosu, McDougall (2000) (1 citation) (Correct)
....as UML [BJR97] exhibit two kinds of modular structures, architectural and behavioral. Architectural modularity means that a system is composed of subsystems using the operations of parallel composition and hiding of variables. The input languages of standard model checkers (e.g. S R in Cospan [AKS83] or Reactive modules in Mocha [AH99] support architectural modularity, but provide no support for modular description of the behaviors of individual components. In this paper, we focus on exploiting the behavioral hierarchy for efficient model checking. The notion of behavioral hierarchy was ....
S. Aggarwal, R.P. Kurshan, and D. Sharma. A language for the specification and analysis of protocols. In IFIP Protocol Specification, Testing, and Verification III, pages 35--50, 1983.
Timing Verification by Successive Approximation - Yannakakis (1992) (37 citations) Self-citation (Kurshan) (Correct)
....systems, the correctness can be proved by abstracting real time as nondeterministic delay, retaining only the sequencing of state transitions. For such abstraction, automatic verification has a history spanning over ten years, and has been shown to be useful in verifying protocols and circuits [AKS83, CES86, BCDM86, McM93] However, for a large class of systems, correctness depends upon the actual magnitudes of various delays. Timing information can be incorporated in the models for delay insensitive systems in a straightforward way assuming a discrete model of time [AK83, EMSS90, AH89] A ....
....strategy is better in practice. 5 Implementation and examples We have implemented the proposed scheme in the verifier Cospan [HK90] Cospan is a tool for verifying logical properties of a system modeled as a collection of coordinating processes. The system is specified in a language called S R [AKS83] The syntax of S R allows one to specify the association between the state transitions of individual processes and the beginning and ending of various delay events. It was straightforward to write the code to extract from an S R program the sets Delta i of delays, and the maps b i , e i , ff, ....
S. Aggarwal, R.P. Kurshan, and D. Sharma. A language for the specification and analysis of protocols. In H. Rudin and C.H. West, editors, IFIP Protocol Specification, Testing, and Verification, volume III, pages 35--50, 1983.
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