Details of instance lilydemo20.tlsf

Name: lilydemo20.tlsf
md5: ff29243927e012ba723bfd55dcfcfd3b
FractionOfBinaryClauses None
FractionOfNegativeLiteralsPerClauseEntropy None
FractionOfNegativeLiteralsPerClauseMax None
FractionOfNegativeLiteralsPerClauseMean None
FractionOfNegativeLiteralsPerClauseMin None
FractionOfNegativeLiteralsPerClauseVariationCoefficient None
FractionOfNegativeVariablesEntropy None
FractionOfNegativeVariablesMax None
FractionOfNegativeVariablesMean None
FractionOfNegativeVariablesMin None
FractionOfNegativeVariablesVariationCoefficient None
FractionOfPositiveLiteralsPerClauseEntropy None
FractionOfPositiveLiteralsPerClauseMax None
FractionOfPositiveLiteralsPerClauseMean None
FractionOfPositiveLiteralsPerClauseMin None
FractionOfPositiveLiteralsPerClauseVariationCoefficient None
FractionOfPositiveVariablesEntropy None
FractionOfPositiveVariablesMax None
FractionOfPositiveVariablesMean None
FractionOfPositiveVariablesMin None
FractionOfPositiveVariablesVariationCoefficient None
FractionOfTernaryClauses None
FractionOfUnaryClauses None
ClausesToVariablesRatio None
ClausesToVariablesRatioCubic None
ClausesToVariablesRatioQuadratic None
LinearizedClausesToVariablesRatio None
LinearizedClausesToVariablesRatioQuadratic None
LinearizedClaustesToVariablesRatioCubic None
NumberOfClauses None
NumberOfVariables None
VariablesToClausesRatio None
VariablesToClausesRatioCubic None
VariablesToClausesRatioQuadratic None
ClauseNodeDegreesEntropy None
ClauseNodeDegreesMax None
ClauseNodeDegreesMean None
ClauseNodeDegreesMin None
ClauseNodeDegreesVariationCoefficient None
VariableNodeDegreesEntropy None
VariableNodeDegreesMax None
VariableNodeDegreesMean None
VariableNodeDegreesMin None
VariableNodeDegreesVariationCoefficient None
DegreeEntropy None
DegreeMax None
DegreeMean None
DegreeMin None
DegreeVariationCoefficient None
Download instance (1.2 kB)
INFO {
  TITLE:       "Lily Demo V20"
  DESCRIPTION: "One of the Lily demo files - Simplified TLC"
  SEMANTICS:   Mealy
  TARGET:      Mealy
}

MAIN {

  INPUTS {
    ec; // car present on farm road
    etc; // 0 is counter has expired, 1 if it is counting
  }

  OUTPUTS {
    sts;  // timer set
    sflr; // light on farm road (red green)
    shlr; // light on highway
  }

  ASSUMPTIONS {
    // timer          
    !etc;
    G ((!etc && !sts) -> X !etc);
    G (etc -> F !etc);
    G (sts -> X etc);
  }

  I

... [truncated 178 Bytes]

/ out OR no cars present the highway light moves
    // when time out AND cars present (on farm road).
    // the second x is because the system can not react
    // instantaneously
    (!sflr && (!etc || !ec)) -> X sflr;
    (!shlr && (!etc ||  ec)) -> X shlr;

    // safety: at least one red
    sflr || shlr;

    // liveness: farm cars cause a green light, highway
    //           is regularly set to green
    ec -> F !sflr;
    F !shlr;
  }
  
}



//#!SYNTCOMP
//STATUS : realizable
//REF_SIZE : 1
//#.