O. Burkart and B. Steen. Pushdown processes: Parallel composition and model checking. In CONCUR'94, volume 836 of LNCS, pages 98-113. Springer Verlag, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....to our work is the modular model checking approach by Yorav and Grumberg. In fact, the basic idea of the assumption function as defined here has been developed in their work. Another approach that utilises a decomposition of the system into parts (modules, fragments) is that by Burkart and Steffen [SB94]. They present a model checking algorithm for pushdown processes and consider the semantics of fragments which are interpreted as incomplete portions of the process. Another work where assumption functions have been considered is the model checking algorithm for the logic EF and CTL and ....

B. Steffen and O. Burkart. Pushdown processes: Parallel composition and model checking. In CONCUR'94, volume 836 of Lecture Notes in Computer Science (LNCS), pages 98--113, Heidelberg, Germany, August 1994. Springer-Verlag.

....to our work is the modular model checking approach by Yorav and Grumberg. In fact, the basic idea of the assumption function as defined here has been developed in their work. An other approach that utilises a decomposition of the system into parts (modules, fragments) is that by Burkart and Ste#en [12]. They present a model checking algorithm for pushdown processes and consider the semantics of fragments which are interpreted as incomplete portions of the process. Another work where assumption functions have been considered is the model checking algorithm for the logic EF and CTL and ....

Ste#en, B. and O. Burkart, Pushdown processes: Parallel composition and model checking, in: CONCUR'94, LNCS 836 (1994), pp. 98--113.

....be implemented as, for example, a regular or pushdown process. The decidability of the model checking for pushdown processes and the propositional calculus follows from [17] An elementary model checking procedure for pushdown processes and alternation free fragment of the calculus was given in [3]. We are not aware of any such elementary decision procedure for the whole calculus. The decidability result mentioned above as well as extensions of it (for example [8, 22] deal with monadic second order logic and reduce the problem to the decidability of S2S formulas, hence give nonelementary ....

O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In CONCUR '94, volume 836 of LNCS, 1994.

....result as well as extensions of it (for example [7] deal with monadic second order logic and reduce the problem to the decidability of S2S, hence give nonelementary algorithms. An elementary model checking procedure for pushdown processes and alternation free fragment of the calculus was given in [3]. Independently from the present work, Sebastian Seibert [22] has shown that in every pushdown game there exist (for the player who wins) a winning 2 strategy realizable by a pushdown automaton and that this strategy can be computed e#ectively. Pushdown processes are a strict generalization of ....

O. Burkart and B. Ste#en. Pushdown processes: Parallel composition and model checking. In CONCUR '94, volume 836 of LNCS, 1994.

.... processes from so called basic process algebra BPA (see [5] for a short survey) The decidability of the model checking for pushdown processes and the propositional calculus follows from [14] An elementary model checking procedure for the alternation free fragment of the calculus was given in [3]. We are not aware of any such elementary decision procedure for the whole calculus. BPA is a subclass of process algebra (PA) 1] For the other interesting subclass of PA, namely, basic parallel processes, the model checking problem is undecidable [9] The question whether pushdown games have ....

O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In CONCUR '94, volume 836 of LNCS, 1994.

....be decomposed into nontrivial components) We design special normal forms 1 for normed BPA processes which allow us to characterize all non prime normed BPA processes together with their decompositions up to bisimilarity. As a consequence we also obtain a refinement of the result achieved in [BS94] Next we show that any normed BPA process can be decomposed into a parallel product of primes effectively. We also prove several related decidability results. Finally, we prove that bisimilarity is decidable in a large subclass of normed PA processes (see [BW90] which consists of processes of ....

....characterization of non prime nBPA processes. We design special normal forms which allow us to characterize all non prime nBPA processes together with their decompositions (up to bisimilarity) Our results bring also interesting consequences we obtain a refinement of the result achieved in [BS94] see Remark 6) and we also show that any nBPA process can be decomposed into prime processes effectively. Further positive decidability results are discussed in the end of the second subsection. Finally, we also prove that bisimilarity is decidable in a natural subclass of normed PA processes. ....

[Article contains additional citation context not shown here]

O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In Proceedings of CONCUR 94, volume 836 of LNCS, pages 98--113. Springer-Verlag, 1994.

....in [34] that the model checking problem remains DEXPTIME hard for the alternation free mu calculus; even more, the problem needs exponential time in the size of the system. The model checking problem for the alternation free fragment has also been studied by Olaf Burkhard and Bernhard Steffen in [11], where they present a global model checking algorithm. The algorithm is an extension of a similar algorithm for BPA processes, which is discussed in the next section. Ahmed Bouajjani and Oded Maler present at INFINITY 96 a very elegant modelchecking algorithm for pushdown processes and CTL [7] ....

O. Burkart and B. Steffen (1994). Pushdown Processes: Parallel composition and model-checking. Proceedings of CONCUR'94. Lecture Notes in Computer Science 836:98--113.

....Example 1. Caucal [4] showed that with respect to bisimilarity pushdown automata are more expressive than context free grammars. Example 1 is an illustrative instance: there is not a context free grammar with root configuration C such that C # pZ. Burkart and Ste#en provide additional insight [3] by showing that, unlike context free grammars, pushdown automata are closed under Hoare parallel composition with finite state processes (with respect to bisimilarity) Moreover they demonstrate that the family of pushdown automata is the smallest extension of context free grammars with this ....

Burkart, O., and Ste#en, B. (1994). Pushdown processes: parallel composition and model checking. Lecture Notes in Computer Science, 836, 98-113.

....Context free processes 1 are a subset of rooted context free graphs. Burkart and Steffen were the first to give a decision procedure for the alternation free mu calculus in a relevant subset of the context free processes [BS92] and extended it to the full set of guarded context free processes in [BS94]. Both generalizations of the structure set and the logic were considered, and local as well as iterative (global) model checkers were developed. One may use a higher order version generation process for structures and decide the alternation free mu calculus [Hun94] or add 1 The use of the term ....

....(Q Delta D) This process denotes a Kripke structure with one initial state labeled by B, which has successors A n Delta D for each n. Furthermore, besides infinite branching, permitting variables with more than one argument of type offers the possibility to define the pushdown processes of [BS94]. This is most easily seen by resorting to the characterization of pushdown processes as being those structures which result from parallel composition of a finite process and a context free one (in the sense of [BS92] In fact, a simple proof shows that on each type level, macro processes are ....

Olaf Burkart and Bernhard Steffen, Pushdown processes: Parallel composition and model checking, 5th Int. Conf. on Concurrency Theory (B. Jonsson and J. Parrow, eds.), LNCS 836, Springer, 1994, pp. 98--113.

.... in the case of CCS, for example, terms where a process variable x occurs in a parallel composition belonging to the definition of x are not handled [22] We are interested here to deal with non finite state systems; approaches have been proposed to this aim, which are not based on LTS s [1, 4, 14, 15, 16]; we consider instead LTS based verification. The idea is to use, for proving a logical property, a sequence of finite state LTSs approximating the, possibly infinite state, LTS corresponding to a term by the standard CCS semantics. In this paper we present a verification methodology to check ....

O. Burkart, B. Steffen. Pushdown processes: Parallel Composition and Model Checking. Proceedings, CONCUR 94, LNCS 836, 1994, pp.98-113.

....composition in the right hand sides. Then we get context free processes (BPA) Esp97, Esp96] c) If all rules are of the form X 1 :X 2 : X i a Y 1 :Y 2 : Y k (sequential composition is also allowed on the left hand sides) then the model is as expressive as pushdown processes [BS94]. 2. a) If the rules are of the form X 1 kX 2 k : kX i a Y 1 kY 2 k : kY k , arbitrary parallel composition on both sides, but no sequential composition) then we get Petri nets. Every variable corresponds to a place in the net and the number of occurrences of a variable in a term ....

O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In CONCUR'94, number 836 in LNCS, pages 98--113. Springer Verlag, 1994.

....x occurs as operand of a parallel composition belonging to the expansion of x Work partially supported by BRA 8130 Lomaps project; Progetto Speciale ANATRA of CNR are not handled. Although approaches have been proposed to deal with non finite state systems, which are not based on LTS s [2, 6, 22, 23, 24], here we are interested in LTS based environments. Relevant properties of reactive systems can be expressed by using an action based logic, for example ACTL [16] In fact, ACTL is sufficiently powerful to express liveness and safety properties without introducing the overhead of formulae with ....

O. Burkart, B. Steffen. Pushdown processes: Parallel Composition and Model Checking. Proceedings, CONCUR 94, LNCS 836, 1994, pp.98-113.

