Sciweavers

662 search results - page 63 / 133
» Model Checking Procedures for Infinite State Systems
Sort
View
VMCAI
2010
Springer
16 years 8 days ago
Best Probabilistic Transformers
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
Björn Wachter, Lijun Zhang
QEST
2005
IEEE
15 years 8 months ago
A Markov Reward Model Checker
This short tool paper introduces MRMC, a model checker for discrete-time and continuous-time Markov reward models. It supports reward extensions of PCTL and CSL, and allows for th...
Joost-Pieter Katoen, Maneesh Khattri, Ivan S. Zapr...
FATES
2004
Springer
15 years 6 months ago
Test Generation Based on Symbolic Specifications
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
Lars Frantzen, Jan Tretmans, Tim A. C. Willemse
VLDB
2002
ACM
110views Database» more  VLDB 2002»
15 years 2 months ago
Extending an ORDBMS: The StateMachine Module
Extensibility is one of the mayor benefits of object-relational database management systems. We have used this system property to implement a StateMachine Module inside an object-...
Wolfgang Mahnke, Christian Mathis, Hans-Peter Stei...
CAV
2006
Springer
129views Hardware» more  CAV 2006»
15 years 6 months ago
Languages of Nested Trees
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan