Abstract
We present a theory of Modal Specifications which has been specifically designed in order to allow loose specifications to be expressed. Modal Specifications extends Process Algebra in the sense that specifications may be combined using process constructs. Moreover, Modal Specifications is given an operational interpretation imposing restrictions on the transitions of possible implementations by telling which transitions are necessary and which are admissable. This allows a refinement ordering between Modal Specifications to be defined extending the well-established notion of bisimulation. In the paper we present a logical characterization of the refinement-ordering and derive characteristic logical formulas from any given Modal Specifications. Also, we explore the possibility of combining Modal Specifications themselves logically, and we briefly comment on the automation of refinement.
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
S. Abramsky: Observation Equivalence as a Testing Equivalence, TCS, 1987.
Lecompte, Madelaine, Vergamini: AUTO: A Verification System for Parallel and Communicating Processes, INRIA, Sophia-Antipolis, 1988.
G. Boudol: Grafical Specifications, unpublished note, 1989.
Cleaveland, Parrow, Steffen: The Concurrency Workbench, University of Edinburgh.
S.Graf and J.Sifakis: A Logic for the Description of Non-deterministic Programs and Their Properties, Information and Control, vol 68, no 1–3, 1986.
Groote, Vaandrager: Structured Operational Semantics and Bisimulation as a Congruence, 1989.
M.Hennessy and R.Milner: Algebraic Laws for Nondeterminism and Concurrency, Journal of the Association for computing Machinery, pp. 137–161, 1985.
M. Hillerstr“om: Verification of CCS-processes, Master-Thesis, Aalborg University Center, 1987.
S. Holmström: Reasoing about CCS agents using Hennessy-Milner logic extended with fixed points, unpublished paper, 1987.
Hüttel, Larsen: The use of Static Constructs in A Modal Process Logic, to be presented at Logic at Botik'89, USSR.
Ingolfsdottir, Godskesen, Zeeberg: Master Thesis, Aalborg University, 1987.
Kannellakis, Smolka: CCS Expressions, finite state processes, and three problems of equivalence, 1983. To appear in Information and Computation.
Larsen, Kim. G and Bent Thomsen: A Modal Process Logic, in Proceedings of Third Annual symposium on Logic in Computer Science, Edinburgh, 1988.
K.G.Larsen: A Context Dependent Bisimulation between Processes, Ph.D Thesis, Edinburgh University, 1986.
K.G.Larsen: A Context Dependent Bisimulation between Processes, Theoretical Computer Science 49, 1987.
Larsen, Kim G.: Proof Systems for Hennessy-Milner Logic with Recursion, in: CAAP 88, Springer Lecture Notes in Computer Science 299, 1988. (Extended version to appear in Theoretical Computer Science, North-Holland).
Larsen: Arguing about Membership of Maximal Fixedpoints, future paper.
K.G.Larsen and R.Milner: Verifying a Protocol Using Relativized Bisimulation, in Proceedings of ICALP'87, LNCS 267.
Larsen, Skou: Bisimulation Through Probabilistic Testing, Proceedings of ACM POPL'89.
R. Milner: Calculus of Communicating Systems, LNCS 92.
R. Milner: Calculi for Synchrony and Asynchrony, Theoretical Computer Science 25, 1983.
Paige, Tarjan: Three Partition Refinement Algorithms, SIAM J. Comput., vol. 16, no. 6, 1987.
D.Park: Concurrency and automata on infinite sequences, Proc. 5th GI Conf., LNCS 104, 1981.
G. Plotkin: A Structural Approach to Operational Semantics, Tech. Rep., DAIMI FN-19, Computer Sc., Aarhus University, Denmark, 1981.
R. de Simone: Higher-level synchronising devices in MEIJE-CCS, TCS 37, 1985.
B. STeffen: Characteristic Formulae, Edinburgh University, 1989.
A. Taski: A Lattice-Theoretical Fixpoint Theorem and Its applications, Pacific Journal of Math. 5, 1955.
Larsen, Skou: TAU: Theories for Parallel Systems, their Automation and Usage, Aalborg University Center, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larsen, K.G. (1990). Modal specifications. In: Sifakis, J. (eds) Automatic Verification Methods for Finite State Systems. CAV 1989. Lecture Notes in Computer Science, vol 407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52148-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-52148-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52148-8
Online ISBN: 978-3-540-46905-6
eBook Packages: Springer Book Archive