An axiomatic semantics for Esterel

DOI10.1016/S0304-3975(00)00420-5zbMath0983.68136MaRDI QIDQ5958617

Simone Tini

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

equivalencesaxiomatic semanticsEsterelsynchronous languages

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

An axiomatic semantics for the synchronous language Gentzen. ⋮ Compositional semantics and behavioral equivalences for P systems ⋮ A denotational semantics for Handel-C

Uses Software

• Esterel

Cites Work

• Timed default concurrent constraint programming
• A complete inference system for a class of regular behaviours
• Statecharts: a visual formalism for complex systems
• The Esterel synchronous programming language: Design, semantics, implementation
• Structured operational semantics and bisimulation as a congruence
• A conservative look at operational semantics with variable binding
• Turning SOS rules into equations
• Process algebra for synchronous communication
• Formal verification of parallel programs
• Bisimulation can't be traced
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An axiomatic semantics for Esterel