Filters








633,355 Hits in 6.3 sec

Algorithmic metatheorems for decidable LTL model checking over infinite systems [article]

Anthony Widjaja To, Leonid Libkin
2009 arXiv   pre-print
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific  ...  We prove various algorithmic metatheorems for the problems of model checking LTL and its two common fragments LTL(Fs,Gs) and LTLdet over the expressive class of word/tree automatic transition systems,  ...  One could similarly define the context-bounded LTL model checking problem for concurrent pushdown systems by restricting the executions of P to those with exactly k context-switches for any given k.  ... 
arXiv:0910.4932v2 fatcat:zpg4jzxyk5cwxabhjd7ubxipnq

Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems [chapter]

Anthony Widjaja To, Leonid Libkin
2010 Lecture Notes in Computer Science  
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific  ...  We prove various algorithmic metatheorems for the problems of model checking LTL and its two common fragments LTL(Fs, Gs) and LTL det over the expressive class of word/tree automatic transition systems  ...  One could similarly define the context-bounded LTL model checking problem for concurrent pushdown systems by restricting the executions of P to those with exactly k context-switches for any given k.  ... 
doi:10.1007/978-3-642-12032-9_16 fatcat:qeltq5zo3ndyjkhceyksple6se

Model checking object petri nets in prolog

Berndt Farwer, Michael Leuschel
2004 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '04  
Object Petri nets (OPNs) provide a natural and modular method for the modelling of many real-world systems.  ...  We also tackle infinite state model checking using the ecce system.  ...  Infinite State Model Checking using ecce One of the key issues of model checking of infinite systems is abstraction, whereby one approximates an infinite system by a finite one.  ... 
doi:10.1145/1013963.1013970 dblp:conf/ppdp/FarwerL04 fatcat:cu3femfirrfq5k5zlvj27fxiki

On Decidability of LTL Model Checking for Process Rewrite Systems [chapter]

Laura Bozzelli, Mojmír Křetínský, Vojtěch Řehák, Jan Strejček
2006 Lecture Notes in Computer Science  
On Decidability of LTL Model Checking for Process Rewrite Systems 249 during any computation.  ...  We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (wPRS), and properties  ...  Model Checking of wPRS Against Negated A This section is devoted to decidability of the model checking problem for wPRS and negated formulae of the A fragment.  ... 
doi:10.1007/11944836_24 fatcat:bcmi3ihs65b4zcy3pgt4dptf6y

On decidability of LTL model checking for process rewrite systems

Laura Bozzelli, Mojmír Křetínský, Vojtěch Řehák, Jan Strejček
2008 Acta Informatica  
On Decidability of LTL Model Checking for Process Rewrite Systems 249 during any computation.  ...  We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (wPRS), and properties  ...  Model Checking of wPRS Against Negated A This section is devoted to decidability of the model checking problem for wPRS and negated formulae of the A fragment.  ... 
doi:10.1007/s00236-008-0082-3 fatcat:kmgaunp5h5cq3ai7dpcbe3uaty

Verifying Systems of Resource-Bounded Agents [chapter]

