From Many Places to Few: Automatic Abstraction Refinement for Petri Nets

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-73094-1_10
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

From Code to Coloured Petri Nets: Modelling Guidelines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Monotonic Abstraction-Refinement for CTL

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Control Optimality for Ordinary Petri Nets

IFAC Proceedings Volumes
2011English

Deriving Unbounded Petri Nets From Formal Languages

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Solution Techniques for Stochastic Petri Nets.

English

Discovering Colored Petri Nets From Event Logs

International Journal on Software Tools for Technology Transfer
Information SystemsSoftware
2007English

From Time Petri Nets to Timed Automata: An Untimed Approach

English

Automatic Abstraction for Congruences

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Supervisors of Petri Nets

Research Papers Faculty of Materials Science and Technology Slovak University of Technology
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy