Sciweavers

382 search results - page 23 / 77
» Checking Interval Based Properties for Reactive Systems
Sort
View
CONCUR
2004
Springer
14 years 2 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
NGITS
1999
Springer
14 years 27 days ago
From Object-Process Diagrams to a Natural Object-Process Language
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
Mor Peleg, Dov Dori
TMC
2010
103views more  TMC 2010»
13 years 3 months ago
Optimal Cooperative Relaying Schemes in IR-UWB Networks
Cooperation between wireless nodes to retransmit data for the other users introduces multiuser diversity to a wireless network and increases the system throughput. In this paper, t...
Ghasem Naddafzadeh Shirazi, Peng Yong Kong, Chen-K...
ICCD
1995
IEEE
109views Hardware» more  ICCD 1995»
14 years 5 days ago
Verifying the performance of the PCI local bus using symbolic techniques
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
Sérgio Vale Aguiar Campos, Edmund M. Clarke...
SIGSOFT
1996
ACM
14 years 23 days ago
Model Checking Large Software Specifications
In this paper we present our experiences in using symbolic model checking to analyze a specification of a software system for aircraft collision avoidance. Symbolic model checking ...
Richard J. Anderson, Paul Beame, Steve Burns, Will...