# On Specifications and Proofs of Timed Circuits

@inproceedings{Fgger2022OnSA, title={On Specifications and Proofs of Timed Circuits}, author={Matthias F{\"u}gger and Christoph Lenzen and Ulrich Schmid}, booktitle={Principles of Systems Design}, year={2022} }

. Given a discrete-state continuous-time reactive system, like a digital circuit, the classical approach is to ﬁrst model it as a state transition system and then prove its properties. Our contribution advocates a diﬀerent approach: to directly operate on the input-output behavior of such systems, without identifying states and their transitions in the ﬁrst place. We discuss the beneﬁts of this approach at hand of some examples, which demonstrate that it nicely integrates with concepts of self…

## References

SHOWING 1-10 OF 48 REFERENCES

### The Theory of Timed I/O Automata

- Computer ScienceThe Theory of Timed I/O Automata
- 2006

This monograph presents the timed input/output automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems and a notion of receptiveness, which implies that a TIOA does not block the passage of time.

### Discrete abstractions of hybrid systems

- Mathematics, Computer ScienceProceedings of the IEEE
- 2000

It is shown that interesting classes of hybrid systems can be abstracted to purely discrete systems while preserving all properties that are definable in temporal logic.

### Forward and Backward Simulations, II: Timing-Based Systems

- Computer ScienceInf. Comput.
- 1996

A general automaton model for timing-based systems is presented and is used as the context for developing a variety of simulation proof techniques for such systems. As a first step, a comprehensive…

### Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip☆

- Computer ScienceJ. Comput. Syst. Sci.
- 2014

### Forward and Backward Simulations: I. Untimed Systems

- Computer ScienceInf. Comput.
- 1995

A unified, comprehensive presentation of simulation techniques for verification of concurrent systems is given, in terms of a simple untimed automaton model, where history and prophecy relations are defined and it is shown how invariants can be incorporated into all the simulations.

### The temporal logic of actions

- Computer Science, PhilosophyTOPL
- 1994

This report introduces TLA and describes how it is used to specifying and verify concurrent algorithms and the use of TLA to specify and reason about open systems will be described elsewhere.

### Self-stabilizing systems in spite of distributed control

- Computer ScienceCACM
- 1974

The synchronization task between loosely coupled cyclic sequential processes (as can be distinguished in, for instance, operating systems) can be viewed as keeping the relation “the system is in a…

### Timed Interfaces

- Computer ScienceEMSOFT
- 2002

The theory provides algorithms for checking the compatibility between two interfaces and for deriving the composite interface; the theory can thus be viewed as a type system for real-time interaction.

### A Temporal Logic Approach to Modular Design of Synthetic Biological Circuits

- Computer ScienceCMSB
- 2013

A new approach for the design of a synthetic biological circuit whose behaviour is specified in terms of signal temporal logic STL formulae is presented, which leverages recent results on the quantitative semantics of Signal Temporal Logic.