Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Vojtech Rehak"'
Publikováno v:
IEEE Transactions on Cognitive Communications and Networking. 5:400-412
Malicious users can exploit vulnerabilities in cognitive radio networks (CRNs) and cause heavy performance degradation by denial of service (DoS) attacks. During operation, cognitive radios (CRs) spend a considerable amount of time to identify idle (
Publikováno v:
IJCAI
We propose an algorithm for constructing efficient patrolling strategies in the Internet environment, where the protected targets are nodes connected to the network and the patrollers are software agents capable of detecting/preventing undesirable ac
Publikováno v:
MASCOTS
We consider the fixed-delay synthesis problem for continuous-time Markov chains extended with fixed-delay transitions (fdCTMC). The goal is to synthesize concrete values of the fixed-delays (timeouts) that minimize the expected total cost incurred be
Publikováno v:
BRICS Report Series; No 7 (2004): RS-7 On the Expressive Power of Extended Process Rewrite Systems
BRICS Report Series; Nr. 7 (2004): RS-7 On the Expressive Power of Extended Process Rewrite Systems
Kretínský, M, Rehák, V & Strejcek, J 2004, ' On the Expressive Power of Extended Process Rewrite Systems ' B R I C S Report Series, no. RS-04-7 .
Kretínsky, M, Rehák, V & Strejcek, J 2004, ' On the Expressive Power of Extended Process Rewrite Systems ' B R I C S Report Series, no. RS-04-7 .
BRICS Report Series; Nr. 7 (2004): RS-7 On the Expressive Power of Extended Process Rewrite Systems
Kretínský, M, Rehák, V & Strejcek, J 2004, ' On the Expressive Power of Extended Process Rewrite Systems ' B R I C S Report Series, no. RS-04-7 .
Kretínsky, M, Rehák, V & Strejcek, J 2004, ' On the Expressive Power of Extended Process Rewrite Systems ' B R I C S Report Series, no. RS-04-7 .
We provide a unified view on three extensions of Process rewrite systems (PRS) and compare their and PRS's expressive power. We show that the class of Petri Nets is less expressible up to bisimulation than the class of Process Algebra extended with f
Publikováno v:
Theoretical Computer Science. (1-2):134-140
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit.
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 8, Iss Proc. EXPRESS 2009, Pp 16-25 (2009)
We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Buechi automata (BA) called Almost linear Buechi automata (ALBA). We provide effective translations between LIO and ALBA showing that the two formalisms are expr
Externí odkaz:
https://doaj.org/article/c3ee69e3a6ee48729bd4a3cea49beca2