A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Analyzing multi-agent systems with probabilistic model checking approach
2012
2012 34th International Conference on Software Engineering (ICSE)
Preserved Fulltext
In this work, we propose to apply probabilistic model checking to analyze multi-agent systems. ...
A modeling language called PMA is defined to specify such kind of systems, and LTL property and logic of knowledge combined with probabilistic requirements are supported to analyze system behaviors. ...
In this work, we propose a novel approach to analyze MAS with probabilistic model checking. ...
doi:10.1109/icse.2012.6227085
dblp:conf/icse/SongHLSLD12
fatcat:spyonyvy5vgtnens25mi6ax5wm
Automated parameter estimation for biological models using Bayesian statistical model checking
2015
BMC Bioinformatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Probabilistic models have gained widespread acceptance in the systems biology community as a useful way to represent complex biological systems. ...
Our algorithm uses Bayesian model checking, sequential hypothesis testing, and stochastic optimization to automatically synthesize parameters of probabilistic biological models. ...
NIH grants P41 GM103712 (CJL) and P50-GM-53789 (YV), from the National Institute on Disability Rehabilitation Research (NIDRR) under grant #H133E070024 (YV), and from the University of Central Florida with ...
doi:10.1186/1471-2105-16-s17-s8
pmid:26679759
pmcid:PMC4674867
fatcat:uzlhgb3idrcerfp6llayt7bu4i
Probabilistic Modeling of Lossless Compression using Improved RLC Algorithm
2021
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Probabilistic model checking is a very famous formal verification technique to calculate accuracy evaluation while it is very complex and time-consuming to achieve via simulations these days. ...
modeling, Communication, network, and multimedia protocols, security protocols, game theory, and many others but not applied in the domain of image compression techniques. ...
Furthermore, the stochastic two-player game (STPG) is used to validate the characteristics of multi-agent systems on various network topologies with cooperative and hostile agents. ...
doi:10.5120/ijca2021921838
fatcat:ovi3dwsfybbjlaho7ow2eocsta
Evaluating FTTT Protocol via PRISM, PRISM-symm and GRIP
2017
Journal of clean energy technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Probabilistic model checking is used for verifying stochastic behaviors of systems. ...
Modeling experiments confirmed that PRISM-symm is giving improved outcomes in comparison with PRISM and GRIP. Index Terms-CTMC model, FTTT protocol, model checking, PRISM, PRISM-symm, GRIP. ...
In addition stochastic two-player game (STPG) is used to verify properties of multi agent system on different network topologies in which agents split into cooperative and hostile classes. ...
doi:10.7763/ijcte.2017.v9.1131
fatcat:ivng5ldhvnc4nd2mrxkremtssq
Forthcoming Papers
2005
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our discussion is focused on two main methods for probabilistic revision: Jeffrey's rule of probability kinematics and Pearl's method of virtual evidence, where we analyze and unify these methods from ...
On the revision of probabilistic beliefs using uncertain evidence We revisit the problem of revising probabilistic beliefs using uncertain evidence, and report results on several major issues relating ...
Perlis, A logic-based model of intention formation and action for multi-agent subcontracting We present a formalism for representing the formation of intentions by agents engaged in cooperative activity ...
doi:10.1016/j.artint.2004.12.001
fatcat:msj5iuiqgzhtlmsunydxvwafvm
Parameter discovery for stochastic computational models in systems biology using Bayesian model checking
2014
2014 IEEE 4th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Parameterized probabilistic complex computational (P 2 C 2 ) models are being increasingly used in computational systems biology for analyzing biological systems. ...
Our approach uses Bayesian model checking, sequential hypothesis testing, and stochastic optimization to synthesize parameters of P 2 C 2 models. ...
In recent years, agent-based modeling has emerged as a popular method for the analyzing biological models [1] . ...
doi:10.1109/iccabs.2014.6863925
dblp:conf/iccabs/HussainLMDVJ14
fatcat:klj3qtidwnbfxaekrlllzdk7iq
Improved EGT-Based Robustness Analysis of Negotiation Strategies in Multiagent Systems via Model Checking
2016
IEEE Transactions on Human-Machine Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Automated negotiations play an important role in various domains modeled as multi-agent systems where agents represent human users and adopt different negotiation strategies. ...
Generally, given a multi-agent system, a negotiation strategy should be robust in the sense that most agents in the system have the incentive to choose it rather than other strategies. ...
CONCLUSION In this work, we proposed to improve the EGT analysis via model checking approach to analyze the robustness of negotiation strategies in a general multi-agent system. ...
doi:10.1109/thms.2015.2429573
fatcat:nf5plpzyxnerrcnvcfgqjvcxtu
Page 4870 of Mathematical Reviews Vol. , Issue 2004f
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “The complexity of multi-agent system behavior is stud- ied. ...
Behavior properties are formulated using classical temporal logic languages and are checked relative to the transition system induced by the multi-agent system definition. ...
A General Overview of Formal Languages for Individual-Based Modelling of Ecosystems
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Each modelling language offers a distinct view and techniques for analyzing systems. Most of the languages are based on process calculi or P systems. ...
We also discuss, briefly, other approaches such as P systems, cellular automata and Petri nets. ...
Process Algebra for Located Markovian Agents (PALOMA) [32] uses multi-class multi-message Markovian agents to model collective systems comprised of populations of agents which are spatially distributed ...
arXiv:1901.10820v1
fatcat:2x5nucj7frd5nlfkrp7sszhlf4
High Assurance for Distributed Cyber Physical Systems
2015
Proceedings of the 2015 European Conference on Software Architecture Workshops - ECSAW '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
• High assurance multi-agent
DART prototype integrating
deterministic and probabilistic
verification techniques. ...
Challenges:
• Importance Sampling with
Heterogenous Fault Regions
• Statistical Model Checking for
systems with non-determinism
Proactive Self-Adaptation
• Technique for a system to adapt
to ...
doi:10.1145/2797433.2797439
dblp:conf/ecsa/HissamCM15
fatcat:rsdc5rja4vgsban2gwxqrs7z7a
Formal Specification and Verification of Autonomous Robotic Systems: A Survey
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Autonomous robotic systems are complex, hybrid, and often safety-critical; this makes their formal specification and verification uniquely challenging. ...
Specially, it identifies and categorises the challenges posed by, the formalisms aimed at, and the formal approaches for the specification and verification of autonomous robotics. ...
The distributed Multi-Agent Reasoning System (dMARS) is an implementation of PRS with the BDI model operationalised by plans [59] . ...
arXiv:1807.00048v3
fatcat:ssc63easujgijisrznyzwo7ieq
Symbolic model checking of probabilistic knowledge
2011
Proceedings of hte 13th Conference on Theoretical Aspects of Rationality and Knowledge - TARK XIII
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper describes an algorithm for model checking a fragment of the logic of knowledge and probability in multi-agent systems, with respect to a perfect recall interpretation of knowledge and agents ...
Some experiments with the implemented algorithm are reported, in which some properties of agents' probabilistic knowledge are verified in two security protocols: Chaum's Dining Cryptographers protocol, ...
INTRODUCTION Model checking [7] is an approach to the verification of systems designs, in which one describes the system to be verified as a model of some logic, expresses the property to verified as ...
doi:10.1145/2000378.2000399
dblp:conf/tark/HuangLM11
fatcat:puz6sihvk5abhkcsfj2wolipcq
Refining the Undecidability Frontier of Hybrid Automata
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Algorithmic Algebraic Model Checking (AAMC) as a novel theoretical approach for studying the connections between Systems Biology, Hybrid Systems, Modal Logic, Computational Real Algebraic Geometry and ...
Developed the theoretical framework and algorithms for modeling biochemical pathways as semi-algebraic hybrid automata and analyzing their temporal properties using algebraic model checking Established ...
doi:10.1007/11590156_21
fatcat:7c57b3zny5bn5bgeesy2ck25w4
Analyzing ambient assisted living solutions: A research perspective
2017
2017 12th International Conference on Design & Technology of Integrated Systems In Nanoscale Era (DTIS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we discuss the challenges associated with analyzing complex AAL solutions, from relevant properties to semantic interoperability issues raised by employing various frameworks for modeling ...
REMES tool), security features (e.g., by employing SECube), and statistical model-checking techniques (e.g, via Plasma). ...
probabilistically in Plasma or UPPAAL SMC (Statistical Model Checker) [22] , and the probability of successful operation can be checked by hypothesis testing with Plasma for untimed models, and with ...
doi:10.1109/dtis.2017.7930168
dblp:conf/dtis/KunnappillyLMSS17
fatcat:gotapm6ezvdc3cbsiiiiujmwq4
Probabilistic Model Checking and Autonomy
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This method has recently been extended to multi-agent systems that exhibit competitive or cooperative behaviour modelled via stochastic games and synthesis of equilibria strategies. ...
Probabilistic model checking is a technique to automatically verify, for a given temporal logic specification, that a system model satisfies the specification, as well as to synthesise an optimal strategy ...
Probabilistic model checking provides a unified framework and a formal language to facilitate the construction of a wide range of single-and multi-agent autonomous system models that operate in uncertain ...
arXiv:2111.10630v1
fatcat:ckaniytpargkpcug52qvwgh3iy
« Previous
Showing results 1 — 15 out of 15,713 results