361 search results - page 12 / 73 » Parallel Model Checking for Temporal Epistemic Logic |
CAV
1998
Springer
13 years 11 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
SLP
1997
13 years 8 months ago
1997
ASE
2004
13 years 7 months ago
2004
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...
CONCUR
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
ICALP
2004
Springer
14 years 25 days ago
2004
Springer
In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorith...