Refinement Sensitive Formal Semantics of State Machines With Persistent Choice

DOI10.1016/j.entcs.2009.08.006zbMath1339.68158OpenAlexW2109649660MaRDI QIDQ2810972

Jens Schönborn, Heiko Schmidt, Michael Huth, Harald Fecher

Publication date: 6 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.08.006

zbMATH Keywords

formal semantics\(\mu\)-calculusmodeling languagenondeterminism3-valued satisfaction

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Model Checking for Action Abstraction

Cites Work

• Unnamed Item
• Unnamed Item
• Concurrency and refinement in the unified modeling language
• Results on the propositional \(\mu\)-calculus
• 3-valued abstraction: More precision at less cost
• Statecharts: a visual formalism for complex systems
• A logic for reasoning about time and reliability
• Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
• Ranked Predicate Abstraction for Branching Time: Complete, Incremental, and Precise
• Automata for the modal μ-calculus and related results
• Bisimulation can't be traced
• Underspecification, Inherent Nondeterminism and Probability in Sequence Diagrams
• Tools and Algorithms for the Construction and Analysis of Systems
• A Probabilistic Extension of UML Statecharts
• Verification, Model Checking, and Abstract Interpretation
• Probability and Nondeterminism in Operational Models of Concurrency
• Alternating tree automata, parity games, and modal \(\mu\)-calculus

This page was built for publication: Refinement Sensitive Formal Semantics of State Machines With Persistent Choice