361 search results - page 55 / 73 » Parallel Model Checking for Temporal Epistemic Logic |
PADS
2009
ACM
14 years 4 months ago
2009
ACM
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...
CAV
2007
Springer
14 years 4 months ago
2007
Springer
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
PPDP
2005
Springer
14 years 3 months ago
2005
Springer
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
ENTCS
2007
13 years 10 months ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
COCOON
2003
Springer
14 years 3 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...