Sciweavers

JACM
2002
142views more  JACM 2002»
14 years 3 days ago
Timed regular expressions
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
Eugene Asarin, Paul Caspi, Oded Maler
SIGSOFT
2008
ACM
14 years 11 days ago
Efficient online monitoring of web-service SLAs
If an organization depends on the service quality provided by another organization it often enters into a bilateral service level agreement (SLA), which mitigates outsourcing risk...
Franco Raimondi, James Skene, Wolfgang Emmerich
ENTCS
2006
231views more  ENTCS 2006»
14 years 13 days ago
SaveCCM: An Analysable Component Model for Real-Time Systems
Component based development is a promising approach for embedded systems. Typical for embedded software is the presence of resource constraints in multiple dimensions. An essentia...
Jan Carlson, John Håkansson, Paul Pettersson
ENTCS
2006
148views more  ENTCS 2006»
14 years 13 days ago
Towards the Semantics and Verification of BPEL4WS
Abstract. In this paper, we discuss the semantics of BPEL4WS language which is a de facto standard for specifying and execution workflow specification for web service composition a...
Geguang Pu, Xiangpeng Zhao, Shuling Wang, Zongyan ...
ATVA
2010
Springer
148views Hardware» more  ATVA 2010»
14 years 1 months ago
Recursive Timed Automata
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Ashutosh Trivedi, Dominik Wojtczak
SDL
2001
125views Hardware» more  SDL 2001»
14 years 1 months ago
Verification of Quantitative Temporal Properties of SDL Specifications
Abstract. We describe an approach for the verification of quantitative temporal properties of SDL specifications, which adapts techniques developed for timed automata [2]. With res...
Iulian Ober, Alain Kerbrat
FOSSACS
2008
Springer
14 years 2 months ago
Robust Analysis of Timed Automata via Channel Machines
Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Se...
Patricia Bouyer, Nicolas Markey, Pierre-Alain Reyn...
CONCUR
2005
Springer
14 years 2 months ago
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation
Abstract. Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon...
Pedro R. D'Argenio, Biniam Gebremichael
APN
2005
Springer
14 years 2 months ago
Timed-Arc Petri Nets vs. Networks of Timed Automata
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...
Jirí Srba
CHARME
1995
Springer
120views Hardware» more  CHARME 1995»
14 years 4 months ago
Timing analysis of asynchronous circuits using timed automata
In this paper we present a method formodeling asynchronous digital circuits by timed automata. The constructed timed automata serve as \mechanical" and veri able objects for a...
Oded Maler, Amir Pnueli