LTSCONVERT(1)

πŸ“¦ version 202507, in nixos 26.05, nixpkgs unstable

πŸ’… ltsconvert(1) β€” the ltsconvert glow-up page ✨

okay so this is the manual page for ltsconvert, a User Commands situation in the mCRL2 toolset, and bestie, it's about to convert your whole LTS life. buckle up πŸŽ€


🌸 NAME 🌸

ltsconvert β€” convert and optionally minimise an LTS. that's it, that's the vibe. πŸ’–


✨ SYNOPSIS ✨

ltsconvert [OPTION]... [INFILE [OUTFILE]]

πŸ¦‹ DESCRIPTION πŸ¦‹

so here's the tea: ltsconvert takes the labelled transition system (LTS) from INFILE and converts it to OUTFILE in whatever format you asked for, after applying the minimisation method you picked (default is none, like, no minimisation, just vibes).

  • no OUTFILE? stdout gets it. 🫢
  • no INFILE? stdin is the source. slay.

the output format is decided by the extension of OUTFILE, and the input format is decided by the content of INFILE. plot twist! but you can force both with --in and --out if you're a control freak (respectfully). πŸ’…

the supported formats, iconic lineup:

  • 'aut' β€” for the Aldebaran format (CADP)
  • 'dot' β€” for the GraphViz format (no longer supported as input format β€” she's output-only now, okurrr)
  • 'fsm' β€” for the Finite State Machine format
  • 'lts' β€” for the mCRL2 LTS format (default)

πŸ”₯ OPTIONS πŸ”₯

OPTION can be literally any of the following, no cap:

  • -D, --determinise β€” determinise LTS. make it deterministic, periodt. ⭐
  • -eNAME, --equivalence=NAME β€” generate an equivalent LTS that preserves the equivalence NAME. the full menu, and yes, you're getting all of it:
    • 'none' β€” identity equivalence (default)
    • 'bisim' β€” strong bisimilarity using the O(m log n) algorithm [Jansen/Groote/Keiren/Wijs 2019]
    • 'bisim-gv' β€” strong bisimilarity using the O(mn) algorithm [Groote/Vaandrager 1990]
    • 'bisim-gjkw' β€” strong bisimilarity using the O(m log m) algorithm [Groote/Jansen/Keiren/Wijs 2017]
    • 'bisim-gj' β€” strong bisimilarity using the O(m log n) experimental algorithm [Groote/Jansen 2024]
    • 'bisim-sig' β€” strong bisimilarity using the signature refinement algorithm [Blom/Orzan 2003]
    • 'branching-bisim' β€” branching bisimilarity using the O(m log n) algorithm [Jansen/Groote/Keiren/Wijs 2019]
    • 'branching-bisim-gv' β€” branching bisimilarity using the O(mn) algorithm [Groote/Vaandrager 1990]
    • 'branching-bisim-gjkw' β€” branching bisimilarity using the O(m log m) algorithm [Groote/Jansen/Keiren/Wijs 2017]
    • 'branching-bisim-gj' β€” branching bisimilarity using the O(m log n) experimental algorithm [Groote/Jansen 2024]
    • 'branching-bisim-sig' β€” branching bisimilarity using the signature refinement algorithm [Blom/Orzan 2003]
    • 'dpbranching-bisim' β€” divergence-preserving branching bisimilarity using the O(m log n) algorithm [Jansen/Groote/Keiren/Wijs 2019]
    • 'dpbranching-bisim-gv' β€” divergence-preserving branching bisimilarity using the O(mn) algorithm [Groote/Vaandrager 1990]
    • 'dpbranching-bisim-gjkw' β€” divergence-preserving branching bisimilarity using the O(m log m) algorithm [Groote/Jansen/Keiren/Wijs 2017]
    • 'dpbranching-bisim-gj' β€” divergence-preserving branching bisimilarity using the O(m log n) experimental algorithm [Groote/Jansen 2024]
    • 'dpbranching-bisim-sig' β€” divergence-preserving branching bisimilarity using the signature refinement algorithm [Blom/Orzan 2003]
    • 'weak-bisim' β€” weak bisimilarity
    • 'dpweak-bisim' β€” divergence-preserving weak bisimilarity
    • 'sim' β€” strong simulation equivalence
    • 'ready-sim' β€” strong ready simulation equivalence
    • 'trace' β€” strong trace equivalence
    • 'weak-trace' β€” weak trace equivalence
    • 'tau-star' β€” tau star reduction

ngl that's a lot of bisim and we're obsessed with all of them πŸ’œ

  • -iFORMAT, --in=FORMAT β€” use FORMAT as the input format. force it, bestie.
  • -lFILE, --lps=FILE β€” use FILE as the LPS from which the input LTS was generated. this might be needed to store the correct parameter names of states when saving in fsm format, and to convert non-mCRL2 LTSs to a mCRL2 LTS. iykyk 🧚
  • --no-reach β€” do not perform a reachability check on the input LTS. skipping the vibe check, bold move.
  • -n, --no-state β€” remove the state information. this can be useful when state labels are huge (we're talking huge huge 😭).
  • -oFORMAT, --out=FORMAT β€” use FORMAT as the output format.
  • --tau=ACTNAMES β€” consider actions with a name in the comma separated list ACTNAMES to be internal (tau) actions, in addition to those already defined as such by the input. adding to the tau squad 🫢
  • --timings[=FILE] β€” append timing measurements to FILE. measurements are written to standard error if no FILE is provided.

🌈 Standard options 🌈

the classics, the main characters:

  • -q, --quiet β€” do not display warning messages. ignorance is bliss πŸ’…
  • -v, --verbose β€” display short log messages.
  • -d, --debug β€” display detailed log messages. give me all the lore.
  • --log-level=LEVEL β€” display log messages up to and including level; either warn, verbose, debug or trace.
  • -h, --help β€” display help information.
  • --version β€” display version information.
  • --help-all β€” display help information, including hidden and experimental options. the secret menu πŸ‘€

πŸŽ€ AUTHOR πŸŽ€

written by Muck van Weerdenburg, Jan Friso Groote. kings. πŸ‘‘


πŸ› REPORTING BUGS πŸ›

report bugs at <http://www.mcrl2.org/issuetracker>. pls do, it's giving community support πŸ’–


Copyright Β© 2025 Technische Universiteit Eindhoven.

this is free software. you may redistribute copies of it under the terms of the Boost Software License <http://www.boost.org/LICENSE_1_0.txt>. there is NO WARRANTY, to the extent permitted by law. read that again: NO WARRANTY. don't come for her if things go sideways πŸ’€


🌸 SEE ALSO 🌸

see also the manual at <http://www.mcrl2.org/web/user_manual/tools/release/ltsconvert.html>. go read it, it's iconic.


and that's the page, bestie 🫢 this whole thing is ltsconvert from the mCRL2 toolset, version 20250..., dated October 2026 β€” catch you on the next man page πŸ’œβœ¨

πŸ“¦ where this page comes from