All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs

DOI10.1007/978-3-642-32940-1_13MaRDI QIDQ2914369zbMATH OpenOpenAlexFDO

Authors Antti Valmari

Publication date 25 September 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-32940-1_13

zbMATH Keywords

compositionalityprocess algebrasemanticsverification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• All linear-time congruences for familiar operators
• Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
• scientific article; zbMATH DE number 1223631
• Linear time and the power of one first-order universal quantifier
• Algebraic and logical characterizations of deterministic linear time classes
• scientific article; zbMATH DE number 1304315
• The Density of Linear-Time Properties
• Theory and Applications of Satisfiability Testing
• Time-Complexity Semantics for Feasible Affine Recursions
• Infinite time extensions of Kleene's \({\mathcal O}\)

Cited in

(3)

• All congruences below stability-preserving fair testing or CFFD
• On constructibility and unconstructibility of LTS operators from other LTS operators
• All linear-time congruences for familiar operators

This page was built for publication: All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914369)