MetDiscrete

MetDiscrete is a theoretical framework for reasoning about discrete systems through metamodeling. It blends discrete mathematics with a metasystem perspective to support modeling at multiple abstraction levels. The goal is modular specification, compositional verification, and reuse of discrete components.

The core idea is to separate syntax from semantics. A metDiscrete model has a metamodel that defines allowed discrete constructs (states, events, transitions) and a set of instance models that realize those constructs for specific scenarios. Semantics are applied at the instance level but constrained by the metamodel.

Formally, metDiscrete uses a two-tier approach: the metamodel specifies constructs, while the model level interprets them as discrete structures such as labeled transition systems or Petri nets. The framework emphasizes compositionality, enabling small models to be combined into larger ones while preserving properties proven for components.

Applications are proposed for digital circuit design, discrete-event simulation, workflow modeling, and model-driven engineering. An example is a traffic-light system where the metamodel defines states and timing constraints and instances represent intersections that must satisfy safety and progress properties.

MetDiscrete remains primarily a theoretical construct with limited practical deployment. Advocates cite standardized modeling and reusable verification; critics note semantic complexity and the risk of inconsistency across abstraction levels.

See also: discrete mathematics, metamodeling, model-driven engineering, discrete-event simulation, formal methods.