713 search results - page 102 / 143 » Model Checking and Transitive-Closure Logic |
81
Voted
CONCUR
2004
Springer
15 years 4 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
DAC
2003
ACM
15 years 4 months ago
2003
ACM
Coverage estimation for model checking quantifies the completeness of a set of properties. We present an improved version of the algorithm of Hoskote et al. [7] that applies to a...
99
Voted
COCOON
2003
Springer
15 years 4 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...
85
Voted
ECAI
2006
Springer
15 years 2 months ago
2006
Springer
An approach to handle the complex dynamics of a multi-agent system is based on distinguishing aggregation levels by structuring the system into parts or components. The behavior of...
BIRTHDAY
2008
Springer
15 years 26 days ago
2008
Springer
Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a...