Sciweavers

643 search results - page 53 / 129
» Parsing And Derivational Equivalence
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 7 months ago
Characterising Probabilistic Processes Logically
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
Yuxin Deng, Rob J. van Glabbeek
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 7 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak
ENTCS
2008
71views more  ENTCS 2008»
13 years 7 months ago
An Inverse Method for Parametric Timed Automata
Given a timed automaton with parametric timings, our objective is to describe a procedure for deriving constraints on the parametric timings in order to ensure that, for each valu...
Étienne André, Thomas Chatain, Laure...
IANDC
2008
116views more  IANDC 2008»
13 years 7 months ago
Deciding expressive description logics in the framework of resolution
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
ENTCS
2007
111views more  ENTCS 2007»
13 years 7 months ago
Compositional State Space Reduction Using Untangled Actions
We propose a compositional technique for efficient verification of networks of parallel processes. It is based on an automatic analysis of LTSs of individual processes (using a f...
Xu Wang, Marta Z. Kwiatkowska