Sciweavers

96 search results - page 14 / 20
» Reasoning About Systems with Transition Fairness
Sort
View
ENTCS
2007
104views more  ENTCS 2007»
13 years 7 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...
ICSE
2007
IEEE-ACM
14 years 7 months ago
Behaviour Model Synthesis from Properties and Scenarios
Synthesis of behaviour models from software development artifacts such as scenario-based descriptions or requirements specifications not only helps significantly reduce the effort...
Greg Brunet, Marsha Chechik, Sebastián Uchi...
FM
2006
Springer
121views Formal Methods» more  FM 2006»
13 years 11 months ago
Properties of Behavioural Model Merging
Constructing comprehensive operational models of intended system behaviour is a complex and costly task. Consequently, practitioners adopt techniques that support partial behaviour...
Greg Brunet, Marsha Chechik, Sebastián Uchi...
ICSE
2003
IEEE-ACM
14 years 7 months ago
Cadena: An Integrated Development, Analysis, and Verification Environment for Component-based Systems
The use of component models such as Enterprise Java Beans and the CORBA Component Model (CCM) in application development is expanding rapidly. Even in real-time safety/mission-cri...
John Hatcliff, Xianghua Deng, Matthew B. Dwyer, Ge...
CAV
2004
Springer
130views Hardware» more  CAV 2004»
13 years 11 months ago
Global Model-Checking of Infinite-State Systems
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
Nir Piterman, Moshe Y. Vardi