Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
From MaRDI portal
Recommendations
Cites work
- \(N\)-synchronous Kahn networks: a relaxed model of synchrony for real-time systems
- A completeness theorem for Kleene algebras and the algebra of regular events
- A fully abstract denotational model for observational precongruence
- A fully abstract model for the \(\pi\)-calculus.
- A process algebra for timed systems
- Acceptance trees
- An algebraic theory of multiple clocks
- Analysis of cyclic combinational circuits
- Argos: an automaton-based synchronous language
- Automatic verification of determinism for structured parallel programs
- Compositional design of isochronous systems
- Compositionality in dataflow synchronous languages: Specification and distributed code generation
- Constructive Boolean circuits and the exactness of timed ternary simulation
- Constructive polychronous systems
- Constructive semantics for instantaneous reactions
- CPO models for compact GSOS languages
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
- Freeze after writing, quasi-deterministic parallel programming with LVars
- Full abstraction for PCF
- Grounding synchronous deterministic concurrency in sequential programming
- Handbook of process algebra
- scientific article; zbMATH DE number 1670485 (Why is no real title available?)
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 3943004 (Why is no real title available?)
- scientific article; zbMATH DE number 3976319 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4056977 (Why is no real title available?)
- scientific article; zbMATH DE number 8771 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3469994 (Why is no real title available?)
- scientific article; zbMATH DE number 3566181 (Why is no real title available?)
- scientific article; zbMATH DE number 1231624 (Why is no real title available?)
- scientific article; zbMATH DE number 526071 (Why is no real title available?)
- scientific article; zbMATH DE number 1927575 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
- On full abstraction for PCF: I, II and III
- Statecharts: a visual formalism for complex systems
- Structured operational semantics and bisimulation as a congruence
- The Esterel synchronous programming language: Design, semantics, implementation
- The intuitionism behind statecharts steps
- The semantics and execution of a synchronous block-diagram language.
- Topology of series-parallel networks
- What is in a step: new perspectives on a classical question
- What is in a step: on the semantics of statecharts
Cited in
(8)- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
- Structured Derivation of Semi-Synchronous Algorithms
- scientific article; zbMATH DE number 1089087 (Why is no real title available?)
- scientific article; zbMATH DE number 2080057 (Why is no real title available?)
- scientific article; zbMATH DE number 7362744 (Why is no real title available?)
- Grounding synchronous deterministic concurrency in sequential programming
- Logic meets algebra: compositional timing analysis for synchronous reactive multithreading
- A generalization of Banach's fixed point theorem
This page was built for publication: Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350494)
