Sciweavers

3047 search results - page 295 / 610
» A Temporal Consensus Model
Sort
View
FORMATS
2004
Springer
16 years 10 hour ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
HYBRID
2003
Springer
15 years 12 months ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas
HICSS
1999
IEEE
115views Biometrics» more  HICSS 1999»
15 years 11 months ago
GIS-based Dynamic Traffic Congestion Modeling to Support Time-Critical Logistics
Time-critical logistics (TCL) refer to time-sensitive procurement, processing and distribution activities. A confounding factor is the transportation networks that contain these l...
Harvey J. Miller, Yi-Hwa Wu, Ming-Chih Hung
ASP
2001
Springer
15 years 10 months ago
Effect of knowledge representation on model based planning: experiments using logic programming encodings
In this paper we implement planning using answer set programming. We consider the action language A and its extensions. We show that when the domain is described using richer feat...
Le-Chi Tuan, Chitta Baral
CONCUR
2000
Springer
15 years 10 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko