A complete axiomatisation for trace congruence of finite state behaviors

DOI10.1007/3-540-58027-1_25OpenAlexW1562756344MaRDI QIDQ5890064

Alexander Rabinovich

Publication date: 28 April 2023

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

Full work available at URL: https://doi.org/10.1007/3-540-58027-1_25

zbMATH Keywords

inference ruleproof systemregular expressiondeterministic systemsuccessor action

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (9)

Complete axiomatization for the total variation distance of Markov chains ⋮ Nonaxiomatisability of equivalences over finite state processes ⋮ The equational logic of fixed points ⋮ On first-order runtime enforcement of branching-time properties ⋮ Unnamed Item ⋮ Iteration Semirings ⋮ Towards general axiomatizations for bisimilarity and trace semantics ⋮ Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems ⋮ Determinizing monitors for HML with recursion

Cites Work

• A complete inference system for a class of regular behaviours
• A complete axiomatisation for observational congruence of finite-state behaviours
• Algebraic laws for nondeterminism and concurrency
• Two Complete Axiom Systems for the Algebra of Regular Events

This page was built for publication: A complete axiomatisation for trace congruence of finite state behaviors