Sciweavers

662 search results - page 4 / 133
» Model Checking Procedures for Infinite State Systems
Sort
View
FM
1994
Springer
113views Formal Methods» more  FM 1994»
15 years 1 months ago
Abstract Model Checking of Infinite Specifications
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
Daniel Jackson
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
14 years 11 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
RTCSA
1999
IEEE
15 years 1 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer
DSN
2004
IEEE
15 years 1 months ago
Model Checking Action- and State-Labelled Markov Chains
In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action- and state-l...
Christel Baier, Lucia Cloth, Boudewijn R. Haverkor...
ATVA
2005
Springer
108views Hardware» more  ATVA 2005»
15 years 2 months ago
Flat Acceleration in Symbolic Model Checking
Abstract. Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. So-called “acceleration techniques...
Sébastien Bardin, Alain Finkel, Jér&...