reachability
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 8
UPPAAL 4.0.6
UPPAAL is an integrated tool environment for modeling, validation and verification of real-time systems. more>>
UPPAAL is an integrated tool environment for modeling, validation and verification of real-time systems modeled as networks of timed automata, extended with data types (bounded integers, arrays, etc.).
UPPAAL CORA is a branch of UPPAAL for Cost Optimal Reachability Anslysis developed by the UPPAAL team as part of the VHS and AMETIST projects. Whereas UPPAAL supports model checking of timed automata, UPPAAL CORA uses an extension of timed automata called LPTA. LPTA allows you to annotate the model with the notion of cost.
This can be the cost of delay in certain situations or the cost of particular actions. UPPAAL CORA then finds optimal paths matching goal conditions.
UPPAAL CORA has been used in a number of case studies. Some of these are described on the case study page of this site. If you come up with interesting uses, please contact us. We are interested in hearing what you do!
Due to different internal data structures, UPPAAL CORA currently consists of two different versions:
A version for the simplified case of time optimal reachability analysis.
A version for the full language of LPTA.
Like UPPAAL, UPPAAL CORA is free for non-profit use, e.g. for evaluation, research, and teaching purposes.
Main features:
Robust
- The modeling language of UPPAAL CORA is robust towards changes in the problem modeled. This means that your investment in modeling is not lost when the problem changes, since it is easy to adapt the existing model.
Fast
- Although the technology is rather new, experimental and very different from techniques used in traditional operational research, UPPAAL CORA is competitive in a number of case studies.
Compatible
- The language of UPPAAL CORA is a superset of UPPAAL. Any valid UPPAAL model is also a valid UPPAAL CORA model. This makes it easy and convenient to reuse and adapt your existing models to UPPAAL CORA.
Current
- UPPAAL CORA is based on the latest internal development version of UPPAAL, containing the latest performance and language improvements. It is however an experimental tool and lacks many of the verification features of UPPAAL.
Version restrictions:
UPPAAL CORA with full LPTA support has a number of limitations. These limitations are not fundamental, but are a result of using new internal data structures with a currently limited feature set. Over time, these limitations will be resolved.
- No extrapolation, hence termination is not guaranteed unless you guarantee that either:
- The system is acyclic.
- All clocks are bounded by invariants.
- Simple reachability only:
- No liveness check
- No deadlock check
- Limited use of guiding:
- Support for (cost + remaining) sorting is implemented (best first search)
- Support for heuristic variable is implemented, but the expression cannot refer to the cost variable.
Enhancements:
- This release fixes crash bugs and a memory leak.
<<lessUPPAAL CORA is a branch of UPPAAL for Cost Optimal Reachability Anslysis developed by the UPPAAL team as part of the VHS and AMETIST projects. Whereas UPPAAL supports model checking of timed automata, UPPAAL CORA uses an extension of timed automata called LPTA. LPTA allows you to annotate the model with the notion of cost.
This can be the cost of delay in certain situations or the cost of particular actions. UPPAAL CORA then finds optimal paths matching goal conditions.
UPPAAL CORA has been used in a number of case studies. Some of these are described on the case study page of this site. If you come up with interesting uses, please contact us. We are interested in hearing what you do!
Due to different internal data structures, UPPAAL CORA currently consists of two different versions:
A version for the simplified case of time optimal reachability analysis.
A version for the full language of LPTA.
Like UPPAAL, UPPAAL CORA is free for non-profit use, e.g. for evaluation, research, and teaching purposes.
Main features:
Robust
- The modeling language of UPPAAL CORA is robust towards changes in the problem modeled. This means that your investment in modeling is not lost when the problem changes, since it is easy to adapt the existing model.
Fast
- Although the technology is rather new, experimental and very different from techniques used in traditional operational research, UPPAAL CORA is competitive in a number of case studies.
Compatible
- The language of UPPAAL CORA is a superset of UPPAAL. Any valid UPPAAL model is also a valid UPPAAL CORA model. This makes it easy and convenient to reuse and adapt your existing models to UPPAAL CORA.
Current
- UPPAAL CORA is based on the latest internal development version of UPPAAL, containing the latest performance and language improvements. It is however an experimental tool and lacks many of the verification features of UPPAAL.
Version restrictions:
UPPAAL CORA with full LPTA support has a number of limitations. These limitations are not fundamental, but are a result of using new internal data structures with a currently limited feature set. Over time, these limitations will be resolved.
- No extrapolation, hence termination is not guaranteed unless you guarantee that either:
- The system is acyclic.
- All clocks are bounded by invariants.
- Simple reachability only:
- No liveness check
- No deadlock check
- Limited use of guiding:
- Support for (cost + remaining) sorting is implemented (best first search)
- Support for heuristic variable is implemented, but the expression cannot refer to the cost variable.
Enhancements:
- This release fixes crash bugs and a memory leak.
Download (MB)
Added: 2007-03-09 License: Free for non-commercial use Price:
966 downloads
Ruby-BDD 0.2
Ruby-BDD is a BDD Binding for Ruby. more>>
Ruby-BDD is a BDD Binding for Ruby.
BDDs [bry86,and97] (or more precisely ROBDDs) are efficient data structures for representing boolean formula. They are widely used in formal verification, in particular symbolic model-checking. The idea of symbolic model-checking is to represent sets of states transition relations as formula (and to compute the fix-point of the set of all reachable states for reachability analysis).
Buddy is a BDD library written in C with an API both in C and C++. It is developer friendly with a simple interface. It supports all standard BDD operations, variable ordering, printing, has automated garbage collection, and is compilable on Unix and Windows platforms.
Ruby, despite being a scripting language, is a powerful and clean object-oriented language that is very easy to learn and use. In particular it is well-suited for quick prototyping and education purposes. Ruby-BDD is a binding for Ruby based on Buddy that provides BDD classes to create and manipulate BDDs in Ruby.
Enhancements:
- This release adds support for bit vectors and finite domains.
- Most of the Buddy library is now available through a Ruby style API.
<<lessBDDs [bry86,and97] (or more precisely ROBDDs) are efficient data structures for representing boolean formula. They are widely used in formal verification, in particular symbolic model-checking. The idea of symbolic model-checking is to represent sets of states transition relations as formula (and to compute the fix-point of the set of all reachable states for reachability analysis).
Buddy is a BDD library written in C with an API both in C and C++. It is developer friendly with a simple interface. It supports all standard BDD operations, variable ordering, printing, has automated garbage collection, and is compilable on Unix and Windows platforms.
Ruby, despite being a scripting language, is a powerful and clean object-oriented language that is very easy to learn and use. In particular it is well-suited for quick prototyping and education purposes. Ruby-BDD is a binding for Ruby based on Buddy that provides BDD classes to create and manipulate BDDs in Ruby.
Enhancements:
- This release adds support for bit vectors and finite domains.
- Most of the Buddy library is now available through a Ruby style API.
Download (0.037MB)
Added: 2006-08-09 License: GPL (GNU General Public License) Price:
1172 downloads
UPPAAL TIGA 4.1.0-0.9
UPPAAL TIGA is an extension of UPPAAL [BDL04] and it implements the first efficient on-the-fly algorithm for solving games. more>>
UPPAAL TIGA is an extension of UPPAAL [BDL04] and it implements the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties.
Though timed games for long have been known to be decidable there has until now been a lack of efficient and truly on-the-fly algorithms for their analysis.
UPPAAL TIGA provides a user-friendly graphical interface with its corresponding server, and a command line verifier.
The algorithm we propose [CDFLL05] is a symbolic extension of the on-the-fly algorithm suggested by Liu & Smolka [LS98] for linear-time model-checking of finite-state systems. Being on-the-fly, the symbolic algorithm may terminate long before having explored the entire state-space.
Also the individual steps of the algorithm are carried out efficiently by the use of so-called zones as the underlying data structure. Our tool implements various optimizations of the basic symbolic algorithm, as well as methods for obtaining time-optimal winning strategies (for reachability games).
Enhancements:
- This version fixes two major bugs: Wrong answers (and strategies) were given for some cases involving delays, and the simulator didnt handle urgent and committed states properly.
<<lessThough timed games for long have been known to be decidable there has until now been a lack of efficient and truly on-the-fly algorithms for their analysis.
UPPAAL TIGA provides a user-friendly graphical interface with its corresponding server, and a command line verifier.
The algorithm we propose [CDFLL05] is a symbolic extension of the on-the-fly algorithm suggested by Liu & Smolka [LS98] for linear-time model-checking of finite-state systems. Being on-the-fly, the symbolic algorithm may terminate long before having explored the entire state-space.
Also the individual steps of the algorithm are carried out efficiently by the use of so-called zones as the underlying data structure. Our tool implements various optimizations of the basic symbolic algorithm, as well as methods for obtaining time-optimal winning strategies (for reachability games).
Enhancements:
- This version fixes two major bugs: Wrong answers (and strategies) were given for some cases involving delays, and the simulator didnt handle urgent and committed states properly.
Download (MB)
Added: 2006-11-22 License: Other/Proprietary License Price:
1068 downloads
BSNMP ping 0.1
BSNMP ping is a module for bsnmpd which allows you to measure latency and reachability. more>>
BSNMP ping is a module for bsnmpd which allows you to measure latency and reachability. It sends out ICMP packets to the configured hosts.
A history of received packets is maintained, and you can query via SNMP how many dropped packets, maximum/minumum latency and other stats for that history period.
As bsnmpd only runs on BSDs (seems that way), this will also be the case for bsnmp-ping.
EXAMPLES
The following example pings two hosts. The first gets pinged once per second, and keeps a history for 300 seconds. The second is pinged 5 times per second, and the history is kept for 30 seconds.
The following would be added to /etc/snmpd.config:
begemotSnmpdModulePath."ping" = "/usr/local/lib/snmp_ping.so"
%ping
pingHost.1 = "10.8.9.2"
pingInterval.1 = 100
pingHistory.1 = 300
pingHost.2 = "2.2.2.2"
pingInterval.1 = 20
pingHistory.1 = 150
<<lessA history of received packets is maintained, and you can query via SNMP how many dropped packets, maximum/minumum latency and other stats for that history period.
As bsnmpd only runs on BSDs (seems that way), this will also be the case for bsnmp-ping.
EXAMPLES
The following example pings two hosts. The first gets pinged once per second, and keeps a history for 300 seconds. The second is pinged 5 times per second, and the history is kept for 30 seconds.
The following would be added to /etc/snmpd.config:
begemotSnmpdModulePath."ping" = "/usr/local/lib/snmp_ping.so"
%ping
pingHost.1 = "10.8.9.2"
pingInterval.1 = 100
pingHistory.1 = 300
pingHost.2 = "2.2.2.2"
pingInterval.1 = 20
pingHistory.1 = 150
Download (0.30MB)
Added: 2006-04-10 License: BSD License Price:
1296 downloads
mrtg-misc-probe 0.3.0
mrtg-misc-probe probes different system features for mrtg to graph. more>>
mrtg-misc-probe probes different system features for mrtg to graph.
Currently it can probe:
- percent usage of disk space and inodes for UFS filesystems
- percent usage of disk space for VxFS filesystems
- incoming and outgoing mail messages on sendmail mail server
- total size of mail messages sendt and received on sendmail mail server
- network delay using NTP peers/servers
- number of ClearCase vobs and views
- number of available and used ClearCase and MultiSite licenses
- number of active and disconnected sessions of a Citrix Metaframe server
- number of reachable hosts in a given network range
- network device reachability (ping success)
Enhancements:
- New probes: ctxmf - number of active and disconnected Citrix Metaframe sessions; hostcount - scan given nmap-network-range and return number of hosts found.
<<lessCurrently it can probe:
- percent usage of disk space and inodes for UFS filesystems
- percent usage of disk space for VxFS filesystems
- incoming and outgoing mail messages on sendmail mail server
- total size of mail messages sendt and received on sendmail mail server
- network delay using NTP peers/servers
- number of ClearCase vobs and views
- number of available and used ClearCase and MultiSite licenses
- number of active and disconnected sessions of a Citrix Metaframe server
- number of reachable hosts in a given network range
- network device reachability (ping success)
Enhancements:
- New probes: ctxmf - number of active and disconnected Citrix Metaframe sessions; hostcount - scan given nmap-network-range and return number of hosts found.
Download (0.017MB)
Added: 2007-07-12 License: GPL (GNU General Public License) Price:
836 downloads
Flash Operator Panel 0.26
Flash Operator Panel is a switchboard type application for the Asterisk PBX. more>>
Flash Operator Panel is a switchboard type application for the Asterisk PBX. It runs on a web browser with the flash plugin.
It is able to display information about your PBX activity in real time. The layout is configurable (button sizes and colors, icons, etc). You can have more than 100 buttons active per screen. On the Live Demo there are 28 buttons defined.
It also supports contexts: you can have one server running and many different client displays (for hosted PBX, different departments, etc). It can integrate with CRM software, by poping up a web page (and passing the CLID) when a specified button is ringing.
You can see at a glance:
- What extensions are busy, ringing or available
- Who is talking and to whom (clid, context, priority)
- SIP and IAX registration status and reachability
- Meetme room status (number of participants)
- Queue status (number of users waiting)
- Message Waiting Indicator and count
- Parked channels
- Logged in Agents
You can perform these actions:
- Hang-up a channel
- Transfer a call leg via drag&drop
- Originate calls via drag&drop
- Barge in on a call using drag&drop
- Set the caller id when transferring or originating a call
- Automatically pop up web page with customer details
- Click-to-Dial from a web page
- Mute/Unmute meetme participants
- It has two parts: a server writen in PERL, and the flash client. It was tested and its known to work under Windows, Mac and Linux browsers.
<<lessIt is able to display information about your PBX activity in real time. The layout is configurable (button sizes and colors, icons, etc). You can have more than 100 buttons active per screen. On the Live Demo there are 28 buttons defined.
It also supports contexts: you can have one server running and many different client displays (for hosted PBX, different departments, etc). It can integrate with CRM software, by poping up a web page (and passing the CLID) when a specified button is ringing.
You can see at a glance:
- What extensions are busy, ringing or available
- Who is talking and to whom (clid, context, priority)
- SIP and IAX registration status and reachability
- Meetme room status (number of participants)
- Queue status (number of users waiting)
- Message Waiting Indicator and count
- Parked channels
- Logged in Agents
You can perform these actions:
- Hang-up a channel
- Transfer a call leg via drag&drop
- Originate calls via drag&drop
- Barge in on a call using drag&drop
- Set the caller id when transferring or originating a call
- Automatically pop up web page with customer details
- Click-to-Dial from a web page
- Mute/Unmute meetme participants
- It has two parts: a server writen in PERL, and the flash client. It was tested and its known to work under Windows, Mac and Linux browsers.
Download (0.23MB)
Added: 2006-05-10 License: GPL (GNU General Public License) Price:
727 downloads
JPOX 1.1.8 / 1.2.0 Beta 3
JPOX is a free and fully compliant implementation of the JDO 1.0 and 2.0 specifications. more>>
JPOX is a free and fully compliant implementation of the JDO 1.0 and 2.0 specifications, providing transparent persistence of Java objects.
JPOX supports persistence to all of the major RDBMS on the market today, supporting all of the main Object-Relational Mapping (ORM) patterns demanded by todays applications, allows querying using either JDOQL or SQL, and comes with its own byte-code enhancer.
JPOX is available under an Open Source Apache 2 license, allowing access to not just a top quality Java persistence implementation but also to the source code, allowing you to contribute to the success story of the principal Open Source JDO implementation in the world today.
JPOX 1.0 implements the JDO 1 specification and passes the JDO 1 TCK. JPOX 1.1 (currently under development) extends the JPOX 1.0 capabilities to implement the JDO 2 specification.
JPOX 1.1 will become the JDO 2 Reference Implementation with its 1.1-final release. JPOX will be updated in future to also implement any EJB3 specification of Java persistence.
Whats New in 1.1.8 Stable Release:
- A bug has been fixed for attaching a CompoundIdentity 1-N relation.
- A bug has been fixed in the deletion of an embedded Collection.
- Improvements were made to the available SQL types for a datastore.
- Handling was added for read-only datastores and the action to perform if an update was attempted.
- Support was added for collections of interfaces where there is more than 1 implementation and discriminators are used.
- This is likely to be the final release in the 1.1 series.
Whats New in 1.2.0 Beta 3 Development Release:
- Full support was added for "ordered" Lists (JPA1).
- Support for many JPQL functions was added.
- Support for sequences was added in HSQLDB.
- More complete support was added for named sequences (JDO2).
- Full support for JPA1 lifecycle events was added.
- Support for JDO 2.1 XSDs was added.
- Support for optimistic transactions was rewritten, giving full support for all common scenarios.
- Support for mapping Strings to BLOB in Oracle was added.
- Support for cascade-persist=false (JPA1) was improved.
- Persistence-by-reachability was upgraded to handle the majority of cases at runtime rather than in metadata.
- Several bugs were fixed.
<<lessJPOX supports persistence to all of the major RDBMS on the market today, supporting all of the main Object-Relational Mapping (ORM) patterns demanded by todays applications, allows querying using either JDOQL or SQL, and comes with its own byte-code enhancer.
JPOX is available under an Open Source Apache 2 license, allowing access to not just a top quality Java persistence implementation but also to the source code, allowing you to contribute to the success story of the principal Open Source JDO implementation in the world today.
JPOX 1.0 implements the JDO 1 specification and passes the JDO 1 TCK. JPOX 1.1 (currently under development) extends the JPOX 1.0 capabilities to implement the JDO 2 specification.
JPOX 1.1 will become the JDO 2 Reference Implementation with its 1.1-final release. JPOX will be updated in future to also implement any EJB3 specification of Java persistence.
Whats New in 1.1.8 Stable Release:
- A bug has been fixed for attaching a CompoundIdentity 1-N relation.
- A bug has been fixed in the deletion of an embedded Collection.
- Improvements were made to the available SQL types for a datastore.
- Handling was added for read-only datastores and the action to perform if an update was attempted.
- Support was added for collections of interfaces where there is more than 1 implementation and discriminators are used.
- This is likely to be the final release in the 1.1 series.
Whats New in 1.2.0 Beta 3 Development Release:
- Full support was added for "ordered" Lists (JPA1).
- Support for many JPQL functions was added.
- Support for sequences was added in HSQLDB.
- More complete support was added for named sequences (JDO2).
- Full support for JPA1 lifecycle events was added.
- Support for JDO 2.1 XSDs was added.
- Support for optimistic transactions was rewritten, giving full support for all common scenarios.
- Support for mapping Strings to BLOB in Oracle was added.
- Support for cascade-persist=false (JPA1) was improved.
- Persistence-by-reachability was upgraded to handle the majority of cases at runtime rather than in metadata.
- Several bugs were fixed.
Download (1.6MB)
Added: 2007-07-05 License: The Apache License 2.0 Price:
844 downloads
wmap 0.01
wmap is a tool for creating log files about the reachability of wireless access points with signal strengh and GPS coordinates. more>>
wmap is a tool for creating log files about the reachability of wireless access points with signal strengh and GPS coordinates.
Options:
-i Interface Name - Network interface to use (i.e. wlan0 or eth0),
default is wlan0
-l logfile Name - Name of the data logfile, default is wmap.log
-d debug - For debugging / direct console output set this to
anything != NULL
-h IP - The ip is nesecary to run wmap. Normally this is the ip of
your AP or Router
<<lessOptions:
-i Interface Name - Network interface to use (i.e. wlan0 or eth0),
default is wlan0
-l logfile Name - Name of the data logfile, default is wmap.log
-d debug - For debugging / direct console output set this to
anything != NULL
-h IP - The ip is nesecary to run wmap. Normally this is the ip of
your AP or Router
Download (0.002MB)
Added: 2005-09-21 License: GPL (GNU General Public License) Price:
1499 downloads
Secleted [ 0 ] software to compare
- Page: 1 of 1
- 1
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above reachability search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed
