Labeled Transition Systems

Anders Schlichtkrull; Morten Konggaard Schou; Jirí Srba; Dmitriy Traytel

Labeled Transition Systems

Anders Schlichtkrull, Morten Konggaard Schou, Jirí Srba, Dmitriy Traytel

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer 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.

Originalsprog	Engelsk
Tidsskrift	Archive of Formal Proofs
Vol/bind	2023
ISSN	2150-914x
Status	Udgivet - 2023

Bibliografisk note

DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

Adgang til dokumentet

https://www.isa-afp.org/entries/Labeled_Transition_Systems.html

AUB Link

Søg efter materialet i Aalborg Universitetsbiblioteks søgemaskine

Citationsformater

@article{43eb7a9d3e754a4589115823a971241a,

title = "Labeled Transition Systems",

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.",

author = "Anders Schlichtkrull and Schou, {Morten Konggaard} and Jir{\'i} Srba and Dmitriy Traytel",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2023",

language = "English",

volume = "2023",

journal = "Archive of Formal Proofs",

issn = "2150-914x",

}

TY - JOUR

T1 - Labeled Transition Systems

AU - Schlichtkrull, Anders

AU - Schou, Morten Konggaard

AU - Srba, Jirí

AU - Traytel, Dmitriy

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2023

Y1 - 2023

N2 - 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.

AB - 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.

M3 - Journal article

SN - 2150-914x

VL - 2023

JO - Archive of Formal Proofs

JF - Archive of Formal Proofs

ER -

Labeled Transition Systems

Abstract

Bibliografisk note

Adgang til dokumentet

AUB Link

Fingeraftryk

Citationsformater