Filters








262,238 Hits in 8.3 sec

Verifying Time and Communication Costs of Rule-Based Reasoners [chapter]

Natasha Alechina, Brian Logan, Nguyen Hoang Nga, Abdur Rakib
2009 Lecture Notes in Computer Science  
We present a framework for the automated verification of time and communication requirements in systems of distributed rule-based reasoning agents which allows us to determine how many rule-firing cycles  ...  model checker [1] can be used to encode and verify properties of systems of distributed rule-based agents.  ...  In this paper, we focus on a more detailed investigation of time and communication trade-offs for rule-based reasoners.  ... 
doi:10.1007/978-3-642-00431-5_1 fatcat:7obmswc4rjgaxdy7scajsqels4

Automated Verification of Resource Requirements in Multi-Agent Systems Using Abstraction [chapter]

Natasha Alechina, Brian Logan, Hoang Nga Nguyen, Abdur Rakib
2011 Lecture Notes in Computer Science  
Each reasoner uses facts, messages and Horn clause rules to derive new information.  ...  We show how to verify correctness of distributed problem solving under resource constraints, such as the time required to answer queries and the number of messages exchanged by the agents.  ...  Conclusion We described an automated verification framework for communicating resource-bounded reasoners which takes a set of agents specified in terms of facts and Horn clause rules and automatically  ... 
doi:10.1007/978-3-642-20674-0_5 fatcat:aftljqldkvhw3ly2chdkbqoaai

Verifying Resource Requirements for Distributed Rule-Based Systems [chapter]

Natasha Alechina, Brian Logan, Nguyen Hoang Nga, Abdur Rakib
2008 Lecture Notes in Computer Science  
More specifically, we consider distributed problemsolving in systems of communicating rule-based systems, and ask how much time (measured as the number of rule firings) and message exchanges does it take  ...  We show how standard model-checking technology can be used to verify resource requirements for such systems, and present preliminary results which highlight complex tradeoffs between time and communication  ...  Distributed rule-based systems In this section, we introduce a model of a distributed rule-based system and the measures of time and communication resources required to solve a distributed reasoning problem  ... 
doi:10.1007/978-3-540-88808-6_6 fatcat:rjkymqth3fap7nv5g5dpjcbpg4

Formal Approaches to Modelling and Verifying Resource-bounded Agents-state of the Art and Future Prospects

Abdur Rakib
2012 Journal of Information Technology & Software Engineering  
Citation: Rakib A (2012) Formal Approaches to Modelling and Verifying Resourcebounded Agents─state of the Art and Future Prospects. J Inform Tech Softw Eng 2:e109.  ...  to reason about and verify tradeoffs between time, memory and communication in systems of distributed reasoning agents.  ...  In [21] Rakib and colleagues proposed an approach to modelling and verifying response time guarantees of ontology-driven multi-agent rule-based systems.  ... 
doi:10.4172/2165-7866.1000e109 fatcat:tgrwjtf5jvfphj3sl2sfvh3kpm

Secure Tracking using Trusted GNSS Receivers and Galileo Authentication Services

Oscar Pozzobon, Chris Wullems, Kurt Kubik
2004 Journal of Global Positioning Systems  
This paper concludes with a discussion of our existing tracking technology using a Siemens TC45 GSM/GPRS module and future development utilizing our previously proposed trusted GNSS receiver.  ...  First a number of limitations that affect the trust of critical tracking applications, even in presence of authenticated GNSS signals, are detailed.  ...  For some users this would result in cost reduction, as the policy cost can be estimated by vehicle usage as total kilometres, risks of travelled regions, average speed, time usage and time based risk.  ... 
doi:10.5081/jgps.3.1.200 fatcat:tplsg66kn5en5j6bo57j6wibbe

Lazy updates

Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei Wang, Wenjie Zhang
2009 Proceedings of the VLDB Endowment  
The extensive experiments demonstrate that our techniques outperform the existing techniques by an order of magnitude in terms of computation cost and communication cost.  ...  We also conduct a rigid cost analysis to guide an effective selection of such rectangular safe regions.  ...  First, we present a pruning rule based on six-regions approach and compute the communication cost. Then, we show that the pruning rules used in our technique are superior.  ... 
doi:10.14778/1687627.1687755 fatcat:jy5ri6tjzffcjbxcq3ywhfayrm

Blockchain-Aided Flow Insertion and Verification in Software Defined Networks

Jiejun Hu, Martin Reed, Mays Al-Naday, Nikolaos Thomos
2020 2020 Global Internet of Things Summit (GIoTS)  
Specifically, we propose a blockchain-as-a-service (BaaS) based framework that supports switch flow verification and insertion; and additionally provides straightforward deployment of blockchain technology  ...  rules in the switch that do not match network policies.  ...  Acknowledgment This work was carried out within the project SerIoT, funded by the European Union's Horizon 2020 Research and Innovation programme under grant agreement No 780139.  ... 
doi:10.1109/giots49054.2020.9119638 dblp:conf/giots/HuRAT20 fatcat:6h3tuqmdqrelroxseetfechtuu

Simulation-based Verification of SystemC-based VPs at the ESL [article]

Mehran Goli, Rolf Drechsler
2022 arXiv   pre-print
, i.e. functional and timing behavior of communications in the VP.  ...  In this paper, we introduce a comprehensive simulation-based verification approach to automatically validate the simulation behavior of a given SystemC-based VP against both the TLM-2.0 rules and its specifications  ...  Acknowledgment This work was supported in part by the German Federal Ministry of Education and Research (BMBF) within the project VerSys under contract no. 01IW19001 and by the University of Bremen's graduate  ... 
arXiv:2202.08046v1 fatcat:otf5nx66izespf25c3xmrakuue

