Logo

software

data structures and software dependability

computer science department

brandenburg university of technology cottbus - senftenberg

C H A R L I E

latest update: March 10, 2019, at 04:22 PM


Please use the following reference to give credits to Charlie:
M Heiner, M Schwarick and J Wegener:
Charlie – an extensible Petri net analysis tool;
In Proc. PETRI NETS 2015, Brussels, Springer, LNCS, volume 9115, pp. 200–211, June 2015 (e-link).


51.7678,14.3253,ff0000
BTU Cottbus
43.599770800027144,1.4332544509048166,18284e
(259) Toulouse; France
53.55335205292033,10.00236631999506,18284e
(214) Hamburg; Germany
51.765946415492465,14.332913943699428,18284e
(175) Cottbus; Germany
52.41669845581055,16.966699600219727,18284e
(150) Poznan; Poland
52.51666826815219,13.400167207460147,18284e
(148) Berlin; Germany
52.156958781889756,4.507335074626616,18284e
(137) Leiden; Netherlands
52.41749626047471,-1.547014659818481,18284e
(136) Coventry; United Kingdom
59.89440155029297,30.26420021057129,18284e
(133) Saint Petersburg; Russian Federation
33.696623274423544,73.07373528341645,18284e
(103) Islamabad; Pakistan
-8.050000190734863,-34.900001525878906,1e3262
(100) Recife; Brazil
52.16468215475277,11.6661830045739,1e3262
(98) Magdeburg; Germany
49.20000076293945,16.63330078125,1e3262
(77) Brno; Czech Republic
52.08496223061772,5.130325293136855,1e3262
(59) Utrecht; Netherlands
45.4385986328125,12.326600074768066,243c75
(49) Venezia; Italy
50.70000076293945,3.1666998863220215,243c75
(48) Roubaix; France
48.099998474121094,7.966700077056885,243c75
(36) Waldkirch; Germany
51.49957501888275,11.997943758964539,243c75
(32) Halle; Germany
34.26207363990046,108.93770008702433,243c75
(31) Xian; China
52.03329849243164,8.533300399780273,2a4689
(29) Bielefeld; Germany
51.50826973750674,-0.09867586246852217,2a4689
(29) London; United Kingdom
55.752201080322266,37.6156005859375,2a4689
(28) Moscow; Russian Federation
50.9313394165039,11.585431632995606,2a4689
(25) Jena; Germany
52.96670150756836,-1.166700005531311,2a4689
(25) Nottingham; United Kingdom
41.792198181152344,123.43298278808594,2a4689
(25) Shenyang; China
52.3525065612793,4.912487888336182,2a4689
(25) Amsterdam; Netherlands
51.30174719769022,12.33150399249533,30509c
(23) Leipzig; Germany
13.51669979095459,2.1166999340057373,30509c
(23) Niamey; Niger
39.92890167236328,116.38820336081766,30509c
(22) Beijing; China
30.582537605648948,114.26852235339936,30509c
(21) Wuhan; China
45.41669845581055,11.883299827575684,30509c
(21) Padova; Italy
30.00860023498535,31.212200164794922,365ab0
(20) Gîza; Egypt
-16.66670036315918,-49.266700744628906,365ab0
(20) Goiânia; Brazil
52.20000076293945,0.11670000106096268,365ab0
(19) Cambridge; United Kingdom
39.56449890136719,-75.59700012207031,365ab0
(19) Wilmington; United States
52.598465813530815,19.097644593980576,365ab0
(18) Polska; Poland
52.25,21,365ab0
(17) Warsaw; Poland
47.498093997730926,19.075952642104205,365ab0
(17) Budapest; Hungary
50.86669921875,6.866700172424316,3c64c3
(16) Hürth; Germany
36.3213996887207,127.41999816894531,3c64c3
(16) Daejeon; Korea, Republic of
37.778274059295654,-122.39959669113159,3c64c3
(16) San Francisco; United States
50.818613052368164,12.917206406593323,3c64c3
(16) Chemnitz; Germany
40.78574066162109,-77.85067342122396,3c64c3
(15) State College; United States
28.600000381469727,77.19999694824219,3c64c3
(15) New Delhi; India
60.45000076293945,22.283300399780273,3c64c3
(15) Turku; Finland
28.66670036315918,77.2166976928711,3c64c3
(15) Delhi; India
59.33330154418945,18.049999237060547,3c64c3
(15) Stockholm; Sweden
-25.41736466544015,-49.25119291033064,3c64c3
(14) Curitiba; Brazil
45.75,126.6500015258789,3c64c3
(14) Harbin; China
29.729757036481583,-95.46076965332031,3c64c3
(14) Houston; United States
45.41669845581055,-75.69999694824219,3c64c3
(14) Ottawa; Canada
-31.424999237060547,-64.17500305175781,3c64c3
(14) Cordoba; Argentina
51.54633549281529,-0.47686427405902315,3c64c3
(14) Uxbridge; United Kingdom
-37.81452266986553,144.96670649601862,4f74c9
(13) Melbourne; Australia
37.4192008972168,-122.05740356445312,4f74c9
(13) Mountain View; United States
28.549999237060547,-16.11669921875,4f74c9
(13) La Mancha; Spain
52.00277768648588,4.370630851158729,4f74c9
(13) Delft; Netherlands
4.615138384012075,-74.07698998084435,4f74c9
(13) Bogotá; Colombia
45.46670150756836,9.199999809265137,4f74c9
(12) Milan; Italy
52.29290008544922,4.866700172424316,4f74c9
(12) Amstelveen; Netherlands
45.56669998168945,5.933300018310547,4f74c9
(12) Chambéry; France
52.36848258972168,5.157116770744324,4f74c9
(12) Almere; Netherlands
19.033300399780273,73.0999984741211,6383cf
(11) Kalamboli; India
30.286636525934394,120.16278145530008,6383cf
(11) Hangzhou; China
34.201900482177734,72.05249786376953,6383cf
(11) Mardan; Pakistan
50.77367435802113,6.106463605707342,6383cf
(11) Aachen; Germany
-30.950000762939453,-58.79999923706055,6383cf
(11) Federal; Argentina
31.536749839782715,74.34337768554687,6383cf
(10) Lahore; Pakistan
48.150001525878906,17.11669921875,6383cf
(10) Bratislava; Slovakia
22.284840393066407,114.1500015258789,6383cf
(10) Central District; Hong Kong
52.25,-0.8833000063896179,6383cf
(10) Northampton; United Kingdom
54.233299255371094,10.283300399780273,6383cf
(10) Preetz; Germany
46.96590042114258,31.997400283813477,6383cf
(10) Nikolaev; Ukraine
52.082631301879886,4.296300172805786,6383cf
(10) Den Haag; Netherlands


