Unifying theories of time with generalised reactive processes

DOI10.1016/j.ipl.2018.02.017zbMath1476.68143arXiv1712.10213OpenAlexW2779136310MaRDI QIDQ1708268

Ana Cavalcanti, Frank Zeyda, Simon Foster, J. C. P. Woodcock

Publication date: 5 April 2018

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

formal semanticshybrid systemsprocess algebratheorem provingunifying theories

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (4)

A Unary Semigroup Trace Algebra ⋮ Unifying theories of reactive design contracts ⋮ Automated verification of reactive and concurrent programs by calculation ⋮ Integration of formal proof into unified assurance cases with Isabelle/SACM

Uses Software

• Isabelle/HOL
• Circus

Cites Work

• Unnamed Item
• Unnamed Item
• Building program construction and verification tools from algebraic principles
• An algebra of hybrid systems
• A UTP semantics for \textsf{Circus}
• A Formal Model for a Hybrid Programming Language
• Towards a UTP Semantics for Modelica
• Unifying Heterogeneous State-Spaces with Lenses
• Circus Time with Reactive Designs
• Unifying Theories of Programming That Distinguish Nontermination and Abort
• Process algebra for synchronous communication
• Termination of Real-Time Programs: Definitely, Definitely Not, or Maybe

This page was built for publication: Unifying theories of time with generalised reactive processes