Closure properties of deterministic Petri nets
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Communication and Concurrency
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
The residue of vector sets with applications to decidability problems in Petri nets
Proceedings of the European Workshop on Applications and Theory in Petri Nets, covers the last two years which include the workshop 1983 in Toulouse and the workshop 1984 in Aarhus, selected papers
An algorithm for the general Petri net reachability problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The Common Component Modeling Example: Comparing Software Component Models
The Common Component Modeling Example: Comparing Software Component Models
Output-Determinacy and Asynchronous Circuit Synthesis
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Deciding service composition and substitutability using extended operating guidelines
Data & Knowledge Engineering
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
On the Observable Behaviour of Composite Components
Electronic Notes in Theoretical Computer Science (ENTCS)
A Compositional Approach on Modal Specifications for Timed Systems
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Journal of Computer and System Sciences
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Complexity of decision problems for mixed and modal specifications
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Decision problems for interval Markov chains
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Modal interface theories for communication-safe component assemblies
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
On weak modal compatibility, refinement, and the MIO workbench
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Channel properties of asynchronously composed petri nets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
We propose a framework for the specification of infinite state systems based on Petri nets with distinguished may- and must-transitions (called modalities) which specify the allowed and the required behavior of refinements and hence of implementations. For any modal Petri net, we define its generated modal language specification which abstracts away silent transitions. On this basis we consider refinements of modal Petri nets by relating their generated modal language specifications. We show that this refinement relation is decidable if the underlying modal Petri nets are weakly deterministic. We also show that the membership problem for the class of weakly deterministic modal Petri nets is decidable. As an important application scenario of our approach we consider I/O-Petri nets and their asynchronous composition which typically leads to an infinite state system.