Sciweavers

499 search results - page 79 / 100
» LTL satisfiability checking
Sort
View
ENTCS
2002
91views more  ENTCS 2002»
14 years 9 months ago
Interval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
Paritosh K. Pandya
DLOG
2004
14 years 11 months ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
SCP
1998
112views more  SCP 1998»
14 years 9 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer
ICDE
2011
IEEE
235views Database» more  ICDE 2011»
14 years 1 months ago
Dealing proactively with data corruption: Challenges and opportunities
—The danger of production or backup data becoming corrupted is a problem that database administrators dread. This position paper aims to bring this problem to the attention of th...
Nedyalko Borisov, Shivnath Babu, NagaPramod Mandag...
FOSSACS
2001
Springer
15 years 2 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin