scientific article; zbMATH DE number 526071
From MaRDI portal
Publication:4284985
zbMath0828.68038MaRDI QIDQ4284985
Publication date: 10 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of programming languages (68N15) Distributed algorithms (68W15)
Related Items
REGULAR STATE MACHINES, Formal modelling and verification of GALS systems using GRL and CADP, Dispatch sequences for embedded control models, Incremental bounded model checking for embedded software, Probabilistic concurrent constraint programming, An axiomatic semantics for the synchronous language Gentzen., Testing interruptions in reactive systems, A dynamic logic with branching modalities, Equivalence checking 40 years after: a review of bisimulation tools, Constructive semantics for instantaneous reactions, Model-based construction and verification of critical systems using composition and partial refinement, Algorithmic-level specification and characterization of embedded multimedia applications with Design Trotter, Continuous consensus via common knowledge, Multi-task implementation of multi-periodic synchronous programs, Keeping calm in the face of change. Towards optimisation of FRP by reasoning about change, Sampled-data supervisory control, Unnamed Item, Implementing mixed-criticality synchronous reactive programs upon uniprocessor platforms, Automatic verification of parameterized networks of processes, Synchronous structures, Concurrency in synchronous systems, Dynamic and formal verification of embedded systems: A comparative survey, An axiomatic semantics for Esterel, Property-Based Testing for Spark Streaming, Reactive mode handling of flexible manufacturing systems, Specifying and verifying reactive systems in a multi-language environment, A timed concurrent constraint language., Compositionality in dataflow synchronous languages: Specification and distributed code generation, Compositional verification of asynchronous concurrent systems using CADP, Denotational fixed-point semantics for constructive scheduling of synchronous concurrency, Uniformity for the decidability of hybrid automata
