A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets

DOI10.1016/j.tcs.2005.02.009zbMath1068.68092OpenAlexW2063239786MaRDI QIDQ557805

Fernando Cuartero, Antonio Bueno, Valentin Valero

Publication date: 30 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.02.009

zbMATH Keywords

Process algebraConcurrent systemsFormal methodsSoftware specificationTimed Petri nets

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

Discussion on: ``Formal specification method for systems automation

Cites Work

• A timed model for communicating sequential processes
• Bisimulation through probabilistic testing
• Finite representations of CCS and TCSP programs by automata and Petri nets
• TIC: a tImed calculus
• Algebraic theory of probabilistic and nondeterministic processes.
• Algebraic theory of probabilistic processes.
• Process algebra with timing
• Discrete time generative-reactive probabilistic processes with different advancing speeds
• Reactive, generative, and stratified models of probabilistic processes
• Nets, Terms and Formulas
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets