Timed Basic Parallel Processes

DOI10.4230/LIPICS.CONCUR.2019.15MaRDI QIDQ5875376zbMATH OpenOpenAlexFDO

Authors Lorenzo Clemente, Piotr Hofman, Patrick Totzke

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1907.01240

zbMATH Keywords

Petri netstimed automata

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Timed processes of timed Petri nets
• Analysis of probabilistic basic parallel processes
• scientific article; zbMATH DE number 1512608
• The expressive power of time Petri nets
• scientific article; zbMATH DE number 1927586

Cites work

• scientific article; zbMATH DE number 4209631 (Why is no real title available?)
• scientific article; zbMATH DE number 1302474 (Why is no real title available?)
• scientific article; zbMATH DE number 1361127 (Why is no real title available?)
• scientific article; zbMATH DE number 1059894 (Why is no real title available?)
• scientific article; zbMATH DE number 1512608 (Why is no real title available?)
• scientific article; zbMATH DE number 1755138 (Why is no real title available?)
• scientific article; zbMATH DE number 1796157 (Why is no real title available?)
• A Decision Procedure for the First Order Theory of Real Addition with Order
• A faster algorithm for solving one-clock priced timed games
• A theory of timed automata
• Almost Optimal Strategies in One Clock Priced Timed Games
• Alternating timed automata
• An effective decision procedure for linear arithmetic over the integers and reals
• Automated Deduction – CADE-20
• Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
• CONCUR 2004 - Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
• Dense-timed pushdown automata
• Effective definability of the reachability relation in timed automata
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Kronos: A verification tool for real-time systems
• Model checking of systems with many identical timed processes
• Perfect timed communication is hard
• Reachability in two-clock timed automata is PSPACE-complete
• Reachability of communicating timed processes
• Reachability-Time Games on Timed Automata
• Recursive timed automata
• The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
• Timed lossy channel systems
• Timed pushdown automata and branching vector addition systems
• Timed recursive state machines: expressiveness and complexity
• Universal safety for timed Petri nets is PSPACE-complete
• Uppaal in a nutshell
• Verification for Timed Automata extended with Unbounded Discrete Data Structures

Cited in

(3)

• scientific article; zbMATH DE number 7566065 (Why is no real title available?)
• scientific article; zbMATH DE number 1512608 (Why is no real title available?)
• scientific article; zbMATH DE number 7559498 (Why is no real title available?)

Describes a project that uses

Uses Software

• Uppaal
• Kronos

This page was built for publication: Timed Basic Parallel Processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875376)