Sciweavers

501 search results - page 28 / 101
» Using Abstraction to Verify Arbitrary Temporal Properties
Sort
View
LOPSTR
2009
Springer
15 years 4 months 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...
ENTCS
2008
110views more  ENTCS 2008»
14 years 9 months ago
Game-Based Probabilistic Predicate Abstraction in PRISM
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norm...
92
Voted
NIPS
2007
14 years 11 months ago
Contraction Properties of VLSI Cooperative Competitive Neural Networks of Spiking Neurons
A non–linear dynamic system is called contracting if initial conditions are forgotten exponentially fast, so that all trajectories converge to a single trajectory. We use contra...
Emre Neftci, Elisabetta Chicca, Giacomo Indiveri, ...
ACSD
2010
IEEE
222views Hardware» more  ACSD 2010»
14 years 7 months ago
Efficient Model Checking of PSL Safety Properties
Abstract--Safety properties are an important class of properties as in the industrial use of model checking a large majority of the properties to be checked are safety properties. ...
Tuomas Launiainen, Keijo Heljanko, Tommi A. Juntti...
FUIN
2007
116views more  FUIN 2007»
14 years 9 months ago
Path Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Agata Janowska, Wojciech Penczek