VerICS

swMATH2011MaRDI QIDQ14558FDOQ14558

Author name not available (Why is that?)

Official website: http://www.ipipan.waw.pl/~penczek/abmpw/verics-ang.htm

Cited In (45)

• Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
• Translation of timed Promela to timed automata with discrete data
• Parameterised verification for multi-agent systems
• A translator of Java programs to TADDs
• Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol
• Bounded model checking for knowledge and real time
• Automated Technology for Verification and Analysis
• Bounded Model Checking Real-Time Multi-agent Systems with Clock Differences: Theory and Implementation
• Title not available (Why is that?)
• Parametric model checking with VerICS
• SAT-based unbounded model checking of timed automata
• VERICS 2007 -- a model checker for knowledgee and real-time
• Partial order reductions for model checking temporal-epistemic logics over interleaved multi-agent systems
• A three-value abstraction technique for the verification of epistemic properties in multi-agent systems
• A Complete and Decidable Axiomatisation for Deontic Interpreted Systems
• Automatic verification of temporal-epistemic properties of cryptographic protocols
• AgentSpeak
• Casper
• simpleAPL
• MCMAS
• MCK
• Verics
• MOCHA
• 3APL
• jMocha
• MCMAS-SLK
• KBPs
• DEMO
• SMCDEL
• To know or not to know: Epistemic approaches to security protocol verification
• Timed automata based model checking of timed security protocols
• Slicing of timed automata with discrete data
• Strategic reasoning with a bounded number of resources: the quest for tractability
• Specification and Verification of Multi-Agent Systems
• Title not available (Why is that?)
• Verification of multi-agent systems with public actions against strategy logic
• Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic
• SAT-based (parametric) reachability for a class of distributed time Petri nets
• A data symmetry reduction technique for temporal-epistemic logic
• Verification of the TESLA protocol in MCMAS-X
• Verified synthesis of knowledge-based programs in finite synchronous environments
• Practical verification of multi-agent systems against \textsc{Slk} specifications
• A first-order coalition logic for BDI-agents
• Automatic data-abstraction in model checking multi-agent systems
• Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems

This page was built for software: VerICS