Sciweavers

2465 search results - page 139 / 493
» Automata on Linear Orderings
Sort
View
LPNMR
2001
Springer
14 years 1 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
FOSSACS
2006
Springer
14 years 27 days ago
Smooth Orchestrators
A smooth orchestrator is a process with several alternative branches, every one defining synchronizations among co-located channels. Smooth orchestrators constitute a basic mechani...
Cosimo Laneve, Luca Padovani
ENTCS
2006
273views more  ENTCS 2006»
13 years 9 months ago
Operator Algebras and the Operational Semantics of Probabilistic Languages
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Alessandra Di Pierro, Herbert Wiklicky
IEEECIT
2010
IEEE
13 years 7 months ago
Predicting Events for the Simulation of Hybrid Systems
The quality of the numeric simulation of hybrid systems highly depends on the capability of the simulator to detect discrete events during continuous evolutions. Due to the intera...
Kerstin Bauer, Klaus Schneider
FSTTCS
2010
Springer
13 years 7 months ago
Two Size Measures for Timed Languages
Quantitative properties of timed regular languages, such as information content (growth rate, entropy) are explored. The approach suggested by the same authors is extended to lang...
Eugene Asarin, Aldric Degorre