384 search results - page 23 / 77 » On the Semantics of Markov Automata |
120
click to vote
GPCE
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we propose a domain-specific aspect language to prevent the denials of service caused by resource management. Our aspects specify availability policies by enforcin...
162
click to vote
SCP
2010
14 years 8 months ago
2010
We propose a domain-specific aspect language to prevent denial of service caused by resource management. Our aspects specify availability policies by enforcing time limits in the ...
100
Voted
ICGI
2010
Springer
15 years 12 days ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
138
click to vote
IEEESCC
2005
IEEE
15 years 7 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
109
click to vote
CAV
1999
Springer
15 years 6 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...