Sciweavers

70 search results - page 4 / 14
» Reachability Analysis of Pushdown Automata: Application to M...
Sort
View
ESOP
2008
Springer
13 years 7 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
FORMATS
2003
Springer
13 years 11 months ago
Analysis of Real Time Operating System Based Applications
This text is dedicated to modelling of real-time applications running under multitasking operating system. Theoretical background is based on timed automata by Alur and Dill. As th...
Libor Waszniowski, Zdenek Hanzálek
WOLLIC
2009
Springer
14 years 19 days ago
Property Driven Three-Valued Model Checking on Hybrid Automata
Abstract. In this paper, we present a three-valued property driven model checking algorithm for the logic CTL on hybrid automata. The technique of multivalued model checking for hy...
Kerstin Bauer, Raffaella Gentilini, Klaus Schneide...
FUIN
2007
104views more  FUIN 2007»
13 years 6 months ago
SAT-Based Reachability Checking for Timed Automata with Discrete Data
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...
Andrzej Zbrzezny, Agata Pólrola
ICTAC
2005
Springer
13 years 11 months ago
Symbolic Model Checking of Finite Precision Timed Automata
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
Rongjie Yan, Guangyuan Li, Zhisong Tang