Skip header Section
Skip Bibliometrics Section
Automatic verification of sequential infinite-state processesJanuary 1997
- Author:
- Olaf Burkart
Abstract
No abstract available.
- J.C.M. Baeten and J.A. Bergstra. Recursive Process Definitions with the State Operator. Theoretical Computer Science, 82:285-302, 1991. Google Scholar
Digital Library
- J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. In PARLE '87, LNCS 259, pages 94-113. Springer, 1987. Google Scholar
- J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. Technical Report CS-R8632, CWI, September 1987.Google ScholarCross Ref
- O. Burkart, D. Caucal, and B. Steffen. An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. In MFCS '95, LNCS 969, pages 423-433. Springer, 1995. Google Scholar
- O. Burkart, D. Caucal, and B. Steffen. Bisimulation Collapse and the Process Taxonomy. In CONCUR '96, LNCS 1119, pages 247-262. Springer, 1996. Google Scholar
- A. Bouajjani, R. Echahed, and R. Robbana. Verification of Nonregular Temporal Properties for Context-Free Processes. In CONCUR '94, LNCS 836, pages 81-97. Springer, 1994. Google Scholar
- J.A. Bergstra and J.W. Klop. Process Algebra for Synchronous Communication. Information and Control, 60:109-137, 1984.Google ScholarCross Ref
- J.A. Bergstra and J.W. Klop. Process Theory Based on Bisimulation Semantics. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pages 50-122. Springer, 1988. Google Scholar
- O. Burkart and Y.-M. Quemener. Model-Checking of Infinite Graphs Defined by Graph Grammars. In INFINITY '96, volume 6 of ENTCS, 15 pages. Elsevier Science B.V., 1997.Google Scholar
- J.C. Bradfield. Verifying Temporal Properties of Systems. Birkhäuser, Boston, Massachussets, 1991. Google Scholar
- J.C. Bradfield. The Modal mu-Calculus Alternation Hierarchy is Strict. In CONCUR '96, LNCS 1119, pages 233-246. Springer, 1996. Google ScholarCross Ref
- J.C. Bradfield and C. Stirling. Local Model Checking for Infinite State Spaces. Theoretical Computer Science, 96:157-174, 1992. Google ScholarDigital Library
- O. Burkart and B. Steffen. Model Checking for Context-Free Processes. In CONCUR '92, LNCS 630, pages 123-137. Springer, 1992. Google Scholar
- O. Burkart and B. Steffen. Pushdown Processes: Parallel Composition and Model Checking. In CONCUR '94, LNCS 836, pages 98-113. Springer, 1994. Google Scholar
- O. Burkart and B. Steffen. Model-Checking the Full-Modal Mu-Calculus for Infinite Sequential Processes. In ICALP '97, LNCS 1256, pages 419-429. Springer, 1997. Google Scholar
- O. Burkart. Model-Checking Rationally Restricted Right Closures of Recognizable Graphs. In INFINITY '97, UPMAIL Tech. Report 148, pages 19-29. Uppsala, July 1997.Google Scholar
- J.C.M. Baeten and W.P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in TCS. Cambridge University Press, 1990. Google Scholar
- D. Caucal. A Fast Algorithm to Decide on Simple Grammars Equivalence. In Int. Symposium on Optimal Algorithms, LNCS 401, pages 66-85. Springer, 1989. Google Scholar
- D. Caucal. Graphes Canoniques de Graphes Algébriques. RAIRO, 24(4):339-352, 1990.Google ScholarCross Ref
- D. Caucal. On the Regular Structure of Prefix Rewriting. Theoretical Computer Science, 106:61-86, 1992. Google ScholarDigital Library
- D. Caucal. On Infinite Transition Graphs Having a Decidable Monadic Theory. In ICALP '96, LNCS 1099, pages 194-205. Springer, 1996. Google ScholarCross Ref
- E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986. Google ScholarDigital Library
- E. Clarke, O. Grumberg, and D. Long. Verification Tools for Finite-State Concurrent Systems. In A Decade of Concurrency, LNCS 803, pages 124-175. Springer, 1994. Google ScholarDigital Library
- S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation Equivalence is Decidable for all Basic Parallel Processes. In CONCUR '93, LNCS 715, pages 143-157. Springer, 1993. Google ScholarCross Ref
- S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, The University of Edinburgh, Department of Computer Science, 1993.Google Scholar
- S. Christensen, H. Hüttel, and C. Stirling. Bisimulation Equivalence is Decidable for all Context-Free Processes. In CONCUR '92, LNCS 630, pages 138-147. Springer, 1992. Google ScholarCross Ref
- R. Cleaveland, M. Klein, and B. Steffen. Faster Model Checking for the Modal Mu-Calculus. In CAV '92, LNCS 663, pages 410-422, 1992. Google Scholar
- R. Cleaveland. Tableau-Based Model Checking in the Propositional Mu-Calculus. Acta Informatica, 27:725-747, 1990. Google ScholarDigital Library
- D. Caucal and R. Monfort. On the Transition Graphs of Automata and Grammars. In Graph-Theoretic Concepts in Computer Science, LNCS 484, pages 311-337. Springer, 1990. Google Scholar
- B. Courcelle. The Definability of Equational Graphs in Monadic Second-Order Logic. In ICALP '89, LNCS 372, pages 207-221. Springer, 1989. Google Scholar
- B. Courcelle. Graph Rewriting: An Algebraic and Logic Approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 5, pages 193-242. Elsevier Science Publisher B.V., 1990. Google Scholar
- R. Cleaveland and B. Steffen. Computing Behavioural Relations, Logically. In ICALP '91, LNCS 510, pages 127-138. Springer, 1991. Google Scholar
- R. Cleaveland and B. Steffen. A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. In CAV '91, LNCS 575, pages 48-58. Springer, 1992. Google ScholarCross Ref
- B.A. Davey and H.A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.Google Scholar
- E.A. Emerson and J.Y. Halpern. "Sometimes" and "Not never" Revisited: On Branching Versus Linear Time. Journal of the ACM, 33:151-178, 1986. Extended version of POPL '83, pp. 127-140. Google ScholarDigital Library
- E.A. Emerson and C.S. Jutla. The Complexity of Tree Automata and Logics of Programs. In FOCS '88, pages 328-337. IEEE Computer Society Press, 1988. Google Scholar
- E.A. Emerson and C.S. Jutla. Tree Automata, Mu-Calculus and Determinacy. In FOCS '91, pages 368-377. IEEE Computer Society Press, 1991. Google Scholar
- J. Esparza and A. Kiehn. On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes. In CAV '95, LNCS 939, pages 353- 366. Springer, 1995. Google Scholar
- E.A. Emerson and C.-L. Lei. Efficient Model Checking in Fragments of the Propositional Mu-Calculus. In LICS '86, pages 267-278. IEEE Computer Society Press, 1986.Google Scholar
- E.A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 16, pages 995- 1072. Elsevier Science Publisher B.V., 1990. Google Scholar
- J. Esparza. On the Decidability of Model Checking for Several µ-calculi and Petri Nets. In CAAP '94, LNCS 787, pages 115-129. Springer, 1994. Google ScholarCross Ref
- M.J. Fischer and R.E. Ladner. Propositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences, 18:194-211, 1979.Google ScholarCross Ref
- R.W. Floyd. Assigning Meanings to Programs. In Symposium on Applied Mathematics, volume 19, pages 19-32. American Mathematical Society, 1967.Google ScholarCross Ref
- E. P. Friedman. The Inclusion Problem for Simple Languages. Theoretical Computer Science, 1:297-316, 1976.Google ScholarCross Ref
- J.F. Groote and H. Hüttel. Undecidable Equivalences for Basic Process Algebra. Information and Computation, 115(2):354-371, 1994. Google ScholarDigital Library
- R.J. van Glabbeek. The Linear Time - Branching Time Spectrum. In CONCUR 90, LNCS 458, pages 278-297. Springer, 1990. Google Scholar
- J.F. Groote. A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes. Information Processing Letters, 42:167-171, 1991. Google ScholarDigital Library
- M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, 1978. Google ScholarDigital Library
- Y. Hirshfeld, M. Jerrum, and F. Moller. A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. In FOCS '94, pages 623-631. IEEE Computer Society Press, 1994. Google Scholar
- D. Harel, D. Kozen, and R. Parikh. Process Logic: Expressiveness, Decidability and Completeness. Journal of Computer and System Sciences, 25:144- 201, 1982.Google ScholarCross Ref
- Y. Hirshfeld and F. Moller. A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. In CONCUR '94, LNCS 836, pages 48-63. Springer, 1994. Google ScholarCross Ref
- C.A.R. Hoare. An Axiomatic Basis for Computer Programming. Communications of the ACM, 12(10):576-583, 1969. Google ScholarDigital Library
- C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985. Google ScholarDigital Library
- H. Hüttel and C. Stirling. Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes. In LICS '91, pages 376-386. IEEE Computer Society Press, 1991.Google ScholarCross Ref
- H. Hungar and B. Steffen. Local Model-Checking for Context-Free Processes. In ICALP '93, LNCS 700, pages 593-605, 1993. Google Scholar
- D.T. Huynh and L. Tian. Deciding Bisimilarity of Normed Context-Free Processes is in Σ2p. Theoretical Computer Science, 123:183-197, 1994. Google ScholarDigital Library
- J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979. Google ScholarDigital Library
- H. Hüttel. Decidability, Behavioural Equivalences and Infinite Transition Graphs. PhD thesis, University of Edinburgh, Dec 1991. CST-86-91.Google Scholar
- A.J. Korenjak and J.E. Hopcroft. Simple Deterministic Languages. In 7 th Annual IEEE Symposium on Switching and Automata Theory, pages 36-46, 1966. Google Scholar
- B. Knaster. Un théorème sur les fonctions d'ensembles. Ann. Soc. Pol. Math., 6:133-134, 1928.Google Scholar
- D. Kozen. Results on the Propositional µ-Calculus. Theoretical Computer Science, 27:333-354, 1983.Google ScholarCross Ref
- L. Lamport. Verification and Specification of Concurrent Programs. In A Decade of Concurrency, REX School/Symposium, LNCS 803, pages 347-374. Springer, 1994. Google Scholar
- K.G. Larsen. Proof Systems for Hennessy-Milner Logic with Recursion. In CAAP '88, LNCS 299, pages 215-230. Springer, 1988. Google Scholar
- G. Lenzi. A Hierarchy Theorem for the Mu-Calculus. In ICALP '96, LNCS 1099, pages 87-109. Springer, 1996. Google Scholar
- J.L. Lassez, V.L. Nguyen, and E.A. Sonenberg. Fixed Point Theorems and Semantics: A Folk Tale. Information Processing Letters, 14(3):112-116, 1982.Google Scholar
- E. Madelaine. Verification Tools from the CONCUR Project. European Association for Theoretical Computer Science, 47:110-128, June 1992.Google Scholar
- R. Milner. A Calculus of Communicating Systems. LNCS 92. Springer, 1980. Google Scholar
- R. Milner. A Complete Inference System for a Class of Regular Behaviours. Journal of Computer and System Sciences, 28:439-466, 1984.Google ScholarCross Ref
- R. Milner. Communication and Concurrency. Prentice-Hall, 1989. Google ScholarDigital Library
- S. Mauw and H. Mulder. Regularity of BPA-Systems is Decidable. In CONCUR '94, LNCS 836, pages 34-47. Springer, 1994. Google ScholarCross Ref
- D.E. Muller and P.E. Schupp. The Theory of Ends, Pushdown Automata, and Second-Order Logic. Theoretical Computer Science, 37:51-75, 1985.Google ScholarCross Ref
- M. Nielsen and Ch. Clausen. Bisimulation for Models in Concurrency. In CONCUR '94, LNCS 836, pages 385-400, 1994. Google Scholar
- D. Niwinski. On fixed-point clones. In ICALP '86, LNCS 226, pages 464-473. Springer, 1986. Google ScholarCross Ref
- D. Niwinski. Fixed Points vs. Infinite Generation. In LICS '88, pages 402-409. IEEE Computer Society Press, 1988.Google Scholar
- D. Park. Concurrency and Automata on Infinite Sequences. In 5th GI Conference, LNCS 104, pages 167-183. Springer, 1981. Google Scholar
- S. Purushothaman Iyer. A Note on Model Checking Context-Free Processes. In NAPAW '93, Technical Report TR 93-1369. Cornell, Ithaca, NY, 1993.Google Scholar
- G. Plotkin. A Structural Approach to Operational Semantics. Daimi FN- 19, Aarhus University, Computer Science Department, 1981.Google Scholar
- R.O. Rabin. Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the AMS, 141:1-35, 1969.Google Scholar
- G. Sénizergues. The Equivalence Problem for Deterministic Pushdown Automata is Decidable. Accepted for ICALP '97, 1997. Google ScholarCross Ref
- C. Stirling. Modal and Temporal Logics. In Handbook of Logic in Computer Science, volume 2, pages 477-563. Oxford Science Publications, 1992. Google Scholar
- C. Stirling. Modal and Temporal Logics for Processes. Notes for Summer School in Logic Methods in Concurrency, Department of Computer Science, Aarhus University, 1993. Google Scholar
- C. Stirling. Decidability of Bisimulation Equivalence for Normed Pushdown Processes. In CONCUR '96, LNCS 1119, pages 217-232. Springer, 1996. Google Scholar
- R.S. Street. Propositional Dynamic Logic of Looping and Converse is Elementary Decidable. Information and Computation, 54:121-141, 1982.Google Scholar
- C. Stirling and D. Walker. Local Model Checking in the Modal Mu-Calculus. In TAPSOFT '89, LNCS 351, pages 369-383. Springer, 1989. Google Scholar
- A. Tarski. A Lattice-Theoretical Fixpoint Theorem and its Applications. Pacific Journal of Mathematics, 5:285-309, 1955.Google ScholarCross Ref
- W. Thomas. Automata on Infinite Objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4, pages 133-191. Elsevier Science Publishers B.V., 1990. Google ScholarDigital Library
- I. Walukiewicz. On Completeness of the µ-calculus. In LICS '93, pages 136-146. IEEE Computer Society Press, 1993.Google Scholar
- W. Wechler. Universal Algebra for Computer Scientists. Springer, 1992.Google ScholarCross Ref
- G. Winskel. A Note on Model Checking the Modal Mu-Calculus. In ICALP '89, LNCS 372, pages 761-772. Springer, 1989. Google Scholar
Recommendations
Efficient Verification of Sequential and Concurrent C Programs
There has been considerable progress in the domain of software verification over the last few years. This advancement has been driven, to a large extent, by the emergence of powerful yet automated abstraction techniques such as predicate abstraction. ...
Automatic Compositional Verification of Probabilistic Safety Properties for Inter-organisationalWorkflow Processes
SIMULTECH 2016: Proceedings of the 6th International Conference on Simulation and Modeling Methodologies, Technologies and ApplicationsFor many complex systems, it is important to verify formally their correctness; the aim is to guarantee the
reliability and the correctness of such systems before their effective deployment. Several methods have been
proposed to this effect using ...