Communicating sequential processes
Communicating sequential processes
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Process algebra
A compositional axiomatization of Statecharts
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
The ESTEREL synchronous programming language: design, semantics, implementation
Science of Computer Programming
A process algebra for timed systems
Information and Computation
The STATEMATE semantics of statecharts
ACM Transactions on Software Engineering and Methodology (TOSEM)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Communication and Concurrency
Modeling Reactive Systems with Statecharts: The Statemate Approach
Modeling Reactive Systems with Statecharts: The Statemate Approach
A congruence theorem for structured operational semantics with predicates and negative premises
Nordic Journal of Computing
What is in a Step: On the Semantics of Statecharts
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
CCS + Time = An Interleaving Model for Real Time Systems
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
A Compositional Real-Time Semantics of STATEMATE Designs
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Operational and Compositional Semantics of Synchronous Automaton Compositions
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Compositional Semantics for Statecharts using Labeled Transition Systems
CONCUR '94 Proceedings of the Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Comparison of Statecharts Variants
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Process Algebraic Semantics for Statecharts via State Refinement
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
On formal semantics of statecharts as supported by STATEMATE
2FACS'97 Proceedings of the 2nd BCS-FACS conference on Northern Formal Methods
Axiomatizing an Algebra of Step Reactions for Synchronous Languages
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
GCCS: A Graphical Coordination Language for System Specification
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Formalization of UML-Statecharts
«UML» '01 Proceedings of the 4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools
Developing Control Systems Components
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
What is in a step: new perspectives on a classical question
Time for verification
Constructive semantics for instantaneous reactions
Theoretical Computer Science
Model checking for timed statecharts
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
Statecharts is a visual language for specifying the behavior of reactive systems. The language extends finite-state machines with concepts of hierarchy, concurrency, and priority. Despite its popularity as a design notation for embedded systems, precisely defining its semantics has proved extremely challenging. In this paper, we present a simple process algebra, called Statecharts Process Language (SPL), which is expressive enough for encoding Statecharts in a structure-preserving and semantics-preserving manner. We also establish that the behavioral equivalence bisimulation, when applied to SPL, preserves Statecharts semantics.