Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
From MaRDI portal
Publication:3511224
DOI10.1007/11867340_7zbMath1141.68426OpenAlexW1596935793MaRDI QIDQ3511224
Bernard Berthomieu, François Vernadat, Florent Peres
Publication date: 8 July 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11867340_7
timed automatatime Petri netsprioritiesweak timed bisimilarityreal-time systems modeling and verification
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (11)
Interpreted synchronous extension of time Petri nets. Definition, semantics and formal analysis ⋮ Model Checking Bounded Prioritized Time Petri Nets ⋮ Waiting Nets: State Classes and Taxonomy ⋮ On the composition of time Petri nets ⋮ Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ TCTL-preserving translations from timed-arc Petri nets to networks of timed automata ⋮ Diagnosability analysis of patterns on bounded labeled prioritized Petri nets ⋮ Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format ⋮ Verification of Timed-Arc Petri Nets ⋮ Decidable Classes of Unbounded Petri Nets with Time and Urgency ⋮ Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
This page was built for publication: Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
