Timed Petri Nets and BQOs
Authors:
- 28 June 2001
- book chapter
- Published by Springer Nature
- p. 53-70
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- General decidability theorems for infinite-state systems2002
- Model-checking for real-time systems2002
- Better is better than well: on efficient verification of infinite-state systems2002
- Verifying networks of timed processes1998
- Simulation is decidable for one-counter nets1998
- Verifying Programs with Unreliable ChannelsInformation and Computation, 1996
- Decidability of the termination problem for completely specified protocolsDistributed Computing, 1994
- Deciding properties of integral relational automata1994
- Modeling and verification of time dependent systems using time Petri netsIEEE Transactions on Software Engineering, 1991
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986