Natasha Alechina, Brian Logan
2016 Lecture Notes in Computer Science  
We briefly survey previous work on the verification of multi-agent systems that takes resources into account, and outline some key challenges for future work.  ...  Approaches to the verification of multi-agent systems are typically based on games or transition systems defined in terms of states and actions.  ...  Nevertheless, the model-checking problem for RB±ATL is decidable (RB±ATL is very similar to one of the resource logics introduced in [13] for which the decidability of the model-checking problem was  ... 
doi:10.1007/978-3-319-40189-8_1 fatcat:ygwqpdauzrd35g37tqvxbwanfi

Model Checking a Modular-Structured Nonblocking Atomic Commitment Protocol for Asynchronous Distributed Systems

Eun-Hye Choi, Keishi Okamoto, Tatsuhiro Tsuchiya, Tohru Kikuno
2009 2009 Software Technologies for Future Dependable Distributed Systems  
Finally, the efficiency of our method is evaluated through the experimental results obtained from using two model checking tools, SPIN and SMV.  ...  In this paper, we focus on a modularstructured nonblocking atomic commitment (NBAC) protocol as a case study and propose a method to verify the protocol by model checking.  ...  Acknowledgment This work was supported by Grant-in-Aid from the Ministry of Education, Culture, Sports, Science and Technology of Japan (No. 18049055).  ... 
doi:10.1109/stfssd.2009.34 fatcat:spn3zszarjdz7nximb2w2rta4a

On Model-Checking of P Systems [chapter]

Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
2005 Lecture Notes in Computer Science  
Because of the nature of maximal parallelism inherent in the model, P systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently  ...  In this paper, we look at various models of P systems and investigate their model-checking problems.  ...  Clearly, since a P system is Turing complete in general, we have to focus on restricted P systems in order to make the model-checking decidable.  ... 
doi:10.1007/11560319_9 fatcat:7oczxs5cqjga5cv3ejpqf73etm

Model Checking Lossy Channels Systems Is Probably Decidable [chapter]

Nathalie Bertrand, Philippe Schnoebelen
2003 Lecture Notes in Computer Science  
We then investigate the verification of linear-time properties on this new model. Introduction Verification of channel systems.  ...  This idea led to the introduction of a Markov chain model for lossy channel systems [PN97] .  ...  Model checking NPLCS's Model checking for NPLCS's is trickier than model checking PLCS's, and the existence of the finite attractor does not always allow reducing to a decidable finite problem.  ... 
doi:10.1007/3-540-36576-1_8 fatcat:rb2bcsnxivexjorblakumhdhaa

Model-Checking Large Finite-State Systems and Beyond [chapter]

Luboš Brim, Mojmír Křetínský
2007 Lecture Notes in Computer Science  
The model checking problem for wPRS and LTL(F s , G s ) is decidable. This problem is EXPSPACE-hard due to EXPSPACE-hardness of the model checking problem for LTL(F, G) for PN [38] .  ...  We have presented some of the recent (un)decidability results on model-checking of infinite-state systems specified by Process Rewrite System mechanism (possibly extended with a weak finite-state control  ... 
doi:10.1007/978-3-540-69507-3_2 fatcat:mqlzrjadmzfazeuezzoyvtytue

Towards Hierarchical Probabilistic CTL Model Checking: Theoretical Foundations

Norihiro Kamide, Yuki Yano
2019 Proceedings of the 11th International Conference on Agents and Artificial Intelligence  
These embedding and relative decidability results allow us to reuse the standard pCTL-based probabilistic model checking algorithms to verify hierarchical randomized systems that can be described using  ...  Finally, the relative decidability of HpCTL with respect to pCTL is proved using this embedding theorem.  ...  ACKNOWLEDGEMENTS This research was supported by the Kayamori Foundation of Informational Science Advancement, JSPS KAKENHI Grant Numbers JP18K11171, JP16KK0007 and JSPS Core-to-Core Program (A.  ... 
doi:10.5220/0007456507620769 dblp:conf/icaart/KamideY19 fatcat:63hozhn52bfingemn6z5hwjrve

Model-checking dense-time Duration Calculus

Martin Fränzle
2004 Formal Aspects of Computing  
By analyzing two suitably sparser model classes we obtain model-checking procedures for rich subsets of Duration Calculus.  ...  Since the seminal work of Zhou Chaochen, M. R. Hansen, and P.  ...  Therefore, it makes sense to investigate decidability of the model property for Duration Calculus on suitably sparser model classes.  ... 
doi:10.1007/s00165-004-0032-y fatcat:es57mq2pcjhddklygaay4nhl3e

Verification of consensus algorithms using satisfiability solving

Tatsuhiro Tsuchiya, André Schiper
2010 Distributed computing  
The proposed approach allows us to model check several consensus algorithms up to around 10 processes. For any round r , its kernel is defined as the set of processes K (r ) = p∈ H O( p, r ).  ...  Our approach uses model checking, a widely practiced verification method based on state traversal.  ...  Acknowledgments The authors wish to thank Takahiro Minamikawa for providing us the SPIN model of LastVoting and the anonymous referees for their valuable comments. Tatsuhiro Tsuchiya  ... 
doi:10.1007/s00446-010-0123-3 fatcat:sbptb5a5b5dujn4hluqa3j7ggu

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.  ...  We will summarize important results on decidability, axiomatizability, expressiveness, model checking, etc. for each logic analysed.  ... 
arXiv:1005.3199v3 fatcat:nogsv2iggvd5likbkrnmnzpsdu

Trace consistency and inevitability [chapter]

R. Ramanujam
1996 Lecture Notes in Computer Science  
In this paper, we consider a closely related notion: a PTL formula is said to be inevitable, if for every system run, there is at least one equivalent run (that is, one interleaving of that run) which  ...  Two runs of a distributed system can be considered equivalent if they represent di erent interleavings of the same run.  ...  A similar argument can be used to show the decidability of weak model checking for coherent formulas, where the complexity is again linear in the size of the system being checked.  ... 
doi:10.1007/3-540-62034-6_54 fatcat:clua36ifgjahnkziluhkfy3f5y
« Previous Showing results 1 — 15 out of 633,355 results