Share This Author
Verifying epistemic properties of multi-agent systems via bounded model checking
A framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking is presented, which uses interpreted systems as underlying semantics.
Bounded Model Checking for the Universal Fragment of CTL
The concept of bounded model checking can be extended to ACTL (the universal fragment of CTL) and the implementation of the algorithm for Elementary Net Systems is described together with the experimental results.
A partial order approach to branching time logic model checking
- R. Gerth, R. Kuiper, D. Peled, W. Penczek
- Computer ScienceProceedings Third Israel Symposium on the Theory…
- 4 January 1995
The paper shows, for the first time, how this approach can be applied to languages that model the behavior of a program as a tree, e.g., the logics CTL and CTL* and process algebras such as CCS.
Model-checking of causality properties
- R. Alur, D. Peled, W. Penczek
- Computer ScienceProceedings of Tenth Annual IEEE Symposium on…
- 26 June 1995
The main result of the paper is a tableau construction that gives a singly-exponential translation from a T/sub LC/ formula /spl psi/ to a Streett automaton that accepts the set of linearizations satisfying / spl psi/.
Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata
The paper surveys some of the most recent approaches to verification of properties, expressible in some timed and untimed temporal logics, for real-time systems represented by time Petri nets (TPN’s), and focuses on bounded model checking for TCTL and for reachability properties.
VerICS 2004: A Model Checker for Real Time and Multi-agent Systems ?
The current version of VerICS uses also a new graphical user interface to design time Petri nets and timed automata, and Splitting for properties to be specied in subsets of TCTL and CTLpK.
Model checking for multivalued logic of knowledge and time
It is shown that the general method of translation from multivalued to two-valued De Morgan algebras can be extended to mv μK-calculus model checking, and can be reduced to several instances of the model checking problem for three-valued μK -calculus.
VerICS 2007 - a Model Checker for Knowledge and Real-Time
New features of the VerICS verifier include SAT-based model checking for multi-agent systems and several extensions and improvements to real-time systems' verification.
Propositional Temporal Logics and Equivalences
Comparing propositional temporal logics is compared by comparing the equivalences that they induce on models and which of the induced equivalences are and which are not preserved under action refinement.
Temporal Logics for Trace Systems: On Automated Verification
- W. Penczek
- Computer ScienceInt. J. Found. Comput. Sci.
- 1 March 1993
This work investigates an extension of CTL by past modalities, called CTLP, interpreted over Mazurkiewicz's trace systems, and shows that all the interesting partial order properties can be model checked using the model checking algorithm.