Abstract
The results of this paper provide insight in the contest behavioural versus logical specification formalisms. In general, behavioural specifications are strictly less expressive than logical ones. However, resorting to implicit behavioural specifications gives you the full expressive power of a logical specification formalism. In particular, implicit behavioural specifications may be combined under logical connectives such as conjunction and disjunction.
The paper leaves as an open problem the characterization of the expressive power of implicit specifications of the form:
where A and B are regular processes. That is, what is the expressive power of the implicit specification formalism I[CCST,T]? Based on the monotonicity of I[,] and main theorem 6.1, we know that I[CCST,T] can be no more expressive than H v . The question is whether I[CCST,T] equals H v in expressive power. Related to this question is the question of complexityfor the consistency problem of I[CCST,T]. We know from [JL91] that this decision problem is PSPACE-hard, but whether it is in PSPACE or is an inherent DEXPTIME-problem is still an open problem.
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
T. Bolognesi and E. Brinksma. Introduction to the iso specification language lotos. Computer Networks and ISDN Systems, 14, 1987.
G. Boudol and K.G. Larsen. Graphical versus logical specifications. Lecture Notes In Computer Science, Springer Verlag, 431, 1990. In Proceedings of Colloquium on Trees in Algebra and Programming'90.
J. Bradfield and C. Stirling. Verifying temporal properties of processes. Lecture Notes In Computer Science, Springer Verlag, 458, 1990.
R. de Simone. Higher-level synchronising devices in MEIJE-CCS. Theoretical Computer Science, 37, 1985.
M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18, 1979.
H. Hüttel and K. G. Larsen. The use of static constructs in a modal process logic. Lecture Notes In Computer Science, Springer Verlag, 363, 1989.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, pages 137–161, 1985.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
B. Jonsson and K.G. Larsen. On the complexity of equation solving in process algebra. Lecture Notes In Computer Science, Springer Verlag, 1991. To appear in Proceedings of TAPSOFT'91, Brighton.
D. Kozen. Results on the propositional mu-calculus. Lecture Notes In Computer Science, Springer Verlag, 140, 1982. in Proc. of International Colloquium on Algorithms, Languages and Programming 1982.
K.G. Larsen. Proof systems for Hennessy-Milner logic with recursion. Lecture Notes In Computer Science, Springer Verlag, 299, 1988. in Proceedings of 13th Colloquium on Trees in Algebra and Programming 1988.
K.G. Larsen. Ideal specification formalism = expressivity + compositionality + decidability + testability + ... Lecture Notes In Computer Science, Springer Verlag, 458, 1990. Invited paper at CONCUR'90.
K.G. Larsen. Modal specifications. Lecture Notes In Computer Science, Springer Verlag, 407, 1990. in Proceedings of Workshop on Automatic Verification Methods for Finite State Systems, Grenoble 1989.
K.G. Larsen. The expressive power of implicit specifications. Technical report, Aalborg University, Dept. of Math. and Comp. Sc., 1991.
P. Lewis and H. Qin. Factorization of finite state machines under observational equivalence. Lecture Notes In Computer Science, Springer Verlag, 458, 1990.
Kim G. Larsen and Bent Thomen. A modal process logic. In Proceeding on Logic in Computer Science, 1988.
K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. Lecture Notes In Computer Science, Springer Verlag, 443, 1990. In proceedings of International Colloquium on Algorithms, Languages and Programming 1990.
K.G. Larsen and L. Xinxin. Equation solving using modal transition systems. In Proceedings on Logic in Computer Science, 1990.
Philip Merlin and Gregor von Bochmann. On the construction of submodule specifications and communication protocols. ACM Transactions on Programming Languages and Systems, 5(1):1–25, 1983.
R. Milner. Calculus of Communicating Systems, volume 92 of Lecture Notes In Computer Science, Springer Verlag. Springer Verlag, 1980.
R. Milner. A complete inference system for a class of regular behaviours. CSR 111–82, University of Edinburgh, Department of Computer Science, 1982.
R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
D. Park. Concurrency and automata on infinite sequences. Lecture Notes In Computer Science, Springer Verlag, 104, 1981. Proceedings of 5th GI Conference.
J. Parrow. Submodule construction as equation solving in CCS. Theoretical Computer Science, 1989. To appear.
G. Plotkin. A structural approach to operational semantics. FN 19, DAIMI, Aarhus University, Denmark, 1981.
A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. Lecture Notes In Computer Science, Springer Verlag, 194, 1985. Proceedings of 12th International Colloquium on Automata, Languages and Programming.
M.W. Shields. A note on the simple interface equation. Technical report, University of Kent at Canterbury.
C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Lecture Notes In Computer Science, Springer Verlag, 352, 1989. In Proc. of Tapsoft'89.
G. Winskel. Model checking the modal nu-calculus. Lecture Notes In Computer Science, Springer Verlag, 372, 1989. In Proceedings of International Colloquium on Algorithms, Languages and Programming 19'89.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larsen, K.G. (1991). The expressive power of implicit specifications. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_135
Download citation
DOI: https://doi.org/10.1007/3-540-54233-7_135
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54233-9
Online ISBN: 978-3-540-47516-3
eBook Packages: Springer Book Archive