Sciweavers

361 search results - page 29 / 73
» Parallel Model Checking for Temporal Epistemic Logic
Sort
View
ICLP
1997
Springer
13 years 11 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
CONCUR
2011
Springer
12 years 7 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
14 years 23 days ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker
FM
2003
Springer
98views Formal Methods» more  FM 2003»
14 years 22 days ago
Generating Counterexamples for Multi-valued Model-Checking
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
Arie Gurfinkel, Marsha Chechik
LICS
1994
IEEE
13 years 11 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka