Modal Process Rewrite Systems
نویسندگان
چکیده
We consider modal transition systems with infinite state space generated by finite sets of rules. In particular, we extend process rewrite systems to the modal setting and investigate decidability of the modal refinement relation between systems from various subclasses. Since already simulation is undecidable for most of the cases, we focus on the case where either the refined or the refining process is finite. Namely, we show decidability for pushdown automata extending the non-modal case and surprising undecidability for basic parallel processes. Further, we prove decidability when both systems are visibly pushdown automata. For the decidable cases, we also provide complexities. Finally, we discuss a notion of bisimulation over MTS.
منابع مشابه
Rewrite Rule Systems for Modal Propositional Logic
D This paper explains new results relating modal propositional logic and rewrite rule systems. More precisely, we give complete term rewriting systems for the modal propositional systems known as K, Q, T, and S5. These systems are presented as extensions of Hsiang’s system for classical propositional calculus. We have checked local confluence with the rewrite rule system K.B. (cf. the Knuth-Ben...
متن کاملProving Modal Properties of Rewrite Theories Using Maude's Metalevel
Rewriting logic is a very expressive formalism for the specification of concurrent and distributed systems; more generally, it is a logic of change. In contrast, VLRL is a modal logic built on top of rewriting logic to reason precisely about that change. Here we present a technique to mechanically prove VLRL properties of rewrite theories using the reflective capability of rewriting logic throu...
متن کاملConfluent Term Rewriting for Only-knowing Logics
Combining term rewriting and modal logics, this paper addresses confluence and termination of rewrite systems introduced for only-knowing logics. The rewrite systems contain a rule scheme that gives rise to an infinite number of critical pairs, hence we cannot check the joinability of every critical pair directly, in order to establish local confluence. We investigate conditions that are suffic...
متن کاملModal Kleene Algebra and Applications — A Survey —
Modal Kleene algebras are Kleene algebras with forward and backward modal operators, defined via domain and codomain operations. They provide a concise and convenient algebraic framework that subsumes various popular calculi and allows treating quite a number of areas. We survey the basic theory and some prominent applications. These include, on the system semantics side, wlp and wp calculus, P...
متن کاملTowards Coalgebraic Specification of Rewriting Theories
We describe a coalgebraic perspective on models of rewriting logic theories. After establishing a soundness and completeness result, we show how one can use modal logics for coalgebras to reason about the rewrite process. The approach is semantics-driven in the sense that the logic we propose is tailored to the class of models we consider.
متن کامل