Better automata through process algebra

DOI10.1007/978-3-031-15629-8_7zbMath1524.68168arXiv2002.07562OpenAlexW3006493675MaRDI QIDQ6163884

Rance Cleaveland

Publication date: 26 July 2023

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

Full work available at URL: https://arxiv.org/abs/2002.07562

zbMATH Keywords

operational semanticsprocess algebraregular expressionsfinite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• CCS expressions, finite state processes, and three problems of equivalence
• A complete inference system for a class of regular behaviours
• A calculus of communicating systems
• The origins of structural operational semantics
• A characterization of regular expressions under bisimulation
• An Overview of the mCRL2 Toolset and Its Recent Advances
• Programming Techniques: Regular expression search algorithm
• Derivatives of Regular Expressions
• Generic tools for verifying concurrent systems
• A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity

This page was built for publication: Better automata through process algebra