Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper explores what kinds of management actions are needed by businesses to enhance their innovation capabilities. The first… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2008
Highly Cited
2008
Todays networks of processors on and off chip, operating with independent clocks, need effective synchronization of the data… Expand
  • figure 1.1
  • figure 1.2
Review
2007
Review
2007
Finite Abstract Models for Deterministic Transition Systems: Fair Parallel Composition and Refinement-Preserving Logic.- Slicing… Expand
Highly Cited
2006
Highly Cited
2006
The queueing Petri net (QPN) paradigm provides a number of benefits over conventional modeling paradigms such as queueing… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2005
Highly Cited
2005
Web services are increasingly gaining acceptance as a framework for facilitatingapplication-to-application interactions within… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2003
Highly Cited
2003
Over the last years there has been an increasing research effort directed towards the automatic verification of infinite state… Expand
Highly Cited
2002
Highly Cited
2002
In this article, we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2001
Highly Cited
2001
Abstract An internet-based workflow management system (WfMS) enables business participants to work co-operatively at sites… Expand
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… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1990
Highly Cited
1990
To model the behavior of finite-state asynchronous real-time systems we propose the notion of timed Buchi automata (TBA). TBAs… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5