Filters








294,249 Hits in 3.4 sec

Model Checking Knowledge and Linear Time: PSPACE Cases [chapter]

Kai Engelhardt, Peter Gammie, Ron van der Meyden
2007 Lecture Notes in Computer Science  
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way that agents update their  ...  We show that the scheme leads to PSPACE implementations of model checking the logic of knowledge and linear time in several special cases: perfect recall systems with a single agent or in which all communication  ...  In the following sections, we apply Theorem 11 to obtain complexity bounds for model checking the logic of knowledge and linear time in a number of cases.  ... 
doi:10.1007/978-3-540-72734-7_14 fatcat:pxlyusiabrertp76djzqlkr7ii

Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches [chapter]

Didier Lime, Olivier H. Roux, Charlotte Seidner, Louis-Marie Traonouez
2009 Lecture Notes in Computer Science  
Indeed, Romeo now features an efficient model-checking of time Petri nets using the Uppaal DBM Library, the model-checking of stopwatch Petri nets and parametric stopwatch Petri nets using the Parma Polyhedra  ...  Moreover, it is the first tool that performs TCTL model-checking on timed parametric models.  ...  This is, to our knowledge, the first TCTL model-checker for (bounded) time Petri nets but also the first one for stopwatch models.  ... 
doi:10.1007/978-3-642-00768-2_6 fatcat:pauyi4ge4beoxkrifvivrqcp6a

Real-time and Probabilistic Temporal Logics: An Overview [article]

Savas Konur
2011 arXiv   pre-print
We extrapolate the notions of decidability, axiomatizability, expressiveness, model checking, etc. for each logic analysed. We also provide a comparison of features of the temporal logics discussed.  ...  Over the last two decades, there has been an extensive study on logical formalisms for specifying and verifying real-time systems.  ...  The model checking problem is decidable "for a class of SPDC formulas of the form linear duration invariants, or a formula for bounded liveness" [55] .  ... 
arXiv:1005.3200v3 fatcat:xhrrcy26bzeehg7wqvjfikm26e

TASS: Timing Analyzer of Scenario-Based Specifications [chapter]

Minxue Pan, Lei Bu, Xuandong Li
2009 Lecture Notes in Computer Science  
TASS accepts UML2.0 interaction models with general and expressive timing constraints and can be used for three kinds of timing analysis problems: the reachability analysis, the constraint conformance  ...  analysis, and the bounded delay analysis.  ...  The bounded timing analyzer gets its name for utilizing the bounded model checking [11] techniques. TASS is composed of three timing analyzers.  ... 
doi:10.1007/978-3-642-02658-4_56 fatcat:xwgriww7yjflfn4rlrp6yfagku

Automatic Verification of Hybrid Systems with Large Discrete State Space [chapter]

Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, Boris Wirtz
2006 Lecture Notes in Computer Science  
These techniques are integrated within a model checker for universal CTL. Technically, it deals with discrete-time hybrid systems with linear differentials.  ...  These include implication checks for simple constraints, test vector generation for fast inequality checks of boolean combinations of constraints, and an exact subsumption check for representations of  ...  HySAT [9] is a bounded model checker for linear hybrid systems.  ... 
doi:10.1007/11901914_22 fatcat:3ke6rvnscjalvc7xvc3uoeqalm

Evaluating Model Checking Approaches to Verify Stability of Control Systems in Simulink [article]

Dejanira Araiza-Illan, Kerstin Eder
2015 arXiv   pre-print
Our study included symbolic, bounded, statistical and hybrid model checking, through the open-source tools NuSMV, UCLID, S-TaLiRo and SpaceEx, respectively.  ...  Our experiments and results provide an insight on the strengths and limitations of these model checking approaches for the verification of control requirements for discrete systems at Simulink level.  ...  We explored four model checking variants through related tools, symbolic, bounded, statistical and hybrid, verifying stability based on Lyapunov methods for discrete linear and nonlinear systems.  ... 
arXiv:1511.00412v1 fatcat:pfg7ukug3zao7gnkt3jdujt2sy

Succinct Non-interactive Arguments via Linear Interactive Proofs [chapter]

Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Omer Paneth, Rafail Ostrovsky
2013 Lecture Notes in Computer Science  
More concretely, in this work we focus on linear (or affine) provers, and provide several constructions of (succinct two-message) linear-interactive proofs (LIPs) for NP.  ...  Our contribution is three-fold: (1) We introduce and study a natural extension of the interactive proof model that considers algebraically-bounded provers; this new setting is analogous to the common study  ...  Another aspect, which is the focus of this work, is that proofs for NP statements can potentially be much shorter than an NP witness and be verified much faster than the time required for checking the  ... 
doi:10.1007/978-3-642-36594-2_18 fatcat:jdnygt3cszazpaubzom77wdyku

Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics [chapter]

Roland Axelsson, Martin Lange
2011 Lecture Notes in Computer Science  
the model checking problem for Propositional Dynamic Logic over some class of formal languages.  ...  This allows several decidability and complexity results to be transferred, mainly from the area of formal languages to the areas of modal logics and formal language constrained reachability.  ...  In fact, it is decidable in linear time which then yields quadratic-time decidability of the model checking problem for PDL [REG] .  ... 
doi:10.1007/978-3-642-24288-5_6 fatcat:7yt52h34bnaprhtbfnr2jy3ag4

Bounded LTL Model Checking with Stable Models [chapter]

Keijo Heljanko, Ilkka Niemelä
2001 Lecture Notes in Computer Science  
The use of the stable model semantics leads to compact encodings of bounded reachability and deadlock detection tasks as well as the more general problem of bounded model checking of linear temporal logic  ...  In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming.  ...  Until now bounded model checking has been applied to synchronous hardware verification and little attention has been given to knowledge representation issues such as developing concise and efficient logical  ... 
doi:10.1007/3-540-45402-0_15 fatcat:kl3sbhtflfcx5koj5vcut6syhi

Bounded LTL model checking with stable models

KEIJO HELJANKO, ILKKA NIEMELÄ
2003 Theory and Practice of Logic Programming  
The use of the stable model semantics leads to compact encodings of bounded reachability and deadlock detection tasks as well as the more general problem of bounded model checking of linear temporal logic  ...  In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming.  ...  Until now bounded model checking has been applied to synchronous hardware verification and little attention has been given to knowledge representation issues such as developing concise and efficient logical  ... 
doi:10.1017/s1471068403001790 fatcat:urpk7dnaazc3lmicp4grjn73cq

Integrating Deep Biomedical Models into Medical Decision Support Systems: An Interval Constraint Approach [chapter]

Jorge Cruz, Pedro Barahona, Frédéric Benhamou
1999 Lecture Notes in Computer Science  
In this paper we explore constraint solving over intervals, a recently proposed technology to handle non-linear numerical models, and its use in neurology.  ...  Finally, section 6 presents the major conclusions and discusses our plans for future work.  ...  Simulation In simulation, the goal is to obtain narrow bounds for Latency and Amplitude, by constraint propagation on the knowledge model of the disorder parameters (Local, Severity and Time).  ... 
doi:10.1007/3-540-48720-4_20 fatcat:q2sq7g5vrbhivddrzjgluqlr5m

Probabilistic verification and approximation

Richard Lassaigne, Sylvain Peyronnet
2008 Annals of Pure and Applied Logic  
Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas.  ...  We prove that, in general, there is no polynomial time randomized approximation scheme with relative error for probabilistic verification.  ...  Acknowledgements We would like to thank Thomas Hérault for his important participation to the development of APMC, and an anonymous referee for his pertinent remarks and suggestions.  ... 
doi:10.1016/j.apal.2007.11.006 fatcat:kjhhgvh6prglxehlpepy42afju

Probabilistic Verification and Approximation

Richard Lassaigne, Sylvain Peyronnet
2006 Electronical Notes in Theoretical Computer Science  
Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas.  ...  We prove that, in general, there is no polynomial time randomized approximation scheme with relative error for probabilistic verification.  ...  Acknowledgements We would like to thank Thomas Hérault for his important participation to the development of APMC, and an anonymous referee for his pertinent remarks and suggestions.  ... 
doi:10.1016/j.entcs.2005.05.031 fatcat:usjmmp4kjzdrnoztoxpskrguka

A Survey on Temporal Logics [article]

Savas Konur
2011 arXiv   pre-print
This paper surveys main and recent studies on temporal logics in a broad sense by presenting various logic systems, dealing with various time structures, and discussing important features, such as decidability  ...  (or undecidability) results, expressiveness and proof systems.  ...  In [91] partial-order reduction techniques are applied to linear and branching time temporal logics for knowledge (without the next operator) to reduce the model size before applying model checking procedure  ... 
arXiv:1005.3199v3 fatcat:nogsv2iggvd5likbkrnmnzpsdu

Asymptotic Efficiency in Dynamic Principal-Agent Problems

Holger M. Müller
2000 Journal of Economic Theory  
It is shown that no matter how"close" discrete time is to continuous time, the first-best solution can be approximated arbitrarily closely with a random spot check and a suitably chosen sequence of step  ...  This paper considers a variant of the Brownian model in which control revisions take place in discrete time.  ...  Like linear sharing rules, random spot checks provide the agent with constant incentives over time.  ... 
doi:10.1006/jeth.1999.2623 fatcat:ety7dk4vzjcnjfwttiuewcmjjq
« Previous Showing results 1 — 15 out of 294,249 results