....in any way. Works discussing model checking of programs written in a high level language are rare. The closest to our work is [11] that verifies concurrent systems written in C. However, their approach is not modular. Moreover, they do not handle a full temporal logic. Another related work is [5], in which they perform model checking on Pushdown Process Systems by considering the semantics of fragments , which are interpreted as incomplete portions of the process. The model checking algorithm they propose calculates the property transformer of each fragment, which is a function that ....

Olaf Burkart and Bernhard Steffen. Pushdown processes: Parallel composition and model checking. LNCS 836, pages 98--113. Springer, 1994.

.... in the case of CCS, for example, terms where a process variable x occurs in a parallel composition belonging to the definition of x are not handled [24] We are interested here to deal with non finite state systems; approaches have been proposed to this aim, which are not based on LTS s [1, 4, 16, 17, 18]; we consider instead LTS based verification. The idea is to use, for proving a logical property, a sequence of finite state LTSs approximating the, possibly infinite state, LTS corresponding to a term by the standard CCS semantics. In this paper we present a verification methodology to check ....

O. Burkart, B. Steffen. Pushdown processes: Parallel Composition and Model Checking. Proceedings, CONCUR 94, LNCS 836, 1994, pp.98-113.

....with counting constraints) covering a significant class of properties and for which the verification problem is decidable for all PA processes. 1 Introduction Reasoning about infinite state systems is an important and intensively studied topic in automatic verification and concurrency theory [1, 8, 6, 12, 4, 9, 11]. Several classes of infinite state systems are investigated corresponding to different description formalisms that are, mainly, either process algebras like BPA (contextfree processes) 2] and BPP (basic parallel processes) 7] or extended automata like pushdown systems, Petri nets (vector ....

....automata like pushdown systems, Petri nets (vector addition systems with states) and lossy channel systems. Important results have been established on the verification problem of such systems. These results concern behavioural equivalences preorders testing [8] as well as model checking [1, 6, 12, 4, 11]. Our work follows the latter verification approach. Its originality consists of the consideration of nonregular properties. Indeed, as far as we know, all the other works on the subject address the verification of properties expressed in the usual specification logics like propositional temporal ....

O. Burkart and B. Steffen. Pushdown Processes: Parallel Composition and Model Checking. In CONCUR'94, 1994. LNCS 836.

....that monadic second order logic is decidable on the transition graphs of pushdown automata. Baeten, Bergstra and Klop [BBK87] have shown that the bisimulation equivalence is decidable for normed context free processes. Since then, some algorithms have been proposed for deciding model checking ([BS92, BS94, HS93] for example) or bisimulation equivalence ( HS91, HJM94] for example) for various classes of infinite state systems. A good survey of the different decidability results and proposed algorithms can be found in [Bur95] The works proposed so far have a common ground in that they study infinite state ....

O. Burkart and B. Steffen. Pushdown Processes: Parallel Composition and Model Checking. In CONCUR '94, LNCS 836, pages 98--113, 1994. Extended version will appear in Nordic Journal of Computing.

....theory, since Caucal, Cau92] showed that the pushdown automata transition graphs are exactly the rooted, finite degree, equational graphs. Hence, some infinite state systems can have finite representations, which can be used for different verification methods. For example, Burkart and Steffen, [BS94], present an algorithm for the model checking of the alternation free mu calculus on pushdown processes. Methods published so far study context free or pushdown processes, i.e. restricted process algebras such that the infinite transition graphs of their terms are pushdown automata transition ....

O. Burkart and B. Steffen. Pushdown Processes: Parallel Composition and Model Checking. In CONCUR '94, LNCS 836, pages 98--113. Springer, 1994.

.... we are currently investigating concern 1 ffl semi automatic intelligent network programming in a cooperation with Siemens Nixdorf (Munich) ffl automatic composition of heterogeneous verification algorithms for hardware and software systems from basic transformation and analysis components (see [ClPS93, BuSt92, BuSt94]) and ffl automatic generation of dataflow analysis algorithms from logic specifications for LOLA Synthesis Algorithm Query Set of Solutions Hypertext Browser Graphics Compilation Selected Solution select a solution input parameters store selected solution refine relax ....

