Abstract
Consider a multiple-agent transition system such that, for some basic types T 1,...,T n , the state of any agent can be represented as an element of the Cartesian product T 1× ⋯ ×T n . The system evolves by means of global steps. During such a step, new agents may be created and some existing agents may be updated or removed, but the total number of created, updated and removed agents is uniformly bounded.
We show that, under appropriate conditions, there is an algorithm for deciding assume-guarantee properties of one-step computations. The result can be used for automatic invariant verification as well as for finite state approximation of the system in the context of test-case generation from AsmL specifications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Foundations of Software Engineering group, Microsoft Research, http://research.microsoft.com/fse/
AsmL: The Abstract State Machine Language. Reference Manual. Modeled Computation LLC (2002), http://research.microsoft.com/fse/asml/
Grieskamp, W., Gurevich, Y., Schulte, W., Veanes, M.: Generating Finite State Machines from Abstract State Machines. In: ISSTA 2002, International Symposium on Software Testing and Analysis (July 2002)
Veanes, M., Yavorsky, R.: Combined Algorithm for Approximating a Finite State Abstraction of a Large System. In: SCESM 2003, 2-nd International Workshop on Scenarios and State Machines: Models, Algorithms, and Tools (May 2003)
Boolos, G.S., Burgess, J.P., Jeffrey, R.C.: Computability and Logic. Cambridge University Press, Cambridge (2002)
Rabin, M.O.: Decidable theories. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 595–627. North Holland, Amsterdam (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gurevich, Y., Yavorskiy, R. (2004). Observations on the Decidability of Transitions. In: Zimmermann, W., Thalheim, B. (eds) Abstract State Machines 2004. Advances in Theory and Practice. ASM 2004. Lecture Notes in Computer Science, vol 3052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24773-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-24773-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22094-7
Online ISBN: 978-3-540-24773-9
eBook Packages: Springer Book Archive