Sciweavers

2035 search results - page 208 / 407
» On the complexity of stratified logics
Sort
View
FMICS
2007
Springer
16 years 20 days ago
An Action/State-Based Model-Checking Approach for the Analysis of Communication Protocols for Service-Oriented Applications
Abstract. In this paper we present an action/state-based logical framework for the analysis and verification of complex systems, which relies on the definition of doubly labelled...
Maurice H. ter Beek, Alessandro Fantechi, Stefania...
SPIN
2007
Springer
16 years 19 days ago
Towards Model Checking Spatial Properties with SPIN
Abstract. We present an approach for the verication of spatial properties with Spin. We rst extend one of Spin's main property specication mechanisms, i.e., the linear-time...
Alberto Lluch-Lafuente
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
16 years 19 days ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
WWW
2006
ACM
16 years 14 days ago
ASDL: a wide spectrum language for designing web services
A Service oriented system emerges from composition of services. Dynamically composed reactive Web services form a special class of service oriented system, where the delays associ...
Monika Solanki, Antonio Cau, Hussein Zedan
DALT
2005
Springer
16 years 1 days ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki