Sciweavers

333 search results - page 11 / 67
» On the complexity of partial order trace model checking
Sort
View
PTS
2007
99views Hardware» more  PTS 2007»
13 years 9 months ago
Testing Input/Output Partial Order Automata
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
Stefan Haar, Claude Jard, Guy-Vincent Jourdan
SPIN
2009
Springer
14 years 2 months ago
Tool Presentation: Teaching Concurrency and Model Checking
This paper describes a set of software tools developed for teaching concurrency and model checking. jSpin is an elementary development environment for Spin that formats and filter...
Mordechai Ben-Ari
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 7 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
DATE
2010
IEEE
149views Hardware» more  DATE 2010»
13 years 12 months ago
Efficient decision ordering techniques for SAT-based test generation
Model checking techniques are promising for automated generation of directed tests. However, due to the prohibitively large time and resource requirements, conventional model chec...
Mingsong Chen, Xiaoke Qin, Prabhat Mishra
ECMDAFA
2007
Springer
100views Hardware» more  ECMDAFA 2007»
14 years 1 months ago
Reverse Engineering Models from Traces to Validate Distributed Systems - An Industrial Case Study
The paper targets the applicability of model-driven methodologies to the validation of complex systems and presents a case study of a mobile radio network. Validation relies on the...
Andreas Ulrich, Alexandre Petrenko