Filters








26,177 Hits in 7.5 sec

Model checking for Process Rewrite Systems and a class of action--based regular properties [article]

Laura Bozzelli
2004 arXiv   pre-print
We consider the model checking problem for Process Rewrite Systems (PRSs), an infinite-state formalism (non Turing-powerful) which subsumes many common models such as Pushdown Processes and Petri Nets.  ...  The model-checking problem for PRSs and action-based linear temporal logic (ALTL) is undecidable. However, decidability for some interesting fragment of ALTL remains an open question.  ...  A Process Rewrite System (or PRS, or Rewrite System) over a finite alphabet of atomic actions Σ and the set of process variables V ar is a finite set of rewrite rules ℜ ⊆ T × Σ × T of the form t a → t  ... 
arXiv:cs/0405003v1 fatcat:x5yu2u7d7zbozeg6grptfavez4

Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties [chapter]

Laura Bozzelli
2005 Lecture Notes in Computer Science  
We consider the model checking problem for Process Rewrite Systems (PRS), an infinite-state formalism (non Turing-powerful) which subsumes many common models such as Pushdown Processes and Petri Nets.  ...  The model-checking problem of PRS against action-based linear temporal logic (ALTL) is undecidable. However, decidability for some interesting fragment of ALTL remains an open question.  ...  Acknowledgments I thank Aldo De Luca, Salvatore La Torre, Margherita Napoli, and Adriano Peron for very helpful discussions.  ... 
doi:10.1007/978-3-540-30579-8_19 fatcat:ym3k6zify5hcphufitfpjdjqgu

Model checking for process rewrite systems and a class of action-based regular properties

Laura Bozzelli
2006 Theoretical Computer Science  
We consider the model checking problem for Process Rewrite Systems (PRS), an infinite-state formalism (non Turing-powerful) which subsumes many common models such as Pushdown Processes and Petri Nets.  ...  The model-checking problem of PRS against action-based linear temporal logic (ALTL) is undecidable. However, decidability for some interesting fragment of ALTL remains an open question.  ...  Acknowledgments I thank Aldo De Luca, Salvatore La Torre, Margherita Napoli, and Adriano Peron for very helpful discussions.  ... 
doi:10.1016/j.tcs.2006.05.003 fatcat:xutiox5dkzdrpf4yp7t6nhafie

Languages, Rewriting Systems, and Verification of Infinite-State Systems [chapter]

Ahmed Bouajjani
2001 Lecture Notes in Computer Science  
Papers such as KMM + 97,WB98,BJNT00,PS00] introduce a uniform verication paradigm for in nite-state systems, called regular model-checking, based on the use of regular languages ( nite automata or WS1S  ...  In Section 3 we de ne classes of rewriting systems and show their use as models for various kinds of in nite-state systems.  ... 
doi:10.1007/3-540-48224-5_3 fatcat:ncoisj7wtbgabpjwswi2a4zef4

Permutation rewriting and algorithmic verification

Ahmed Bouajjani, Anca Muscholl, Tayssir Touili
2007 Information and Computation  
Our result can be applied for example to regular model checking, for verifying properties of parametrized linear networks of regular processes, and for modeling and verifying properties of asynchronous  ...  We propose a natural subclass of regular languages (Alphabetic Pattern Constraints, APC) which is effectively closed under permutation rewriting, i.e., under iterative application of rules of the form  ...  In the context of regular model checking [6, 15, 26] , a set of configurations is represented as a regular language and the actions of a system are modeled as a rewriting system R.  ... 
doi:10.1016/j.ic.2005.11.007 fatcat:x5ka47doebc2xo6rp4aldeh4h4

Verification of Infinite State Systems [chapter]

Ahmed Bouajjani
2003 Lecture Notes in Computer Science  
calculi (model checking problems).  ...  Both process algebras (or term rewriting systems) and automata (or finite control machines) are being used as specification formalisms.  ...  s by performing as many actions a as actions b for s in a regular set of initial states and t belonging to a regular set of final states).  ... 
doi:10.1007/978-3-540-45220-1_7 fatcat:4j5lzdbfc5hd7ptdo4tpwvmd2m

Extrapolating Tree Transformations [chapter]

