Skip to content

GitLab

  • Projects
  • Groups
  • Snippets
  • Help
    • Loading...
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Sign in
M MTSA
  • Project overview
    • Project overview
    • Details
    • Activity
    • Releases
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
  • Issues 31
    • Issues 31
    • List
    • Boards
    • Labels
    • Service Desk
    • Milestones
  • Merge requests 3
    • Merge requests 3
  • CI/CD
    • CI/CD
    • Pipelines
    • Jobs
    • Schedules
  • Operations
    • Operations
    • Metrics
    • Incidents
    • Environments
  • Packages & Registries
    • Packages & Registries
    • Package Registry
  • Analytics
    • Analytics
    • CI/CD
    • Repository
    • Value Stream
  • Wiki
    • Wiki
  • Snippets
    • Snippets
  • Members
    • Members
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
Collapse sidebar
  • lafhis
  • MTSA
  • Wiki
    • Enduser
  • Modal Transition Systems

Modal Transition Systems · Changes

Page history
suchitel updated page: Modal Transition Systems authored Jun 19, 2026 by Sebastian Uchitel's avatar Sebastian Uchitel
Show whitespace changes
Inline Side-by-side
Showing with 6 additions and 6 deletions
+6 -6
  • enduser/Modal-Transition-Systems.md enduser/Modal-Transition-Systems.md +6 -6
  • No files found.
enduser/Modal-Transition-Systems.md
View page @ 28d792a6
Modal transition systems (MTS) can be modelled by using a question mark (?) on event labels. # Modal Transition Systems
Modal transition systems (MTS) can be modelled by using a question mark (`?`) on event labels to indicate may-transitions (transitions that may or may not be present in an implementation).
``` ```
A = (a -> b? -> A | a? -> A). A = (a -> b? -> A | a? -> A).
``` ```
# Abstract keyword # Abstract keyword
The abstract keyword builds an MTS from a FSP process adding to each state maybe The `abstract` keyword builds an MTS from an FSP process by adding to each state maybe-transitions on labels that are not enabled in the original process.
transitions on labels that are not enabled in the original process.
It can be applied both to sequential and composite processes. It can be applied both to sequential and composite processes.
``` ```
...@@ -15,7 +17,5 @@ B = (a -> b -> B | b? -> B). ...@@ -15,7 +17,5 @@ B = (a -> b -> B | b? -> B).
abstract ||COMP = (B). abstract ||COMP = (B).
``` ```
# End
--- ---
[← End User](End-User) [← End User](End-User)
Clone repository
  • Developer
  • End User
  • FSP Keywords
  • devs
    • outputmessages
  • enduser
    • DCS
    • Discrete Event Controller Synthesis
    • FSP
    • Fluents and LTL properties
    • Hello World
    • Modal Transition Systems
  • Home