Time-Constrained Automata (Extended Abstract)

@inproceedings{Merritt1991TimeConstrainedA,
  title={Time-Constrained Automata (Extended Abstract)},
  author={Michael Merritt and Francesmary Modugno and Marc R. Tuttle},
  booktitle={CONCUR},
  year={1991}
}
In this paper, we augment the input-output automaton model in order to reason about time in concurrent systems, and we prove simple properties of this augmentation. The input-output automata model is a useful model for reasoning about computation in concurrent and distributed systems because it allows fundamental properties such as fairness and compositionality to be expressed easily and naturally. A unique property of the model is that systems are modeled as the composition of autonomous… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 85 CITATIONS

The Theory of Timed I/O Automata

VIEW 5 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Automated deductive requirements analysis of critical systems

  • ACM Trans. Softw. Eng. Methodol.
  • 2001
VIEW 8 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Revisiting the PAXOS algorithm

VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Action transducers and timed automata

  • Formal Aspects of Computing
  • 1994
VIEW 9 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Forward and Backward Simulations for Timing-Based Systems

VIEW 5 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems

  • RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003
  • 2003
VIEW 6 EXCERPTS
CITES METHODS, BACKGROUND & RESULTS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1989
2019

CITATION STATISTICS

  • 13 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Lynch and Haglt Attiya . Using mappings to prove timing properties

A. Nancy
  • Information and Computation
  • 1988

Lynch and Michael Merritt . Introduction to the theory of nested transactions

A. Nancy
  • Theoretical Computer Science
  • 1988

Faron Moiler and Chris Torts . A temporal calculus of communicating systems

J. C. M. Baeten, Jennifer L. Welch

    Lewis . A logic of concrete time intervals

    R. Harry

      PAchard Gerber and Insup Lee . CCSIt : A calculus for communicating shared resources Impossibility and universality results for waltfree synchronization Explicit clock temporal logic

      C. A. R.. Hoare.
      • ACM Transactions on Programming Languages and Systems