O. Burkart and B. Steffen. Pushdown Processes: Parallel Composition and Model Checking. In 5th Int. Conf. on Concurrency Theory (CONCUR '94), Uppsala (Sweden) LNCS Vol. , Springer--Verlag, 1994.

....6. Regular MC Macro MC CFR PDA MC Equational Systems Solving FIXPOINT ANALYSIS MACHINE Intraprocedural DFA Higher Order DFA Interprocedural DFA Behavioural Relations hardwiring compilation logical characterization [Stef91] Stef93] Stef89] StIn94] Knoo93] Hung94] Ande92] Lars92] BuSt92] [BuSt94] [Stef93] KnRS94] Fig. 1. Setup of the Analysis Environment Interprocedural data flow analysis : in this setting we are able to cover a wide class of programs that contain recursive procedures with value parameters. The corresponding data flow analysis generator, which uses the same high ....

....to cover a wide class of programs that contain recursive procedures with value parameters. The corresponding data flow analysis generator, which uses the same high level specifications as the intraprocedural version, is under implementation. It requires the combination of the methods presented in [Stef93, BuSt94, KnSt92a, KnRS94]. Higher order data flow analysis : this setting allows us to deal with further types of parameters, like reference and procedure parameters. Whereas the case of reference parameters is still rather efficient, the optimal treatment of arbitrary (finite mode) procedures requires an unacceptable ....

[Article contains additional citation context not shown here]

O. Burkart, B. Steffen: "Pushdown Processes: Parallel Composition and Model Checking", Proc. of CONCUR '94, Stockholm (Sweden), August 1994, LNCS 836, pp. 98-113, Springer Verlag.

.... we are currently investigating concern ffl semi automatic intelligent network programming in a cooperation with Siemens Nixdorf (Munich) ffl automatic composition of heterogeneous verification algorithms for hardware and software systems from basic transformation and analysis components (see [ClPS93, BuSt92, BuSt94]) and ffl automatic generation of dataflow analysis algorithms from logic specifications for both finite and infinite state programs (see [Stef93, KnRS92, KnRS94a, KnRS94b] The paper is organized as follows: Section 2 introduces our UNIX application, Section 3 defines the metalevel ....

O. Burkart, B. Steffen. Pushdown Processes: Parallel Composition and Model Checking. In 5th Int. Conf. on Concurrency Theory (CONCUR '94), Uppsala (Sweden) LNCS Vol. , Springer--Verlag, 1994.

....of the infinitestate systems. In particular, in [BuSt92] an iterative model checking algorithm is developed that decides the alternation free part of the modal mu calculus for context free processes. Moreover, in [HuSt93] it is shown how this can be done using tableaux based techniques, and in [BuSt94] a model checker for pushdown processes that are a strict generalization of context free processes has been proposed. More general but also much more expensive are the decision algorithms proposed by Muller and Schupp [MuSc85] for monadic second order logic on pushdown transition graphs implying ....

....to cover a wide class of programs that contain recursive procedures with value parameters. The corresponding data flow analysis generator, which uses the same high level specifications as the intraprocedural version, is under implementation. It requires the combination of the methods presented in [BuSt92, Stef93, BuSt94]. ffl Higher order data flow analysis: this setting allows us to deal with further types of parameters, like reference parameters and procedure parameters. Whereas the case of reference parameters is still rather efficient, the optimal treatment of arbitrary (finite mode) procedures requires an ....

[Article contains additional citation context not shown here]

O. Burkart, B. Steffen: "Pushdown Processes: Parallel Composition and Model Checking," Proc. of CONCUR '94, Stockholm (Sweden), August 1994, LNCS N. 836, pp. 98-113, Springer Verlag.

No context found.

O. Burkart and B. Steen. Pushdown processes: Parallel composition and model checking. In CONCUR'94, volume 836 of LNCS, pages 98-113. Springer Verlag, 1994.

No context found.

O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In CONCUR'94, volume 836 of LNCS, pages 98--113. Springer Verlag, 1994.

No context found.

O. Burkart and B. Steffen. Pushdown Processes: Parallel Composition and Model Checking. In CONCUR'94, 1994. LNCS 836.

No context found.

Burkart, O., and Ste#en, B. (1994). Pushdown processes: parallel composition and model checking. Lecture Notes in Computer Science, 836, 98-113.

No context found.

O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In CONCUR'94, volume 836 of LNCS, pages 98--113. Springer Verlag, 1994.

No context found.

O. Burkart and B. Steen. Pushdown processes: Parallel composition and model checking. In CONCUR'94, volume 836 of LNCS, pages 98-113. Springer Verlag, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC