Specifying complex and structured systems with evolving algebras

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1214, Issue , 1997, Pages 535-549

  May, Wolfgang ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; DATA ENCAPSULATION; FORMAL SPECIFICATION; SEMANTICS;

COMBINATORS; EXECUTABLE SPECIFICATIONS; FORMAL REASONING; PARTICIPATING SYSTEMS; SINGLE-RULE; SPECIFICATION FRAMEWORKS; STRUCTURED SYSTEMS; TRANSITION SYSTEM;

SOFTWARE DESIGN;

EID: 84956981696     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030624     Document Type: Conference Paper

References (18)

1. L. Aceto and M. Hennessy. Towards Action-Refinement in Process Algebras. Information and Computation, 103, 1993.
2. R. Alur and T.A. Henzinger. Reactive Modules. Proc. 11th Syrup. on Logic in Computer Science (LICS), 1996
3. E. BSrger, I. Durdanovic, and D. Rosenzweig. Occam: Specification and Compiler Correctness, Part I: The Primary Model, 1994.
4. J. Bergstra, J. Heering, and P. Klint. Module Algebra. Journal of the ACId, 37(2):335-372, 1990.
5. A.J. Bonner and M. Kifer. An overview of transaction logic. Theoretical Computer Science, 133(2):205-265, 1994.
6. B. Beckert and J. Posegga. Lean EA: A Poor Man’s Evolving Algebra Compiler. Technical Report 25, Universit/it Karlsruhe, Fak. f. Informatik, 1995.
7. E. BSrger and D. Rosenzweig. The WAM - Definition and Compiler Correctness. In Logic Programming: Formal Methods and Practical Applications, Ch. 1. North Holland, 1994.
8. P. Degano and R. Gorrieri. Atomic refinement in Process Description languages. In 16th Syrup. on Mathematical Foundations of Computer Science, Springer LNCS 520, pp. 121-130, 1991.
9. P. Degano and R. Gorrieri. A Causal Operational Semantics of Action Refinement. Information and Computation, 122(1):97-119, 1995.
10. R. Groenboom and G. R. de Lavalette. A Formalisation of Evolving Algebras. In Proc. Accolade95, pages 17-28, 1995.
11. Y. Gurevich and J. Huggins. An Evolving Algebra Interpreter. WWW, 1994.
12. P. Glavan and D. Rosenzweig. Communicating evolving algebras. Springer LNCS 702, pp. 182-215. Springer, 1993.
13. Y. Gurevich. Logics and the challenge of Computer science, pp. 1-57. In: Current Trends in Theoretical Computer Science, Comp. Sc. Press, 1988.
14. Y. Gurevich. An attempt to discover semantics (A Tutorial Introduction). Bulletin of the EATCS, 43:264-284, 1991.
15. Y. Gurevich. Lipari Guide. Oxford University Press, 1994.
16. B. Ludäischer, W. May, and G. Lausen. Nested Transactions in a Logical Language for Active Rules. In Proc. Intl. Workshop on Logic in Databases (LID), San Miniato, Italy, Springer LNCS 1154, pp. 197-222, 1996.
17. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73-155, 1992.
18. R. Milner. The Polyadic r-calculus: A Tutorial. Technical Report 180, Computer Science Department, University of Edinburgh, 1991.