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
Notes
- 1.
The term “state” is reserved for elements of the set P.
- 2.
Other semantics is also available, for example “maximum concurrency” semantics in which multiple possible actions are fired at a time.
- 3.
Thus, Λ is not strictly a relation, because it contains both quadruples and triples. More formally, a message “agent termination” may be added to M, which is prohibited on input of any action.
- 4.
This form of graphical specification will be a basis for definition of Distributed Automata DA3 in Chap. 8.
References
Chandy, K. M., & Lamport, L. (1985). Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems, 3(1), 63–75. https://doi.org/10.1145/214451.214456.
Chrobot, S., & Daszczuk, W. B. (2006). Communication dualism in distributed systems with petri net interpretation. Theoretical and Applied Informatics, 18(4), 261–278. URL: https://taai.iitis.pl/taai/article/view/250/taai-vol.18-no.4-pp.261.
Daszczuk, W. B. (2008). Deadlock and termination detection using IMDS formalism and model checking, Version 2, ICS WUT Research Report No.2/2008. arXiv:1710.08842.
Daszczuk, W. B., Bielecki. M., & Michalski, J. (2017). Rybu: Imperative-style preprocessor for verification of distributed systems in the Dedan environment. In KKIO’17—Software Engineering Conference, Rzeszów, Poland, 14–16 September, 2017. Polish Information Processing Society. arXiv:1710.02722.
Dick, G., & Yao, X. (2014). Model representation and cooperative coevolution for finite-state machine evolution. In 2014 IEEE Congress on Evolutionary Computation (CEC), Beijing, China (pp. 2700–2707), 6–11 July, 2014. New York, NY: IEEE. https://doi.org/10.1109/cec.2014.6900622.
Penczek, W., Szreter, M., & Kuiper, R. (2000). Improving partial order reductions for universal branching time properties. Fundamenta Informaticae, 43(1–4), 245–267. Url: https://content.iospress.com/articles/fundamenta-informaticae/fi43-1-4-13.
Reniers, M. A., & Willemse T. A. C. (2011). Folk theorems on the correspondence between state-based and event-based systems. In 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia (pp. 494–505), 22–28 January, 2011. Berlin Heidelberg: Springer. https://doi.org/10.1007/978-3-642-18381-2_41.
van Glabbeek, R. J., & Goltz, U. (1990). Equivalences and refinement. In LITP Spring School on Theoretical Computer Science La Roche Posay, France, LNCS 469 (pp. 309–333), 23–27 April, 1990. Berlin Heidelberg: Springer. https://doi.org/10.1007/3-540-53479-2_13.
Winskel, G., & Nielsen, M. (1995). Models for concurrency. Handbook of logic in computer science (vol.4). S. Abramsky, D. M. Gabbay, & T. S. E. Maibaum (Eds.). Oxford, UK: Oxford University Press. ISBN:0-19-853780-8.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Daszczuk, W.B. (2020). Integrated Model of Distributed Systems. In: Integrated Model of Distributed Systems. Studies in Computational Intelligence, vol 817. Springer, Cham. https://doi.org/10.1007/978-3-030-12835-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-12835-7_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-12834-0
Online ISBN: 978-3-030-12835-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)