Sciweavers

5015 search results - page 400 / 1003
» Model Checking a Path
Sort
View
KBSE
2002
IEEE
15 years 11 months ago
What Makes Finite-State Models More (or Less) Testable?
Finite-state machine (FSM) models are commonly used to represent software with concurrent processes. Established model checking tools can be used to automatically test FSM models,...
David Owen, Tim Menzies, Bojan Cukic
FMCO
2008
Springer
167views Formal Methods» more  FMCO 2008»
15 years 8 months ago
Formal Behavioral Modeling and Compliance Analysis for Service-Oriented Systems
In this paper, we present a framework for formal modeling and verification of service-based business processes with focus on their compliance to external regulations such as Segreg...
Natallia Kokash, Farhad Arbab
SSIRI
2010
15 years 5 months ago
Modelling and Implementing Complex Systems with Timebands
—We describe how to use a timeband architecture to model real-time requirements. The architecture separates requirements that use different time units, producing a family of mode...
Jim Woodcock, Marcel Oliveira, Alan Burns, Kun Wei
IPL
2010
79views more  IPL 2010»
15 years 5 months ago
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
Christophe Crespelle, Philippe Gambette
ICPR
2008
IEEE
16 years 1 months ago
Constrained clustering by a novel graph-based distance transformation
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
Kai Rothaus, Xiaoyi Jiang