News

  • June 19, 2017
    • minor bug fixes
  • June 1, 2017
    • some bug fixes
  • May 10, 2017
    • ANDL reader supports and evaluates functions, defined in the ANDL file
    • ANDL files for continuous Petri nets are supported, but any real valued number N is rounded to the smallest integer value not less than N; any additional attributes are ignored (fixed, reversible)
  • February 7, 2017
    • some bug fixes
  • March 25, 2015
    • new plugin for structural analysis of continuous Petri nets/ODEs is released
  • October 06, 2014
    • some bug fixes
  • May 13, 2013
    • some bug fixes
  • January 11, 2012
    • import for the Abstract Net Description Language (ANDL)
  • December 02, 2011
    • bug fix; dead transitions
  • August 26, 2011
    • bug fix; corrected some rules
    • bug fix; corrected usage of read arcs
    • bug fix; list of last files can be used after Charlie restarts
    • several more bug fixes
    • new feature: plugin support
    • new feature: option for automatically applying rules
    • new feature: option for toggle on/off logging
    • new feature: added reader for INA files
    • new feature: improved display of results
    • new feature: added several tooltips
    • several more features
  • January 24, 2011
    • bug fix; structural analysis of time nets
  • December 08, 2010
    • bug fix; there were problems with dependent set computation
  • November 29, 2010
    • some bug fixes; there were problems with nets containing read arcs
  • November 2, 2010
    • the DTP computation will now be aborted when a deadlock with a not sufficiently marked trap is found; to compute all minimal deadlocks the flag 'create all' must be set
  • October 20, 2010
    • there where problems when loading dependent node sets in snoopy; a node set file must contain an information, whether it deals with places or with transitions
    • the place set analyzer has been extended: now you can determine for an arbitrary place set the maximal trap in contains
  • September 27, 2010
    • some bug fixes, there where problems with extended arc types
  • Juli 22, 2010
    • some bug fixes, there where problems with big sized Petri nets
  • January 29 , 2010
    • Charlie comes with a new graphical user interface and the following additional features
    • textual user interface
    • marking editor
    • graphical interface to use our DD-based model checkers
    • analysis tasks can be done in parallel
  • June 3, 2009
    • Charlie reads all known Petri net classes of Snoopy
    • rates, timing informations etc. are irgnored; only the net structure will be considered
  • February 17, 2009
    • bug fix concerning the determination whether a net is PURE
  • January 06, 2009
    • the coloring of strongly connected components can be disabled
  • January 02, 2009
    • bug fix concerning stubborn set reduction
  • November 27, 2008
    • improvements concerning the computation of shortest paths
  • April 29, 2008
    • bug fix in the CTL-model checker
  • April 8, 2008
    • some bug fixes
  • November 23, 2007
    • Charlie is now able to read P/T nets containing also read arcs, inhibitor arcs, reset arcs and equal arcs.
    • Attention: The use of inhibitor arcs and reset arcs may affect analysis results (boundedness check, structural properties like DTP , ...). You should know, what you are doing!

General Description

Charlie is an extensible software tool to analyse (extended) place/transition nets, it belongs to our toolset comprising Snoopy, Marcie, Patty and S4 . The tool has been developed and is maintained at the Brandenburg Technical University (BTU), Dep. of Computer Science, "Data Structures and Software Dependability" in Cottbus, Germany. Its design builds on the experience gained over about 20 years working with INA - the Integrated Net Analyser - previously developed at Humboldt University Berlin by Peter Starke.

Charlie applies standard analysis techniques of Petri net theory to determine structural and behavioural properties of Petri nets, complemented by explicit CTL and LTL model checking.

A distinguished feature of Charlie is its rule system which applies standard theorems of Petri net theory to computed properties in order to possibly derive further properties, which may save a great amount of computational time. All applied rules are reported, so the user can keep track of the analysis process.

Charlie is a Java application, its primary focus is teaching of Petri net theory. The tool is in use for the verification of technical systems, especially software-based systems, as well as for the validation of natural systems, i.e. biochemical networks as metabolic, signal transduction, and gene regulatory networks.

Key Features

  • analysis of (standard) place/transition Petri nets by the standard body of Petri net theory
  • analysis of extended Petri nets (read/inhibitory/equal/reset arcs) based on reachability graph construction
  • Java application, supporting parallelism based on Java threads;
  • intuitive GUI
  • textual user interface to be embedded in external tools
  • rule system encoding the main theorems of the standard body of Petri net theory
  • extensible by plugin support

Main Analysis Features

  • structural analysis
    • structural properties (e.g., pure, ordinary, homogenous, conservative, connected, strongly connected, boundary nodes, ...)
    • net classes (state machine, marked graph, free choice, extended free choice, extended simple)
  • analyses building on incidence matrix
    • rank theorem
    • place/transition invariants
    • (abstract) dependent transition sets (ADT sets)
  • siphon/trap computation
    • Siphon/Trap Property (STP)
    • place set analyser (sound/bad siphon, maximal trap)
  • reachability graph based analysis
    • behavioural properties (boundedness, liveness, reversibility, dynamic conflicts)
    • explicit CTL model checking (ctl grammar)
    • explicit LTL model checking (ltl grammar)
  • coverability graph
  • path search
    • shortest/longest paths between a source and sink specified by (sub-marking), state identifier or predicate
  • reachability/coverability graph visualization using the JUNG library

Supported Input Formats

  • PNML in preparation
  • Snoopy, all known Petri net classes, such as Petri nets, extended Petri nets, stochastic Petri nets, etc.; rates, timing informations, etc. are ignored, only the net structure is considered;

    Attention: The use of special arcs (inhibitor arcs, reset arcs, etc.) may affect analysis results (boundedness check, structural properties like DTP , ...). You should know, what you are doing!
  • ANDL - Abstract Net Description Language, a concise, but human-readable net description language, see Marcie manual for details;
  • APNN - Abstract Petri Net Notation (no support of "\like", capacities);
  • INA's pnt format;

Related Papers

  • [HSW15]
    M Heiner, M Schwarick and J Wegener:
    Charlie – an extensible Petri net analysis tool;
    In Proc. PETRI NETS 2015, Brussels, Springer, LNCS, volume 9115, pages 200–211, June 2015. [ url ] [ doi ] [ BibTeX ]
  • [BHM11]
    MA Blätke, M Heiner, and W Marwan:
    Tutorial - Petri Nets in Systems Biology;
    Technical report, Otto von Guericke University Magdeburg, Magdeburg Centre for Systems Biology, August 2011. [ pdf ] [ BibTeX ]
  • [WSH11]
    J Wegener, M Schwarick and M Heiner:
    A Plugin System for Charlie;
    In Proc. International Workshop on Concurrency, Specification, and Programming (CSP 2011), Biaystok University of Technology, ISBN: 978-83-62582-06-8, pages 531–554, September 2011. [ url ] [ pdf ] [ BibTeX ]
  • [WSH11.sld]
    J Wegener, M Schwarick and M Heiner:
    A Plugin System for Charlie;
    Talk, International Workshop on Concurrency, Specification, and Programming (CSP 2011), September 2011. [ pdf ] [ BibTeX ]
  • [Fran09]
    Andreas Franzke:
    Charlie 2.0 – a multi-threaded Petri net analyzer;
    Diploma thesis, BTU Cottbus, Dep. of CS, December 2009. [ pdf ] [ BibTeX ]
  • [Fisc09]
    Ansgar Fischer:
    Reachability graph based analysis of time-dependent Petri nets (in German);
    Diploma thesis, BTU Cottbus, Dep. of CS, October 2009. [ BibTeX ]
  • [Schw09]
    Marcel Schwarze:
    Web-based Petri net animation (in German);
    Diploma thesis, FH Lausitz, Dep. of CS, November 2009. [ BibTeX ]

Downloads

Charlie

Download Charlie setup_charliev2_0.jar (19.06.2017) installation file

Requirements

  • Charlie is entirely implemented in Java, a Java Runtime Environment (JRE6 or higher) is required.
  • third party libraries
    • JUNG (BSD license)
    • Apache Jakarta Commons Collections 3.1 (Apache license)
    • Apache Commons Logging 1.1.1 (Apache license)
    • JavaHelp 2.0_05
    • JCUP, JLEX (OSI license)
    • ANTLR's runtime (BSD license, Copyright (c) 2003-2008, Terence Parr)

Installation/Execution

  1. type 'java -jar setup_charliev2_0.jar' and choose an installation folder
  2. type in this folder './run.sh' to use the graphical user interface
    or './tCharlie.sh' to use the textual user interface

Plugins

Charlie comes with a plugin mechanism to extend its basic functionality. In the table below you find several plugins provided by the authors of Charlie.

Installing a plugin is simple: download the plugin file and copy the zip file (without unpacking) to the plugin folder of Charlie's installation path. ATTENTION: On MAC OS, downloading may automatically unpack the zip file. To uninstall a plugin, simply remove the file from the folder.

NameDescriptionDownload link
Command Line ToolsA plugin to communicate with command line tools, e.g. Marcie.plugin-CLT.zip
Structural ReductionA plugin trying to structurally reduce a Petri net. There are several reduction rules to choose from.plugin-StructuralReduction.zip
Time Petri NetsA plugin for the analysis of time-dependend Petri nets.plugin-TimePN.zip
Conflict GraphA plugin that computes and displays a transition conflict graph.plugin-ConflictGraph.zip
Continuous Petri NetsA plugin for the structural analysis of continuous Petri nets, i.e., systems of Ordinary Differential Equations (ODEs).plugin-ODE.zip

Demo Plugin

Complete source code for Charlie's ODEs-related plugin; demonstrates how to write plugins, including the addition of new rules and properties: demo plugin charlieODE.tar.gz

Bug Reports

Submit your bug reports and comments re Charlie here.

  • Please check, if your problem still exists in the latest Charlie version.
  • Please include the information about your platform (Windows, Linux, MAC OS) and Charlie built details.

… the end …

Any comments or questions are welcome. Please direct them to monika [period] heiner [snail] b-tu [period] de Privacy Policy