Advances in Verification of Time Petri Nets and Timed Automata

Studies in Computational Intelligence - Germany
doi 10.1007/978-3-540-32870-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

From Time Petri Nets to Timed Automata: An Untimed Approach

English

Timed Petri Nets and BQOs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

A Holistic State Equation for Timed Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2014English

Verification of Networks of Timed Automata Using mCRL2

2008 IEEE International Symposium on Parallel and Distributed Processing
2008English

Time-Independent Liveness in Time Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2010English

Real-Time Synchronised Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Towards Automated fUML Model Verification With Petri Nets

2019English

The Complexity of Diagnosability and Opacity Verification for Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy