Sciweavers

2291 search results - page 274 / 459
» Logic Programming and Model Checking
Sort
View
115
Voted
CONCUR
2004
Springer
15 years 7 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
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 ...
Paolo Baldan, Andrea Corradini, Barbara König
DAC
2003
ACM
15 years 7 months ago
Dos and don'ts of CTL state coverage estimation
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...
Nikhil Jayakumar, Mitra Purandare, Fabio Somenzi
ECAI
2006
Springer
15 years 6 months ago
Verifying Interlevel Relations Within Multi-Agent Systems
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...
Alexei Sharpanskykh, Jan Treur
BIRTHDAY
2008
Springer
15 years 4 months ago
Some Results on the Expressive Power and Complexity of LSCs
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...
David Harel, Shahar Maoz, Itai Segall
SFP
2004
15 years 3 months ago
Disjoint forms in graphical user interfaces
Abstract: Forms are parts of a graphical user interface (GUI) that show a (structured) value and allow the user to update it. Some forms express a choice between two or more (struc...
Sander Evers, Peter Achten, Rinus Plasmeijer