| U. Montanari, M. Pistore. Finite State Verification for the Asynchronous PiCalculus. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Lectures Notes in Computer Science. Springer Verlag, 1999. |
....striking fact that its very first aim is to demonstrate mobility, not dynamicity. Hence, a discrimination of either features deserves insight. 34 The concern of determining resource bounds for asynchronous process calculi (and more specifically the calculus) has been the subject of recent work [20], in which finite state systems can be isolated by program analysis. Such techniques could be adapted to Spots. We opine that an alternative approach deserves a proposal by observing that, in the design process of an embedded system, non functional space requirements are usually imposed before ....
U. Montanari, M. Pistore. Finite State Verification for the Asynchronous PiCalculus. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Lectures Notes in Computer Science. Springer Verlag, 1999.
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