Elaborative orderings of condition languages

Lawrence E. Holloway, Jeffrey Ashley

Research output: Contribution to journalConference articlepeer-review

6 Scopus citations


This paper considers condition languages, where the language specifically specifies sequences of system inputs and outputs that are true, rather than just indicating the changes as events. This avoids the potential state explosion of the commonly found event-based automata, which must keep track of the current state of the system inputs through its own state. We introduce an elaborative ordering, which is used to compare the amount of detail among sequences. This allows us to clearly relate the detailed closed-loop condition language of a system to high-level, less-detailed sequences specifying desired behaviors.

Original languageEnglish
Pages (from-to)3781-3782
Number of pages2
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - 1998
EventProceedings of the 1998 37th IEEE Conference on Decision and Control (CDC) - Tampa, FL, USA
Duration: Dec 16 1998Dec 18 1998

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization


Dive into the research topics of 'Elaborative orderings of condition languages'. Together they form a unique fingerprint.

Cite this