Abstract
A system is described which supports proofs of both behavioural and logical properties of concurrent systems; these are specified by means of a process algebra and its associated logics. The logic is an action based version of the branching time logic CTL which we call ACTL; it is interpreted over transition labelled structures while CTL is interpreted over state labelled ones. The core of the system are two existing tools, AUTO and EMC. The first builds the labelled transition system corresponding to a term of a process algebra and permits proof of equivalence and simplification of terms, while the second checks validity of CTL logical formulae. The integration is realized by means of two translation functions from the action based branching time logic ACTL to CTL and from transition-labelled to state-labelled structures. The correctness of the integration is guaranteed by the proof that the two functions when coupled preserve satisfiability of logical formulae.
The research has been partially supported by the CEC under ESPRIT project 2304 LOTOSPHERE and EBRA project 3011 CEDISYS and by “Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo” of CNR.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Austry, G. Boudol: Algèbre de Processus et Synchronization. Theoretical Computer Science, 30, (1) 1984, pp. 91–131.
T. Bolognesi, M. Caneve: Squiggles: a Tool for the Analysis of LOTOS Specifications, in “Formal Description Techniques” (K. Turner, ed.), North-Holland, 1989.
M.C. Browne, E.M. Clarke, O. Grümberg: Characterizing Finite Kripke Structures in Propositional Temporal Logic. Theoretical Computer Science, 59 (1,2), 1988, pp. 115–131.
A. Boujjani, S. Graf, J. Sifakis: A Logic for the Description of Behaviours and Properties of Concurrent Systems. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, (de Bakker, J.et al., eds.) LNCS 354, Springer-Verlag, 1989, pp. 398–410.
J. Bradfield, C. Stirling: Verifying Temporal Properties of Processes. in Concur 90 (J. C. P. Baeten, J. W. Klop, eds), LNCS 458, Springer-Verlag, 1990, pp. 115–125.
J. C. M. Baeten, W. P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.
E.M. Clarke, E.A. Emerson, A.P. Sistla: Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications. ACM Toplas, 8 (2), 1986, pp. 244–263.
R. Cleaveland, J. Parrow, B. Steffen: The Concurrency Workbench. In Automatic Verification Methods for Finite State Systems (J. Sifakis, ed.) LNCS 407, Springer-Verlag, 1990, pp. 24–37.
R. de Simone, D. Vergamini: Aboard AUTO, I.N.R.I.A. Technical Report 111 (1990).
R. De Nicola, F. W. Vaandrager: Three Logics for Branching Bisimulations (Extended Abstract) in LICS '90, IEEE Computer Society Press, 1990, pp. 118–129.
R. De Nicola, F. W. Vaandrager: Action versus State based Logics for Transition Systems. In Semantics of Systems of Concurrent Processes (I. Guessarian.ed.), LNCS 469, 1990, pp. 407–419.
E. A. Emerson, J. Y. Halpern: “Sometimes” and “Not Never” Revisited: on Branching Time versus Linear Time Temporal Logic. Journal of ACM, 33, 1, 1986, pp. 151–178.
E. A. Emerson, J. Srinivasan: Branching Time Temporal Logic. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, (de Bakker et al., eds.) LNCS 354, Springer-Verlag, 1989, pp. 123–172.
J. C. Godskesen, K. G. Larsen, M. Zeeberg: TAV Users Manual, Internal Report, Aalborg University Center, Denmark, (1989).
H. Garavel, J Sifakis: Compilation and Verification of LOTOS Specifications, in Protocol Specification, Testing and Verification, X, (L. Logrippo et al., eds.) North Holland, 1990.
M. Hennessy: An Algebraic Theory of Processes, MIT Press, Cambridge, 1988.
M. Hennessy, R. Milner: Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM, 32, 1985, pp. 137–161.
C. A. R. Hoare: Communicating Sequential Processes. Prentice Hall International, 1985.
B. Jonsson, A.H. Khan, J. Parrow: Implementing a model checking algorithm by adapting existing automated tools. In Automatic Verification Methods for Finite State Systems (J. Sifakis, ed.) LNCS 407, Springer-Verlag, 1990, pp. 179–188.
D. Kozen: Results on the Propositional Μ-calculus, Theoretical Computer Science, 27, 1983.
K. G. Larsen: Proof Systems for Hennessy-Milner Logic with Recursion, in Proceedings CAAP '88 (M. Dauchet & M. Nivat eds) LNCS 299, Springer-Verlag, 1988.
R. Milner: Communication and Concurrency, Prentice Hall International, 1989.
Z. Manna, A. Pnueli: The Anchored Version of the Temporal Framework, in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, (de Bakker et al., eds.) LNCS 354, Springer-Verlag, 1989.
E. Madeleine, D. Vergamini: AUTO: A Verification Tool for Distributed Systems Using Reduction of Finite Automata Networks, in Formal Description Techniques II (S.T. Vuong, ed.), North-Holland, 1990.
C. Stirling: Temporal Logics for CCS, in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, (de Bakker et. al., eds.) LNCS 354, Springer-Verlag, 1989, pp. 660–672.
R. J. van Glabbeek, W. P. Weijland: Branching Time and Abstraction in Bisimulation Semantics. In Information Processing '89 (G.X. Ritter, ed.), North Holland, 1989, pp. 613–618.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Nicola, R., Fantechi, A., Gnesi, S., Ristori, G. (1992). An action based framework for verifying logical and behavioural properties of concurrent systems. In: Larsen, K.G., Skou, A. (eds) Computer Aided Verification. CAV 1991. Lecture Notes in Computer Science, vol 575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55179-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-55179-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55179-9
Online ISBN: 978-3-540-46763-2
eBook Packages: Springer Book Archive