Sciweavers

1147 search results - page 154 / 230
» Termination in language-based systems
Sort
View
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
14 years 2 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...
CIE
2008
Springer
14 years 1 months ago
Principal Typings for Explicit Substitutions Calculi
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
Daniel Lima Ventura, Mauricio Ayala-Rincón,...
AAAI
1997
14 years 15 days ago
Model Decomposition and Simulation: A Component Based Qualitative Simulation Algorithm
Traditionally, qualitative simulation uses a global, state-based representation to describe the behavior of the modeled system. For larger, more complex systems this representatio...
Daniel J. Clancy, Benjamin Kuipers
ECAI
2010
Springer
14 years 7 days ago
Constraint-Based Controller Synthesis in Non-Deterministic and Partially Observable Domains
Controller synthesis consists in automatically building controllers taking as inputs observation data and returning outputs guaranteeing that the controlled system satisfies some d...
Cédric Pralet, Gérard Verfaillie, Mi...
IEICET
2007
110views more  IEICET 2007»
13 years 11 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba