How to Install and Uninstall mona Package on Ubuntu 21.10 (Impish Indri)

Last updated: December 23,2024

1. Install "mona" package

In this section, we are going to explain the necessary steps to install mona on Ubuntu 21.10 (Impish Indri)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                mona
            
                    
    
    Copied

2. Uninstall "mona" package

This is a short guide on how to uninstall mona on Ubuntu 21.10 (Impish Indri):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                mona
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the mona package on Ubuntu 21.10 (Impish Indri)

Package: mona
Architecture: amd64
Version: 1.4-17-2build1
Priority: optional
Section: universe/misc
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Science Maintainers
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 1396
Depends: libc6 (>= 2.14), libgcc-s1 (>= 3.0), libstdc++6 (>= 5)
Recommends: graphviz
Filename: pool/universe/m/mona/mona_1.4-17-2build1_amd64.deb
Size: 320120
MD5sum: 8566b20c0c0eb55ea27d213f930e8e38
SHA1: dc253850a6415de53e4b406328e51b0e38219469
SHA256: eea469c3b9eb70d831ccb6c2169f02a0a8022a8d68279bbf1b27d0f8fb8353fc
SHA512: abe707fb85dad64ee9dcb25cdda20bd594b27212f6b34886b945b775dbc454b1f5f85625dce77849cf3d87c11fb592097141860ddabf46e1dfaf2e16f5455e2f
Homepage: http://www.brics.dk/~amoeller/mona/index.html
Description-en: theorem prover based on automata
MONA is a tool that translates formulas in the logics WS1S or WS2S
into finite-state automata represented by BDDs. The formulas may
express search patterns, temporal properties of reactive systems,
parse tree constraints, etc. MONA also analyses the automaton
resulting from the compilation, and determines whether the formula is
valid and, if the formula is not valid, generates a counter-example.
.
Documentation is available from the MONA website http://www.brics.dk/mona/.
Description-md5: 2fcd097fb45a3451958acd496a75b3eb