Skip to search formSkip to main contentSkip to account menu

Timed event system

The General System has been described in [Zeigler76] and [ZPK00] with the stand points to define (1) the time base, (2) the admissible input segments… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
Highly Cited
2008
Highly Cited
2008
Todays networks of processors on and off chip, operating with independent clocks, need effective synchronization of the data… 
Review
2007
Review
2007
Finite Abstract Models for Deterministic Transition Systems: Fair Parallel Composition and Refinement-Preserving Logic.- Slicing… 
2007
2007
We propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri… 
Highly Cited
2005
Highly Cited
2005
Web services are increasingly gaining acceptance as a framework for facilitatingapplication-to-application interactions within… 
Highly Cited
2002
Highly Cited
2002
In this article, we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing… 
Highly Cited
2001
Highly Cited
2001
Highly Cited
2001
Highly Cited
2001
  • E. Vicario
  • IEEE Trans. Software Eng.
  • 2001
  • Corpus ID: 18794469
An enumerative technique is presented which supports reachability and timeliness analysis of time-dependent models. The technique… 
Review
1995
Review
1995
Highly Cited
1990
Highly Cited
1990
  • R. AlurD. Dill
  • International Colloquium on Automata, Languages…
  • 1990
  • Corpus ID: 30736431
To model the behavior of finite-state asynchronous real-time systems we propose the notion of timed Buchi automata (TBA). TBAs…