Interactive Systems: From Folklore to Mathematics

Authors:
Gheorghe Stefănescu
Affiliations:
-
Venue:
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Year:
2001

Citing 9
Cited 0

A survey of two-dimensional automata theory

Information Sciences: an International Journal
Concurrent regular expressions and their relationship to Petri nets

Theoretical Computer Science
Finite transition systems: semantics of communicating systems

Finite transition systems: semantics of communicating systems
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Two-dimensional languages

Handbook of formal languages, vol. 3
Anytime, anywhere: modal logics for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The algebra of stream processing functions

Theoretical Computer Science
Network Algebra

Network Algebra
Visual Formalisms Revisited

CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper gives a brief introduction to finite interactive systems, an abstract mathematical model of agents' behavior and their interaction. The paper contains the definition of finite interactive systems, examples, and a few simple results. No examples modeling real interactive systems are included, but there are many pointers suggesting how this can be done.