Sciweavers

20126 search results - page 5 / 4026
» Timed Transition Systems
Sort
View
JLP
2008
98views more  JLP 2008»
13 years 9 months ago
Comparing disjunctive modal transition systems with an one-selecting variant
models, used for specification, analysis and verification, usually describe sets of implementations by means of a refinement relation. In the branching time setting, implementatio...
Harald Fecher, Heiko Schmidt
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 4 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert

Publication
412views
15 years 7 months ago
Analyzing Transit Service Reliability using Detailed Data From Automatic Vehicular Locator Systems
The widespread adoption of automated vehicle location systems (AVL) and automatic passenger counters (APC) in the transit industry has opened new venues in operations and system mo...
A. M. El-Geneidy, J. Horning, K. J. Krizek
BMCBI
2007
173views more  BMCBI 2007»
13 years 10 months ago
Predicting state transitions in the transcriptome and metabolome using a linear dynamical system model
Background: Modelling of time series data should not be an approximation of input data profiles, but rather be able to detect and evaluate dynamical changes in the time series dat...
Ryoko Morioka, Shigehiko Kanaya, Masami Y. Hirai, ...
JALC
2006
61views more  JALC 2006»
13 years 9 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
Mathieu Baudet