156 search results - page 20 / 32 » Decidability and Undecidability in Probability Logic |
LICS
2003
IEEE
14 years 1 months ago
2003
IEEE
Given a regular collection of Mazurkiewicz traces, which can be seen as the behaviours of a finite-state concurrent system, one can associate with it a canonical regular event st...
CSL
2009
Springer
14 years 3 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
CSL
2006
Springer
14 years 8 days ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
CONCUR
2009
Springer
14 years 15 days ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
ENTCS
2007
13 years 8 months ago
2007
Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications, they are perhaps best known as the basis for ...