Skip to content
GitLab
Projects Groups Snippets
  • /
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Sign in
  • Spot Spot
  • Project information
    • Project information
    • Activity
    • Labels
    • Members
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
  • Issues 134
    • Issues 134
    • List
    • Boards
    • Service Desk
    • Milestones
  • Merge requests 1
    • Merge requests 1
  • CI/CD
    • CI/CD
    • Pipelines
    • Jobs
    • Schedules
  • Deployments
    • Deployments
    • Environments
    • Releases
  • Monitor
    • Monitor
    • Incidents
  • Analytics
    • Analytics
    • Value stream
    • CI/CD
    • Repository
  • Wiki
    • Wiki
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
Collapse sidebar
  • SpotSpot
  • SpotSpot
  • Issues
  • #81
Closed
Open
Issue created May 12, 2015 by Alexandre Duret-Lutz@adlOwner

more PSL simplifications

I think the following simplifications are correct and simple to implement:

{e[*0..j]}<>->f  =  {e[*1..j]}<>->f
{e[*0..j]}[]->f  =  {e[*1..j]}[]->f

It matters for example in this random PSL formula:

./ltl2tgba -H '(({p1[*0..1]}[]-> 0) R XFp0)'
./ltl2tgba -H '(({p1[*1..1]}[]-> 0) R XFp0)'

The former produces a deterministic automaton, while the second produces a non-deterministic one.

Assignee
Assign to
Time tracking