Reactive Systems
From MaRDI portal
algorithmic verificationconcurrencyHenessy-Milner logicprocess algebrasreactive systemsreal-time systemstransition systems
Logic in computer science (03B70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) 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
Cited in
(89)- Functional specification and proof of correctness for time dependent behaviour of reactive systems
- Verification of reactive systems. Formal methods and algorithms.
- Cyber-physical systems
- A practical theory of reactive systems. Incremental modeling of dynamic behaviors.
- A logic for the stepwise development of reactive systems
- On decidability of recursive weighted logics
- Compositionality for quantitative specifications
- Predicate liftings and functor presentations in coalgebraic expression languages
- Specification, validation, and synthesis of email agent controllers: A case study in function rich reactive system design
- Testing interruptions in reactive systems
- A theory of monitors
- A study on team bisimulation and H-team bisimulation for BPP nets
- Formal methods for software engineering. Languages, methods, application domains. With a foreword by Manfred Broy and a contribution on the origins and development of formal methods by John V. Tucker
- On bidirectional runtime enforcement
- Team bisimilarity, and its associated modal logic, for BPP nets
- Compositional reasoning using intervals and time reversal
- Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations
- A linear-time-branching-time spectrum for behavioral specification theories
- Determinizing monitors for HML with recursion
- Bisimulation of type 2 for BL-general fuzzy automata
- A propositional dynamic logic for instantial neighborhood semantics
- CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
- Simulation for lattice-valued doubly labeled transition systems
- Monitorability for the Hennessy-Milner logic with recursion
- Verification of finite-state machines: a distributed approach
- When are prime formulae characteristic?
- Reasoning about reactive systems
- Adequacy and complete axiomatization for timed modal logic
- Characteristic formulae for fixed-point semantics: a general framework
- Issues in formal methods
- When are prime formulae characteristic?
- Model-based verification, optimization, synthesis and performance evaluation of real-time systems
- Formal methods for distributed processing. A survey of object-oriented approaches.
- Dynamic logic with binders and its application to the development of reactive systems
- On the executability of interactive computation
- Context-free session types for applied pi-calculus
- Modeling in Event B. System and software engineering.
- Teaching Concurrency Concepts to Freshmen
- Checking timed Büchi automata emptiness using LU-abstractions
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- Bisimulations for fuzzy automata
- scientific article; zbMATH DE number 1264491 (Why is no real title available?)
- Value-passing CCS with noisy channels
- Introduction to the Formal Design of Real-Time Systems
- Reachability analysis for timed automata using max-plus algebra
- scientific article; zbMATH DE number 6970796 (Why is no real title available?)
- A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes
- scientific article; zbMATH DE number 4119603 (Why is no real title available?)
- Lattice-valued simulations for quantitative transition systems
- On runtime enforcement via suppressions
- Analysing mutual exclusion using process algebra with signals
- On the Modeling of Sequential Reactive Systems by Means of Real Time Automata
- Consistently-detecting monitors
- Monitoring for silent actions
- Formal methods. An appetizer
- Discount-optimal infinite runs in priced timed automata
- Simplified coalgebraic trace equivalence
- Differential privacy in probabilistic systems
- The algorithmics of bisimilarity
- Recent Trends in Algebraic Development Techniques
- Bidirectional Runtime Enforcement of First-Order Branching-Time Properties
- Combining aspects of reactive systems
- The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
- Modal and temporal properties of processes
- Designing reliable distributed systems. A formal methods approach based on executable modeling in Maude
- Alternation-free weighted mu-calculus: decidability and completeness
- On first-order runtime enforcement of branching-time properties
- Simulation relations and applications in formal methods
- An Operational Guide to Monitorability
- Process equivalence problems as energy games
- A parametric rely-guarantee reasoning framework for concurrent reactive systems
- Isomorphism between two vector general fuzzy automata
- Logical characterisation of hybrid conformance
- A modular bisimulation characterisation for fragments of hybrid logic
- Hybrid-dynamic Ehrenfeucht-Fraïssé games
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Logical characterization of branching bisimilarity over random processes
- Modal logic characterizations of forward, reverse, and forward-reverse bisimilarities
- Timed actors and their formal verification
- Bisimulations and logics for higher-dimensional automata
- Alternating refinement relations for fuzzy concurrent game structures
- Characterizing traces of processes defined by precedence and response constraints: an order theory approach
- Symbolic realisation of epistemic processes
- Quantitative analysis of weighted transition systems
- The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum
- Synthesising correct concurrent runtime monitors
- Product line process theory
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- An operational semantics for a calculus for wireless systems
This page was built for publication: Reactive Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309950)
