com.uppaal.model.system
Class Polyhedron

java.lang.Object
  extended by com.uppaal.model.system.Polyhedron

public class Polyhedron
extends Object


Constructor Summary
Polyhedron(UppaalSystem system)
           
 
Method Summary
 void add(int i, int j, int bound)
           
 void addNonStrictConstraint(int i, int j, int bound)
           
 void addStrictConstraint(int i, int j, int bound)
           
 boolean equals(Object obj)
           
 void getAllConstraints(List<String> result)
          Convert constraint system to a human readable string representation containing all non-trivial constraints.
 void getSufficientConstraints(List<String> result)
          Convert constraint system to a human readable representation based on the minimal constraint graph.
 String toString()
           
 void trim()
           
 void writeTextualFormat(Writer writer)
           
 
Methods inherited from class java.lang.Object
clone, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
 

Constructor Detail

Polyhedron

public Polyhedron(UppaalSystem system)
Method Detail

writeTextualFormat

public void writeTextualFormat(Writer writer)
                        throws IOException
Throws:
IOException

toString

public String toString()
Overrides:
toString in class Object

getAllConstraints

public void getAllConstraints(List<String> result)
Convert constraint system to a human readable string representation containing all non-trivial constraints.


getSufficientConstraints

public void getSufficientConstraints(List<String> result)
Convert constraint system to a human readable representation based on the minimal constraint graph. It is not actually the minimal constraint graph, since constraints on individual clocks are always added. Also, if either the lower or upper bound on a clock difference is included in the minimal constraint graph, then both are added to the string representation. TODO: Knowing that we always print both lower and upper bounds, there might be other constraints that we do not need to print. We should be able to detect this if we implement the minimal constraint graph computation directly. We should also take information about hidden clocks into account.


addStrictConstraint

public void addStrictConstraint(int i,
                                int j,
                                int bound)

addNonStrictConstraint

public void addNonStrictConstraint(int i,
                                   int j,
                                   int bound)

add

public void add(int i,
                int j,
                int bound)

trim

public void trim()

equals

public boolean equals(Object obj)
Overrides:
equals in class Object


Copyright © 2012 Uppsala University and Aalborg University. All Rights Reserved.