Quantitative Refinement for Weighted Modal Transition Systems

作者: Sebastian S. Bauer , Uli Fahrenberg , Line Juhl , Kim G. Larsen , Axel Legay

DOI: 10.1007/978-3-642-22993-0_9

关键词:

摘要: Specification theories as a tool in the development process of component-based software systems have recently attracted considerable attention. Current specification are however qualitative nature and hence fragile unsuited for modern systems. We propose first theory which allows to capture quantitative aspects during refinement implementation process.

参考文章(21)
Theoretical Aspects of Computing - ICTAC 2009 Lecture Notes in Computer Science. ,vol. 5684, ,(2009) , 10.1007/978-3-642-03466-4
Uri Zwick, Michael S Paterson, None, The Complexity of Mean Payoff Games computing and combinatorics conference. pp. 1- 10 ,(1995) , 10.1007/BFB0030814
N.A. Lynch, M.R. Tuttle, An introduction to input/output automata CWI quarterly. ,vol. 2, pp. 219- 246 ,(1989)
Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, Prudence W. H. Wong, Improved on-line broadcast scheduling with deadlines computing and combinatorics conference. pp. 320- 329 ,(2006) , 10.1007/11809678_34
Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang, Synchronous and Bidirectional Component Interfaces computer aided verification. pp. 414- 427 ,(2002) , 10.1007/3-540-45657-0_34
Nikola Beneš, Jan Křetínský, Kim G. Larsen, Jiří Srba, Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete international colloquium on theoretical aspects of computing. ,vol. 5684, pp. 112- 126 ,(2009) , 10.1007/978-3-642-03466-4_7
Luca Alfaro, Thomas A. Henzinger, INTERFACE-BASED DESIGN Springer, Dordrecht. pp. 83- 104 ,(2004) , 10.1007/1-4020-3532-2_3
Anne Condon, The complexity of stochastic games Information & Computation. ,vol. 96, pp. 203- 224 ,(1992) , 10.1016/0890-5401(92)90048-K