Lectures on Concurrency and Petri Nets

DOI10.1007/b98282zbMath1088.68119OpenAlexW78026558MaRDI QIDQ5712294

Publication date: 23 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98282

Mathematics Subject Classification ID

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)

Related Items (70)

Modelling and analysing neural networks using a hybrid process algebra ⋮ Modelling and verification of weighted spiking neural systems ⋮ Configurable verification of timed automata with discrete variables ⋮ Verified Certification of Reachability Checking for Timed Automata ⋮ A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor global fixed-priority scheduling ⋮ Spotlight abstraction in model checking real-time task schedulability ⋮ Model Checking Real-Time Systems ⋮ Parameter synthesis for probabilistic timed automata using stochastic game abstractions ⋮ Shrinking timed automata ⋮ Unnamed Item ⋮ From Safety Critical Java Programs to Timed Process Models ⋮ Modular design of real-time systems using hierarchical communicating real-time state machines ⋮ On clock-aware LTL parameter synthesis of timed automata ⋮ How to stop time stopping ⋮ Task automata: Schedulability, decidability and undecidability ⋮ Better abstractions for timed automata ⋮ Event algebra for transition systems composition application to timed automata ⋮ Waiting nets ⋮ Axiomatisation and decidability of multi-dimensional Duration Calculus ⋮ SetExp: a method of transformation of timed automata into finite state automata ⋮ Aspects of availability. Enforcing timed properties to prevent denial of service ⋮ Quantitative Attack Tree Analysis via Priced Timed Automata ⋮ Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems ⋮ A survey of timed automata for the development of real-time systems ⋮ Unnamed Item ⋮ Bonding calculus ⋮ Control strategies for off-line testing of timed systems ⋮ Automated repair for timed systems ⋮ Distributed parametric model checking timed automata under non-zenoness assumption ⋮ Human-cyber-physical automata and their synthesis ⋮ Temporal Robustness of Stochastic Signals ⋮ An SMT-based approach to satisfiability checking of MITL ⋮ Parametric updates in parametric timed automata ⋮ Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic ⋮ Unnamed Item ⋮ Runtime enforcement of timed properties using games ⋮ Accelerating worst case execution time analysis of timed automata models with cyclic behaviour ⋮ Unnamed Item ⋮ Wordgen : a Timed word Generation Tool ⋮ Unnamed Item ⋮ Superposition as a decision procedure for timed automata ⋮ Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL} ⋮ Model-checking precision agriculture logistics: the case of the differential harvest ⋮ Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ Local abstraction refinement for probabilistic timed programs ⋮ Robust reachability in timed automata and games: a game-based approach ⋮ Parameter synthesis for hierarchical concurrent real-time systems ⋮ A formal approach to the WCRT analysis of multicore systems with memory contention under phase-structured task sets ⋮ Timed discrete event control of parallel production lines with continuous outputs ⋮ Graph-based models for real-time workload: a survey ⋮ Finding minimum and maximum termination time of timed automata models with cyclic behaviour ⋮ Temporal constraints in the logical analysis of regulatory networks ⋮ Certifying emptiness of timed Büchi automata ⋮ Dynamic causes for the violation of timed reachability properties ⋮ A temporal logic for micro- and macro-step-based real-time systems: foundations and applications ⋮ A menagerie of timed automata ⋮ Automating the transformation-based analysis of visual languages ⋮ Unnamed Item ⋮ On-the-fly \(TCTL\) model checking for time Petri nets ⋮ Survey on Directed Model Checking ⋮ Consistency in parametric interval probabilistic timed automata ⋮ Formalized Timed Automata ⋮ Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation ⋮ Checking Timed Büchi Automata Emptiness Using LU-Abstractions ⋮ A quadratic-time DBM-based successor algorithm for checking timed automata ⋮ Discretization of Timed Automata in Timed μCRL à la Regions and Zones ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next? ⋮ Monitoring timed properties (revisited) ⋮ Checking conformance for time-constrained scenario-based specifications ⋮ A tool for deciding the satisfiability of continuous-time metric temporal logic

Uses Software

This page was built for publication: Lectures on Concurrency and Petri Nets