Abstract
In this work we have defined a parametric model for describing the semantics of finite states systems. It relies on the parametric theories of observation trees [5, 6] and proved trees [8]. A notion of parametric bisimulation is introduced over extended transition systems and it is shown that this equivalence coincide with the ones already presented in literature. The results presented in this paper are fundamental for a practical use of a parametric theory in automatic verification of systems.
Following the definitions given above, it is immediate to derive an algorithm for parametric bisimulation when incremental observations are considered. The extension to other observations is under development following the approach of decomposing any non-incremental observation into an incremental one and an abstraction function. The basic idea is use standard techniques from fix-point theory to prove properties on regular languages that may permit to make this decomposition effective.
Work partially supported by Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo
Preview
Unable to display preview. Download preview PDF.
References
Boudol, G., Castellani, I., A non-interleaving semantics for CCS based on proved transitions, Fundamenta Informaticae, XI (4), 1988, 433–452.
Boudol, G., Castellani, I., Hennessy, M., Kiehn, A., A Theory of Processes with Localities, in Proc. CONCUR. 92, LNCS, Springer-Verlag. 1992.
Darondeau, Ph., Degano, P., Causal Trees, in Proc. ICALP '89, LNCS 372, 1989, 234–248.
Degano, P., De Nicola, R., Montanari, U., On the Operational Semantics of Distributed Concurrent Systems, in Proc. IFIP'88 (David, Boute, and Shriver Eds), North-Holland, 1990. 3–32.
Degano, P., De Nicola, R., Montanari, U., Universal Axioms for Bisimulations, Tech. Rep. TR 9/92, Dipartimento di Informatica, Università di Pisa, to appear in Theoretical Computer Science.
Degano, P., De Nicola, R., Montanari, U., Observation Trees, in Proc. NAPAW'92.
Degano, P., Montanari, U., Concurrent Histories: A Basis for Observing Distributed Systems, J.C.S.S., 34. 1987, 422–461.
Degano, P., Priami, C., Proved Trees, in Proc. ICALP'92, LNCS 623, Springer, 1992. 629–640.
Ferrari, G., Gorrieri, R., Montanari, U., An Extended Expansion Theorem, in Proc. TAPSOFT'91, LNCS 494. Springer-Verlag. 1991, 29–48.
Inverardi, P., Priami, C., Evaluation of Tools for the Analysis of Communicating Systems, EATCS Bullettin. n. 45. 1991.
Inverardi, P., Priami, C., Yankelevich, D. Verifying concurrent systems in SML, in Proc. of ACM SIGPLAN Workshop on ML and its Applications, San Francisco, June 1992.
Kiehn, A., Local and Global Causes, Report Technische Universität Munchen 342/23/91 A, 1991.
Korver, H., The Current States of Bisimulation Tools, Tech. Rep. P9101, CWI, 1991.
Milner, R., Communication and Concurrency. Prentice Hall International, London 1989.
Montanari. U., Yankelevich, D., A Parametric Approach to Localities, in Proc. ICALP'92, LNCS 623, Springer-Verlag, 1992, 617–628.
Park, D., Concurrency and Automata on Infinite Sequences, in Proc. GI, LNCS 104, Springer-Verlag, 1981, 167–183.
Plotkin, G., A Structural Approach to Operational Semantics. Tech.Rep. DAIMI FN-19, Aarhus Univ, 1981.
Tarjan, R., A Unified Approach to Path Problems, J. ACM 28, 3, 1981, 577–593.
Tarjan, R., Fast Algorithms for Solving Path Problems, J. ACM 28, 3, 1981, 594–614.
Yankelevich, D., Parametric Views of Process Description Languages, PhD Thesis Università di Pisa, TD 23/93. 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inverardi, P., Priami, C., Yankelevich, D. (1993). Extended transition systems for parametric bisimulation. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_102
Download citation
DOI: https://doi.org/10.1007/3-540-56939-1_102
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56939-8
Online ISBN: 978-3-540-47826-3
eBook Packages: Springer Book Archive