scientific article; zbMATH DE number 3602653
From MaRDI portal
Publication:4168046
Cited in
(42)- On infinite computations in denotational semantics
- The greatest fixed-points and rational omega-tree languages
- Fixed-point extensions of first-order logic
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- An automata theoretic decision procedure for the propositional mu- calculus
- The \(\mu\)-calculus as an assertion-language for fairness arguments
- A proof system for the first-order relational calculus
- CPO's of measures for nondeterminism
- On the total correctness of nondeterministic programs
- A dual problem to least fixed points
- Fixed point theorems and semantics: A folk tale
- Programs as partial graphs. I: Flow equivalence and correctness
- Programs as partial graphs. II: Recursion
- Relation algebraic domain constructions
- Chain-complete posets and directed sets with applications
- Completeness results for the equivalence of recursive schemas
- Finiteness is mu-ineffable
- On the completeness of the inductive assertion method
- Categories of chain-complete posets
- Correctness of fixpoint transformations
- Peirce algebras
- The weakest precondition calculus: Recursion and duality
- Relation-algebraic semantics
- Parallel constructions of maximal path sets and applications to short superstrings
- Action systems, unbounded nondeterminism, and infinite traces
- A fixpoint theory for non-monotonic parallelism
- A compositional dataflow semantics for Petri nets
- Programmological aspects of the fixed point method
- The mu-calculus and Model Checking
- Structural congruence for bialgebraic semantics
- scientific article; zbMATH DE number 3814949 (Why is no real title available?)
- Convergence of chaotic iterative least fixed point computations
- On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics
- Dataflow semantics for Petri nets
- scientific article; zbMATH DE number 7809184 (Why is no real title available?)
- Extremal solutions of inequations over lattices with applications to supervisory control
- On the logic of UNITY
- Equivalences among logics of programs
- Results on the propositional \(\mu\)-calculus
- Relation-algebraic computation of fixed points with applications
- A functional programming approach to the specification and verification of concurrent systems
- Dual unbounded nondeterminacy, recursion, and fixpoints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168046)
