Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Free choice Petri nets
Communication and Concurrency
IEEE Design & Test
Checking properties of nets using transformation
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
Synthesis of Reactive Systems: Application to Asynchronous Circuit Design
Concurrency and Hardware Design, Advances in Petri Nets
Analyzing Specifications for Delay-Insensitive Circuits
ASYNC '98 Proceedings of the 4th International Symposium on Advanced Research in Asynchronous Circuits and Systems
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
Process spaces and formal verification of asynchronous circuits
Process spaces and formal verification of asynchronous circuits
Circal: A calculus for circuit description
Integration, the VLSI Journal
Synthesis of Reactive Systems: Application to Asynchronous Circuit Design
Concurrency and Hardware Design, Advances in Petri Nets
Component refinement and CSC-solving for STG decomposition
Theoretical Computer Science
Transformations in Reconfigurable Place/Transition Systems
Concurrency, Graphs and Models
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
Independence of net transformations and token firing in reconfigurable place/transition systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Component refinement and CSC solving for STG decomposition
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
| Hi-index | 0.01 |
The notion of I/O compatibility of reactive systems is defined. It models the fact that two systems can be connected and establish a correct dialogue through their input and output events. I/O compatibility covers safeness and liveness properties that can be checked with a polynomial-time decision procedure. The relationship between observational equivalence, I/O compatibility and input properness is also studied with the aim at supporting the proposal of transformations for the synthesis of reactive systems. Finally, a set of Petri net transformations that preserve I/O compatibility are shown as an example of application of the theory presented in this paper.