uppaal tiga
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 6
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
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
UPPAAL DBM Library 2.0.5
Difference Bound Matrices (DBMs) are efficient data structures to represent clock constraints in timed automata. more>>
Difference Bound Matrices (DBMs) are efficient data structures to represent clock constraints in timed automata.
They are used in UPPAAL as the core data structure to represent time. This library features all the common operations such as up (delay, or future), down (past), general updates, different extrapolation functions, etc. on DBMs and federations.
The library also supports subtractions and methods to merge DBMs.
Enhancements:
- Bugs have been fixed in getValuation and mergeReduce, and doxygen comments have been corrected.
- New methods have been added to the API: Hooks to mingraph_t, hasZero to test if DBMs (or federations) contain the zero point, delay for points, and toString.
- The structure partition_t has been drastically improved.
- The operations subtractions, intersections, and "mergeReduce" have been substantially improved.
- There is a new print format of DBMs and federations to be more compatible with the Ruby binding.
- index_t has been renamed to cindex_t due to a conflict on Solaris.
<<lessThey are used in UPPAAL as the core data structure to represent time. This library features all the common operations such as up (delay, or future), down (past), general updates, different extrapolation functions, etc. on DBMs and federations.
The library also supports subtractions and methods to merge DBMs.
Enhancements:
- Bugs have been fixed in getValuation and mergeReduce, and doxygen comments have been corrected.
- New methods have been added to the API: Hooks to mingraph_t, hasZero to test if DBMs (or federations) contain the zero point, delay for points, and toString.
- The structure partition_t has been drastically improved.
- The operations subtractions, intersections, and "mergeReduce" have been substantially improved.
- There is a new print format of DBMs and federations to be more compatible with the Ruby binding.
- index_t has been renamed to cindex_t due to a conflict on Solaris.
Download (MB)
Added: 2006-06-30 License: GPL (GNU General Public License) Price:
1217 downloads
Uppaal Timed Automata Parser Library 0.90
The UPPAAL Timed Automata Parser Library (libutap) is the parser library used by UPPAAL. more>>
Uppaal Timed Automata Parser Library (libutap) is the parser library used by UPPAAL.
<<less Download (0.41MB)
Added: 2006-04-30 License: LGPL (GNU Lesser General Public License) Price:
1274 downloads
Lingua::ID::Nums2Words 0.01
Lingua::ID::Nums2Words is a Perl module to convert number to Indonesian verbage. more>>
Lingua::ID::Nums2Words is a Perl module to convert number to Indonesian verbage.
SYNOPSIS
use Lingua::ID::Nums2Words ;
print nums2words(123) ; # "seratus dua puluh tiga"
print nums2words_simple(123) ; # "satu dua tiga"
nums2words currently can handle real numbers in normal and scientific form in the order of hundreds of trillions. It also preserves formatting in the number string (e.g, given "1.00" nums2words will pronounce the zeros).
<<lessSYNOPSIS
use Lingua::ID::Nums2Words ;
print nums2words(123) ; # "seratus dua puluh tiga"
print nums2words_simple(123) ; # "satu dua tiga"
nums2words currently can handle real numbers in normal and scientific form in the order of hundreds of trillions. It also preserves formatting in the number string (e.g, given "1.00" nums2words will pronounce the zeros).
Download (0.003MB)
Added: 2006-08-23 License: Perl Artistic License Price:
1157 downloads
Ruby-UDBM 0.7
Ruby-UDBM is a Ruby binding for the UPPAAL DBM library. more>>
The Ruby DBM library has now a binding to the popular Ruby language. The binding offers several modules as different layers on top of the DBM library, depending on what the user wants to do. The different modules are:
- udbm: This is the core binding that provides the classes Constraint to define constraints 3) or (a.x > 4) | (a.y > 5), compute intersections, relations, unions, whatever you can do on federations, but with sets instead. It is another view of federations.
Enhancements:
- The graphical viewer can now display points together with federations.
- This release has been rebuilt against the DBM library version 2.0.5.
<<less- udbm: This is the core binding that provides the classes Constraint to define constraints 3) or (a.x > 4) | (a.y > 5), compute intersections, relations, unions, whatever you can do on federations, but with sets instead. It is another view of federations.
Enhancements:
- The graphical viewer can now display points together with federations.
- This release has been rebuilt against the DBM library version 2.0.5.
Download (0.11MB)
Added: 2006-06-30 License: GPL (GNU General Public License) Price:
1211 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 uppaal tiga 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
