Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
DOI10.1007/s00236-015-0238-xzbMath1325.68135OpenAlexW597329005MaRDI QIDQ2350494
Joaquín Aguado, Reinhard von Hanxleden, Insa Fuhrmann, Michael Mendler
Publication date: 24 June 2015
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://macau.uni-kiel.de/receive/macau_mods_00002000
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructive Boolean circuits and the exactness of timed ternary simulation
- Compositional design of isochronous systems
- Constructive semantics for instantaneous reactions
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic?
- Statecharts: a visual formalism for complex systems
- The Esterel synchronous programming language: Design, semantics, implementation
- Structured operational semantics and bisimulation as a congruence
- A completeness theorem for Kleene algebras and the algebra of regular events
- The semantics and execution of a synchronous block-diagram language.
- A fully abstract model for the \(\pi\)-calculus.
- Compositionality in dataflow synchronous languages: Specification and distributed code generation
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- A process algebra for timed systems
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
- Topology of series-parallel networks
- CPO models for compact GSOS languages
- Constructive Polychronous Systems
- Analysis of cyclic combinational circuits
- What Is in a Step: New Perspectives on a Classical Question
- Acceptance trees
- Argos: an automaton-based synchronous language
- Automatic Verification of Determinism for Structured Parallel Programs
- What is in a step: On the semantics of statecharts
- N -synchronous Kahn networks
- Freeze after writing
- Grounding Synchronous Deterministic Concurrency in Sequential Programming
- The intuitionism behind Statecharts steps
- A fully abstract denotational model for observational precongruence
- An algebraic theory of multiple clocks
This page was built for publication: Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
