zbMATH — the first resource for mathematics

A formal framework for interactive agents. (English) Zbl 1277.68207
Goldin, Dina (ed.) et al., Proceedings of the workshop on the foundations of interactive computation (FinCo 2007), Braga, Portugal, March 31, 2007. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 203, No. 3, 95-106 (2008).
Summary: This paper proposes a formal framework and architecture for specification and analysis of interactive agents. The framework can be used to explore the design space, study features of different points in the design space, and to develop executable specifications of specific agents and study their interactions with the environment. A long term goal is development of reasoning principles specialized to different regions of the design space.
For the entire collection see [Zbl 1276.68017].
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q60 Specification and verification (program logics, model checking, etc.)
68T42 Agent technology and artificial intelligence
Full Text: DOI
[1] Arbab, F., A behavioral model for composition of software components, L’objet, 12, 33-76, (2006)
[2] Arbab, F.; M Rutten, J.J.M., A coinductive calculus of component connectors, (), 34-55 · Zbl 1278.68200
[3] Broy, M.; Stefanescu, G., The algebra of stream processing functions, Theoretical computer science, 258, (2001) · Zbl 0973.68172
[4] Broy, M.; Stolen, K., Specification and development of interactive systems, () · Zbl 0981.68115
[5] de Alfaro, L.; Henzinger, T.A., Interface automata, (), 109-120
[6] de Alfaro, L.; Henzinger, T.A., Interface theories for component-based design, () · Zbl 1050.68518
[7] Denker, G.; Meseguer, J.; Talcott, C.L., Rewriting semantics of distributed meta objects and composable communication services, Third international workshop on rewriting logic and its applications, (WRLA’2000), Electronic notes in theoretical computer science, 36, (2000), Elsevier · Zbl 0962.68081
[8] Denker, G.; Talcott, C.L., Formal checklists for remote agent dependability, Fifth international workshop on rewriting logic and its applications, (WRLA’2004), Entcs, 117, (2004), Elsevier
[9] D. Dvorak, R. Rasmussen, G. Reeves, and A. Sacks. Software Architecture Themes In JPL’s Mission Data System. In IEEE Aerospace Conference, USA, 2000
[10] Goldin, D.; Smolka, S.; Attie, P.; Sonderegger, E., Turing machines, transition systems, and interaction, Information and computation journal, 194, 2, 101-128, (2004) · Zbl 1090.68040
[11] Goldin, D.; Viroli, M., Foundations of interactive computation, (FInCo 2005), Entcs, 141, (2005), Elsevier
[12] Lee, E.A., Concurrent semantics without the notions of state or state transitions, (), 18-31 · Zbl 1141.68510
[13] Meseguer, J., Conditional rewriting logic as a unified model of concurrency, Theoretical computer science, 96, 1, 73-155, (1992) · Zbl 0758.68043
[14] Meseguer, J.; Talcott, C.L., Semantic models for distributed object reflection, (), 1-36 · Zbl 1049.68815
[15] S. Ren, M. Sirjani, and C. Talcott. Comparing three coordination models: Reo, arc, and rrd, 2007. in preparation · Zbl 1277.68208
[16] C. Talcott. Coordination models based on a formal model of distributed object reflection. In 1st International Workshop on Methods and Tools for Coordinating Concurrent, Distributed and Mobile Systems (MTCoord 2005), 2005
[17] C. Talcott. Policy-based coordination in pagoda: A case study. In 2nd International Workshop on Methods and Tools for Coordinating Concurrent, Distributed and Mobile Systems (MTCoord 2005), 2006
[18] Talcott, C.L., Composable semantic models for actor theories, Higher-order and symbolic computation, 11, 3, 281-343, (1998) · Zbl 0934.68058
[19] P. Wegner. Why interaction is more powerful than algorithms. CACM, May 1997
[20] P. Wegner and D. Goldin. Computation beyond turing machines. CACM, April 2003
[21] Wirsing, M.; Denker, G.; Talcott, C.; Poggio, A.; Briesemeister, L., A rewriting logic framework for soft constraints, Sixth international workshop on rewriting logic and its applications, (WRLA’2006), Entcs, (2006), Elsevier
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.