Ahmed Bouajjani, Tayssir Touili
2002 Lecture Notes in Computer Science  
We consider the framework of regular tree model checking where sets of configurations of a system are represented by regular tree languages and its dynamics is modeled by a term rewriting system (or a  ...  We prove that our widening technique can emulate many existing algorithms for special classes of transformations and we show that it can deal with transformations beyond the scope of these algorithms.  ...  First, we consider the case of parametrized networks. We consider a particular class of models based on term rewriting systems called Well-Oriented Systems.  ... 
doi:10.1007/3-540-45657-0_46 fatcat:2rfnv3qlpzginbulu55alu76jq

A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting

Kyungmin Bae, José Meseguer
2012 Electronical Notes in Theoretical Computer Science  
Furthermore, the semantics of TLR * is given in terms of rewrite theories, so that the concurrent systems on which the LTLR properties are model checked can be specified at a very high level with rewrite  ...  This paper presents a model checker for LTLR, a subset of the temporal logic of rewriting TLR * extending linear temporal logic with spatial action patterns.  ...  The frequent need for "cooking" both the system and the property in both state-based and action-based tandems is then due to a lack of expressiveness in both cases.  ... 
doi:10.1016/j.entcs.2012.11.009 fatcat:3d3etxo2evdu7jcjjsakvuksy4

ROADMAP OF INFINITE RESULTS [chapter]

JIŘÍ SRBA
2004 Current Trends in Theoretical Computer Science  
This paper provides a comprehensive summary of equivalence checking results for infinite-state systems.  ...  The most recent version of this document is available from the web-page  ...  I would like to thank IvanaČerná, Petr Jančar, Antonín Kučera, Mogens Nielsen and Paulo Borges Oliva for reading a draft of this paper.  ... 
doi:10.1142/9789812562494_0054 fatcat:n7gd7hufhjhgvjrszmclz7vedy

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  
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  ...  On Decidability of LTL Model Checking for Process Rewrite Systems 249 during any computation.  ...  So far, only two positive results on LTL model checking of PA (and classes subsuming PA) have been published: decidability of model checking of infinite runs for PRS and LTL fragment of fairness properties  ... 
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  
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  ...  On Decidability of LTL Model Checking for Process Rewrite Systems 249 during any computation.  ...  So far, only two positive results on LTL model checking of PA (and classes subsuming PA) have been published: decidability of model checking of infinite runs for PRS and LTL fragment of fairness properties  ... 
doi:10.1007/s00236-008-0082-3 fatcat:kmgaunp5h5cq3ai7dpcbe3uaty

PDL over Accelerated Labeled Transition Systems

Taolue Chen, Jaco van de Pol, Yanjing Wang
2008 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering  
We study the model checking and satisfiability decision problems.  ...  We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition systems labeled with regular  ...  Regular Expression Rewriting The notion of regular expression rewriting is introduced in [3] , and turns out to play an essential role in solving model checking and satisfiability checking problems.  ... 
doi:10.1109/tase.2008.42 dblp:conf/tase/ChenPW08 fatcat:gahnvwgqrraqxdvgcjzifsnd2e

Some Perspectives of Infinite-State Verification [chapter]

Wolfgang Thomas
2005 Lecture Notes in Computer Science  
We report on recent progress in the study of infinite transition systems for which interesting properties (like reachability of designated states) can be checked algorithmically.  ...  Two methods for the generation of such models are discussed: the construction from simpler models via operations like unfolding and synchronized product, and the internal representation of state spaces  ...  The purpose of the present short survey is to report on some techniques which yield classes of infinite models such that the model-checking problem is decidable for interesting properties.  ... 
doi:10.1007/11562948_3 fatcat:z6i5hzxbvndrvj3rq52gqym5ju

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

Luboš Brim, Mojmír Křetínský
2007 Lecture Notes in Computer Science  
Here we employ the classes of infinite-state systems defined by term rewrite systems and called Process Rewrite Systems (PRS, [55] ).  ...  In the second part we employ the classes of infinite-state systems defined by term rewrite systems and called Process Rewrite Systems (PRS) as introduced by Mayr.  ... 
doi:10.1007/978-3-540-69507-3_2 fatcat:mqlzrjadmzfazeuezzoyvtytue

Algorithmic Improvements in Regular Model Checking [chapter]

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso
2003 Lecture Notes in Computer Science  
Regular model checking is a form of symbolic model checking for parameterized and infinite-state systems, whose states can be represented as finite strings of arbitrary length over a finite alphabet, in  ...  We also present a simplified theoretical framework for showing soundness of the optimization, which is based on commuting simulations.  ...  Introduction Regular model checking has been proposed as a uniform paradigm for algorithmic verification of parameterized and infinite-state systems [KMM + 01, WB98, BJNT00] .  ... 
doi:10.1007/978-3-540-45069-6_25 fatcat:ahn7qojisrdv5jfefgbbzlmkie
« Previous Showing results 1 — 15 out of 26,177 results