Sciweavers

384 search results - page 20 / 77
» On the Semantics of Markov Automata
Sort
View
JUCS
2006
121views more  JUCS 2006»
15 years 1 months ago
On-line Monitoring of Metric Temporal Logic with Time-Series Constraints Using Alternating Finite Automata
: In this paper we describe a technique for monitoring and checking temporal logic assertions augmented with real-time and time-series constraints, or Metric Temporal Logic Series ...
Doron Drusinsky
HYBRID
2010
Springer
14 years 12 months ago
Timed I/O automata: a complete specification theory for real-time systems
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
Alexandre David, Kim G. Larsen, Axel Legay, Ulrik ...
QEST
2008
IEEE
15 years 8 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
ENTCS
2008
84views more  ENTCS 2008»
15 years 1 months ago
Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
Bart Jacobs
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
15 years 3 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber