Sciweavers

665 search results - page 68 / 133
» The Theory of Hybrid Automata
Sort
View
ICFEM
2009
Springer
13 years 5 months ago
A Compositional Approach on Modal Specifications for Timed Systems
Abstract. On the one hand, modal specifications are classic, convenient, and expressive mathematical objects to represent interfaces of component-based systems. On the other hand, ...
Nathalie Bertrand, Axel Legay, Sophie Pinchinat, J...
TCS
2010
13 years 2 months ago
Factorization forests for infinite words and applications to countable scattered linear orderings
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
Thomas Colcombet
VMCAI
2012
Springer
12 years 3 months ago
A General Framework for Probabilistic Characterizing Formulae
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
Joshua Sack, Lijun Zhang
ENTCS
2007
95views more  ENTCS 2007»
13 years 7 months ago
Hybridizing a Logical Framework
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
Jason Reed
TACAS
2009
Springer
109views Algorithms» more  TACAS 2009»
14 years 2 months ago
TaPAS: The Talence Presburger Arithmetic Suite
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
Jérôme Leroux, Gérald Point