Timed Basic Parallel Processes
From MaRDI portal
Publication:5875376
DOI10.4230/LIPIcs.CONCUR.2019.15OpenAlexW2970789710MaRDI QIDQ5875376
Piotr Hofman, Lorenzo Clemente, Patrick Totzke
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1907.01240
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Timed recursive state machines: expressiveness and complexity
- A theory of timed automata
- Perfect timed communication is hard
- Model checking of systems with many identical timed processes
- Kronos: A verification tool for real-time systems
- Uppaal in a nutshell
- Effective definability of the reachability relation in timed automata
- Reachability in two-clock timed automata is PSPACE-complete
- A Faster Algorithm for Solving One-Clock Priced Timed Games
- Timed lossy channel systems
- Dense-Timed Pushdown Automata
- The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
- Verification for Timed Automata extended with Unbounded Discrete Data Structures
- A Decision Procedure for the First Order Theory of Real Addition with Order
- Reachability of Communicating Timed Processes
- Recursive Timed Automata
- Universal safety for timed Petri nets is PSPACE-complete
- An effective decision procedure for linear arithmetic over the integers and reals
- Alternating timed automata
- CONCUR 2004 - Concurrency Theory
- Almost Optimal Strategies in One Clock Priced Timed Games
- Automated Deduction – CADE-20
- Reachability-Time Games on Timed Automata
- Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
- CONCUR 2005 – Concurrency Theory
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Timed Basic Parallel Processes
