Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems

DOI10.1007/b100824zbMath1109.68509OpenAlexW4206454994MaRDI QIDQ5464758

Aletta Nylén, Pritha Mahata, Johann Deneux, Parosh Aziz Abdulla

Publication date: 19 August 2005

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

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

Mathematics Subject Classification ID

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 (6)

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 ⋮ Universal safety for timed Petri nets is PSPACE-complete ⋮ Dynamic Networks of Timed Petri Nets ⋮ Verification of Timed-Arc Petri Nets ⋮ Forward analysis for WSTS, part I: completions

This page was built for publication: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems