Sciweavers

1805 search results - page 178 / 361
» A Theory of Closure Operators
Sort
View
JLP
2006
126views more  JLP 2006»
15 years 6 months ago
Compositional modeling and refinement for hierarchical hybrid systems
In this paper, we develop a theory of modular design and refinement of hierarchical hybrid systems. In particular, we present compositional trace-based semantics for the language ...
Rajeev Alur, Radu Grosu, Insup Lee, Oleg Sokolsky
MSCS
1998
58views more  MSCS 1998»
15 years 6 months ago
Minimal Realization in Bicategories of Automata
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
Robert D. Rosebrugh, Nicoletta Sabadini, Robert F....
TRIER
2002
15 years 6 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl
SIMPRA
2008
137views more  SIMPRA 2008»
15 years 6 months ago
An admissible-behaviour-based analysis of the deadlock in Petri-net controllers
This paper addresses the problem of verifying the discrete control logic that is typically implemented by programmable controllers. Not only are the logical properties of the cont...
G. Music, Drago Matko
IJAR
2010
70views more  IJAR 2010»
15 years 5 months ago
Granular computing applied to ontologies
Granular Computing is an emerging conceptual and computing paradigm of information processing. A central notion is an information-processing pyramid with different levels of clari...
Silvia Calegari, Davide Ciucci