Sciweavers

33 search results - page 6 / 7
» concur 2006
Sort
View
CONCUR
2006
Springer
13 years 9 months ago
Some Remarks on Definability of Process Graphs
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
CONCUR
2006
Springer
13 years 9 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
IJMSO
2010
118views more  IJMSO 2010»
13 years 3 months ago
Dependencies between ontology design parameters
: Development and use of ontologies is increasing, but hampered by new challenges, such as determining which ontologies to reuse and which language to use. Ontology development met...
C. Maria Keet
IJSYSC
2010
97views more  IJSYSC 2010»
13 years 3 months ago
A stability study on first-order neutral systems with three rationally independent time delays
— First order linear time invariant and time delayed dynamics of neutral type is taken into account with three rationally independent delays. There are two main contributions of ...
Rifat Sipahi, Nejat Olgaç, Dimitri Breda
CONCUR
2006
Springer
13 years 9 months ago
Sanity Checks in Formal Verification
One of the advantages of temporal-logic model-checking tools is their ability to accompany a negative answer to the correctness query by a counterexample to the satisfaction of the...
Orna Kupferman