Reactive Systems
From MaRDI portal
Publication:5309950
DOI10.1017/CBO9780511814105zbMath1141.68043MaRDI QIDQ5309950
Luca Aceto, Anna Ingólfsdóttir, Jiří Srba, Kim Guldstrand Larsen
Publication date: 4 October 2007
Full work available at URL: https://doi.org/10.1017/cbo9780511814105
real-time systems; concurrency; transition systems; process algebras; reactive systems; algorithmic verification; Henessy-Milner logic
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q45: Formal languages and automata
03B70: Logic in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes, Unnamed Item, Unnamed Item, Discount-Optimal Infinite Runs in Priced Timed Automata, Consistently-detecting monitors, Simplified Coalgebraic Trace Equivalence, Monitoring for Silent Actions, The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism, Bidirectional Runtime Enforcement of First-Order Branching-Time Properties, Alternation-free weighted mu-calculus: decidability and completeness, On first-order runtime enforcement of branching-time properties, Simulation relations and applications in formal methods, Adequacy and complete axiomatization for timed modal logic, Bisimulations for fuzzy automata, Value-passing CCS with noisy channels, Reachability analysis for timed automata using max-plus algebra, Lattice-valued simulations for quantitative transition systems, Differential privacy in probabilistic systems, Computation of the greatest simulations and bisimulations between fuzzy automata, Quantitative analysis of weighted transition systems, 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, Cyber-physical systems, 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, Testing interruptions in reactive systems, A theory of monitors, A study on team bisimulation and H-team bisimulation for BPP nets, 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?, Characteristic formulae for fixed-point semantics: a general framework, When Are Prime Formulae Characteristic?, Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems, Dynamic Logic with Binders and Its Application to the Development of Reactive Systems, On the Executability of Interactive Computation, Unnamed Item, Teaching Concurrency Concepts to Freshmen, Checking Timed Büchi Automata Emptiness Using LU-Abstractions
