Equivalences of Statecharts

DOI10.1007/3-540-61604-7_84MaRDI QIDQ6162113zbMATH OpenOpenAlexFDO

Authors Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini

Publication date 28 June 2023

Published in CONCUR '96: Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61604-7_84

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Reconciling statechart semantics
• Statecharts, transition structures and transformations
• A comparison of Statecharts step semantics
• scientific article; zbMATH DE number 139805
• scientific article; zbMATH DE number 1544531

Cites work

• Extensional equivalences for transition systems
• scientific article; zbMATH DE number 4056977 (Why is no real title available?)
• Statecharts: a visual formalism for complex systems
• The Esterel synchronous programming language: Design, semantics, implementation

Cited in

(10)

• Reconciling statechart semantics
• A problem-decomposition method using differences or equivalence relations between states
• A compositional -calculus proof system for statecharts processes
• On disjunction of literals in triggers of statecharts transitions.
• A comparison of Statecharts step semantics
• scientific article; zbMATH DE number 1670821 (Why is no real title available?)
• Statecharts, transition structures and transformations
• The intuitionism behind statecharts steps
• Constructive semantics for instantaneous reactions
• A compositional real-time semantics of STATEMATE designs

This page was built for publication: Equivalences of Statecharts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6162113)