Sciweavers

575 search results - page 38 / 115
» Model Checking Restricted Sets of Timed Paths
Sort
View
CSR
2009
Springer
15 years 8 months ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...
CONCUR
2006
Springer
15 years 5 months ago
Modeling Timed Concurrent Systems
Timed concurrent systems are widely used in concurrent and distributed real-time software, modeling of hybrid systems, design of hardware systems (using hardware description langua...
Xiaojun Liu, Eleftherios Matsikoudis, Edward A. Le...
IPL
2007
125views more  IPL 2007»
15 years 1 months ago
State explosion in almost-sure probabilistic reachability
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
François Laroussinie, Jeremy Sproston
FUIN
2006
85views more  FUIN 2006»
15 years 1 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang
136
Voted
JOC
2007
84views more  JOC 2007»
15 years 1 months ago
Concurrent Composition of Secure Protocols in the Timing Model
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their inputs. In the stand-alone case, it ha...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...