Specifying computations using hyper transition systems

DOI10.1007/BFB0029960MaRDI QIDQ4699293zbMATH OpenFDO

Authors Marcello M. Bonsangue, Joost N. Kok

Publication date 10 November 1999

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

Full work available at URL https://doi.org/10.1007/BFB0029960

zbMATH Keywords

concurrencyhyper transition systems

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

• Model-Checking HyperLTL for Pushdown Systems
• Transition systems and dynamic semantics
• A computable and compositional semantics for hybrid automata
• Encoding transition systems in sequent calculus
• A formal framework for hypersequent calculi and their fibring
• Algorithms for model checking HyperLTL and HyperCTL^*
• scientific article; zbMATH DE number 1951572
• Sequent calculus and the specification of computation
• scientific article; zbMATH DE number 2084368
• A hypergraph rewriting language and its semantics

Cited in

(1)

• Processes and formalisms for unbounded choice

This page was built for publication: Specifying computations using hyper transition systems

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