Labeled Transition Systems

Research output: Contribution to journalJournal articleResearchpeer-review

Abstract

Labeled transition systems are ubiquitous in computer science. They are used e.g. for automata and for program graphs in program analysis. We formalize labeled transition systems with and without epsilon transitions. The main difference between formalizations of labeled transition systems is in their choice of how to represent the transition system. In the present formalization the set of nodes is a type, and a labeled transition system is represented as a locale fixing a set of transitions where each transition is a triple of respectively a start node, a label and an end node. Wimmer [Wim20] provides an overview of formalizations of graphs and transition systems.
Original languageEnglish
JournalArchive of Formal Proofs
Volume2023
ISSN2150-914x
Publication statusPublished - 2023

Fingerprint

Dive into the research topics of 'Labeled Transition Systems'. Together they form a unique fingerprint.

Cite this