Online Certification Status Verification with a Red-Black Hash Tree

Hiroaki Kikuchi, Kensuke Abe, Shohachiro Nakanishi
2006 IPSJ Digital Courier  
We also compare the estimated communication and computation cost reductions of the red-black hash tree to those of the conventional binary search tree.  ...  and computation costs.  ...  Our implementation, based on Java, ensures that the balancing based on the red-black tree properties reduces both communication and computation costs of the directory, i.e., the certificate status server  ... 
doi:10.2197/ipsjdc.2.513 fatcat:jaz54vdznfab7k2jlzpkb72nom

Remote attestation for low-end embedded devices

Ferdinand Brasser, Kasper B. Rasmussen, Ahmad-Reza Sadeghi, Gene Tsudik
2016 Proceedings of the 53rd Annual Design Automation Conference on - DAC '16  
Security of embedded devices is a timely and important issue, due to the proliferation of these devices into numerous and diverse settings, as well as their growing popularity as attack targets, especially  ...  To this end, this paper considers the issue of prover security, including: verifier impersonation, denial-of-service (DoS) and replay attacks, all of which result in unauthorized invocation of attestation  ...  For this reason, the system is started via secure boot, i.e., at boot time it verifies that correct software is loaded.  ... 
doi:10.1145/2897937.2898083 dblp:conf/dac/BrasserRST16 fatcat:zz4m2ies7vhq3lgghm56sn34dm

Addressing a secure session-key scheme for mobility supported e-Healthcare systems

Pardeep Kumar, Pawani Porambage, Mika Ylianttila, Andrei Gurtov, Hoon-Jae Lee, Mangal Sain
2014 16th International Conference on Advanced Communication Technology  
The proposed scheme not only establishes a session-key but according to HIPAA acts it also performs robust authenticity for the (mobile) medical sensor, the fixed access point, and the base-station.  ...  Our preliminary evaluation shows that the proposed scheme is feasible in-hospital, in-clinic, and homecare environments.  ...  Fifth and Sixth authors was funded by national research foundation of Korea (NRF) (no.: 2013-071188) and BB21 project of Busan metropolitan city.  ... 
doi:10.1109/icact.2014.6779018 fatcat:3z3iakc57nbhrja5h4tyqo5fue

Reducing Certificate Revocation Cost using NPKI [chapter]

Albert Levi, Cetin Kaya Koç
2001 IFIP Advances in Information and Communication Technology  
In this paper, we show how the recently proposed NPKI (Nested certificate based PKI) system reduces the number of revocation status controls to at most two.  ...  Problems with certificate revocation status control limit the deployment of Public Key Infrastructure (PKI). Classical certificate paths require revocation control of all certificates on the path.  ...  At time t2> t 1 , the public key of A is compromised and nc l is revoked. After t 2 , it is not possible to verify nc l using the cryptographic method and the public key of A.  ... 
doi:10.1007/0-306-46998-7_4 fatcat:j2yvljg5xzaytdvq3k5u34f2y4

Efficient and Secure Biometric-Based User Authenticated Key Agreement Scheme with Anonymity

Dongwoo Kang, Jaewook Jung, Hyoungshick Kim, Youngsook Lee, Dongho Won
2018 Security and Communication Networks  
First, the scheme cannot prevent two kinds of attacks, including off-line password guessing attacks and user impersonation attacks. Second, user anonymity rule cannot be upheld.  ...  Fourth, there is high possibility that the time synchronization trouble occurs.  ...  and the freshness conjuncatenation rule, we derive: (iii) S3: |≡ ♯( , 1 , ) Based on S2, S3 and the nonce verification rule, we derive: (iv) S4: |≡ |≡ ( , 1 , ) Based on A4, S4 and the jurisdiction rule  ... 
doi:10.1155/2018/9046064 fatcat:lgkcmn6lyba67k3cyna4z5xyqi

Sinkhole Attack Detection Scheme using Neighbors' Information for LEAP based Wireless Sensor Networks

Jae-jin Lee, Tae-ho Cho
2016 International Journal of Computer Applications  
Experimental results demonstrate the validity of the proposed approach in that it provides maintained safeguards and reduces communication cost.  ...  These compromised nodes can take control of the network traffic, eavesdrop on real communication, and forge reports that are then forwarded to the base-station.  ...  However, the PM communication cost is based on the location of the damaged node; therefore, communication does not require any communication to the base station due to the verification of Table 1 .  ... 
doi:10.5120/ijca2016908375 fatcat:d4lpnjrf3ffwrn275y436qqruy

Application of RFID and Mobile Technology to Plaster Board Waste in the Construction Industry [chapter]

Lizong Zhang, Anthony S., Hongnian Yu
2011 Designing and Deploying RFID Applications  
The reasoning system is designed using Rule-based Reasoning, and the structure of the knowledge base is illustrated in Figure 8 .  ...  Adopting of rule-based reasoning The rule-based system is usually called an expert system, and is the most popular choice for knowledge-based applications.  ...  Over the years, RFID research has resulted in many concrete achievements and also contributed to the creation of communities that bring scientists and engineers together with users.  ... 
doi:10.5772/16803 fatcat:egchpwusuffrplfxfyvv5qgrca
« Previous Showing results 1 — 15 out of 262,238 results