Sciweavers

382 search results - page 26 / 77
» Checking Interval Based Properties for Reactive Systems
Sort
View
LOPSTR
2009
Springer
16 years 14 days ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
TACAS
2009
Springer
132views Algorithms» more  TACAS 2009»
16 years 21 days ago
Transition-Based Directed Model Checking
Abstract. Directed model checking is a well-established technique that is tailored to fast detection of system states that violate a given safety property. This is achieved by in...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...
POPL
2000
ACM
15 years 10 months ago
Enforcing Trace Properties by Program Transformation
We propose an automatic method to enforce trace properties on programs. The programmer specifies the property separately from the program; a program transformer takes the program...
Thomas Colcombet, Pascal Fradet
JLP
2010
105views more  JLP 2010»
15 years 21 days ago
Quantitative analysis of weighted transition systems
We present a general framework for the analysis of quantitative and qualitative properties of reactive systems, based on a notion of weighted transition systems. We introduce and ...
Claus R. Thrane, Uli Fahrenberg, Kim G. Larsen
ATAL
2005
Springer
15 years 11 months ago
Bounded model checking knowledge and branching time in synchronous multi-agent systems
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
Xiangyu Luo, Kaile Su, Abdul Sattar, Qingliang Che...