Abstract
This paper investigates automated model checking possibilities for CTL* formulae over infinite transition systems represented by relational automata (RA). The general model checking problem for CTL* formulae over RA is shown undecidable, the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formulae.
Part of this work was performed while the author was visiting Department of Computing Science, Chalmers University of Technology, Göteborg, Sweden.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P.Abdulla, B.Jonsson, Verifying Programs with Unreliable Channels, in Proc. of LICS'93, Montreal, Canada, 1993.
P.A.Abdulla, B.Jonsson, Undecidable Verification Problems for Programs with Unreliable Channels, in Proc. of ICALP'94, LNCS, this volume, 1994.
R. Alur and D.Dill, Automata for Modelling Real-Time Systems, in Proc. of ICALP'90, LNCS, No.443, 1990.
R. Alur, C.Courcoubetis and D.Dill, Model-Checking for Real-Time Systems, in Proc. of LICS'90, pp. 414–425, 1990.
A. Auziņš, J. Bārzdiņš, J. Bičevskis, K. Čerāns and A. Kalniņš, Automatic Construction of Test Sets: Theoretical Approach, in Baltic Computer Science, LNCS, No. 502, 1991.
J.M.Barzdin, J.J.Bicevskis and A.A.Kalninsh, Construction of Complete Sample Systems for Program Testing, in Latv. Gosudarst. Univ. Uch. Zapiski, Vol.210, 1974 (In Russian).
J.M.Barzdin, J.J.Bicevskis and A.A.Kalninsh, Automatic Construction of Complete Sample Systems for Program Testing, in Proc. IFIP Congress, 1977, North-Holland 1977.
O. Burkhart, B. Steffen, Model Checking for Context-Free Processes, In Proc. of CONCUR'92, LNCS No. 630, 1992.
K. Čerāns, Feasibility of Finite and Infinite Paths in Data Dependent Programs, in Proc. for LFCS'92, Russia, Tver, LNCS No. 620, 1992.
K. Čerāns, Decidability of Bisimulation Equivalences for Parallel Timer Processes, in Proc. of CAV'92, LNCS No.663, 1992.
K. Čerāns, Deciding Properties of Relational Automata: Reachability Relation Characterization, in Proc. of 4th Nordic Workshop on Program Correctness, Report No.78, Department of Informatics, University of Bergen, Bergen, Norway, 1993.
K. Čerāns, Deciding Properties of Integral Relational Automata, in Proc. of El Wintermöte, Report No.73, PMG, Dept. of Computer Sciences, Chalmers University of Technology, Göteborg, Sweden, 1993.
S. Christensen, Y. Hirshfeld, F. Moller Bisimulation equivalence is decidable for Basic Parallel processes, in Proc. of CONCUR'93, LNCS No. 715, 1993.
S. Christensen, H. Hüttel, C. Stirling, Bisimulation equivalence is decidable for all context free processes, in Proc. of CONCUR'92, LNCS No. 630, 1992.
E.M.Clarke, E.A.Emerson and A.P.Sistla, Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications, in ACM Transactions on Programming Languages and Systems, Vol.8, No.2, 1986.
E.A.Emerson, J.Y.Hailpern, “Sometimes” and “not never” revisited: On Branching versus Linear Time, in Proc. of ACM POPL'83, 1983.
J. Esparza, On the decidability of model checking for several μ-calculi and Petri nets, Report ECS-LFCS-93-274, Department of Computer Science, University of Edinburgh, 1993.
P. Jančar, Decidability Questions for Bisimilarity of Petri Nets and Some Related Problems, Report ECS-LFCS-93-261, Department of Computer Science, University of Edinburgh, 1993.
S.R. Kosaraju, Decidability of reachability in vector addition systems, in Proc. 6th ACM STOC, 1982.
S. Mayr, An algorithm for the general Petri net reachability problem, SIAM J. of Computing 13(3), pp.441–460, 1984.
M. Minsky, Finite and Infinite Machines, Prentice Hall, Englewood Cliffs, N.Y., 1967.
J.L. Peterson, Petri Net Theory and the Modelling of Systems, Prentice Hall, 1981.
A.P.Sistla, M.Y.Vardi, P.Wolper, The Complementation Problem for Büchi Automata With Applications to Temporal Logic, Theoretical Computer Science No.49, 1987.
M.Y. Vardi, P. Wolper, An Automata-Theoretic Approach to Automatic Program Verification, in Proc. of LICS, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Čerāns, K. (1994). Deciding properties of integral relational automata. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_56
Download citation
DOI: https://doi.org/10.1007/3-540-58201-0_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58201-4
Online ISBN: 978-3-540-48566-7
eBook Packages: Springer Book Archive