Recoverability of Communication Protocols--Implications of a Theoretical Study

DOI10.1109/TCOM.1976.1093424zbMath0362.68096MaRDI QIDQ4136583

Philip M. Merlin, David J. Farber

Publication date: 1976

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items

CTL* model checking for time Petri nets ⋮ The synthesis of communication protocols ⋮ Nondeterministic probabilistic Petri net -- a new method to study qualitative and quantitative behaviors of system ⋮ Specification and analysis of timing requirements for real-time systems in the CBD approach ⋮ An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions ⋮ Scheduling and control of real-time systems based on a token player approach ⋮ Distributed simulation of modular time Petri nets: An approach and a case study exploiting temporal uncertainty ⋮ `True concurrency' semantics for time Petri nets with weak time and persistent atomic policies ⋮ Flexible nets: a modeling formalism for dynamic systems with uncertain parameters ⋮ A theory of implementation and refinement in timed Petri nets ⋮ Petri nets for modelling metabolic pathways: a survey ⋮ Causal behaviours and nets ⋮ A process algebra of communicating shared resources with dense time and priorities ⋮ Liveness enforcement for production systems modeled by time Petri nets ⋮ Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net ⋮ Faster asynchronous systems. ⋮ Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games ⋮ Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL} ⋮ Computing branching distances with quantitative games ⋮ On the composition of time Petri nets ⋮ Discrete time stochastic and deterministic Petri box calculus dtsdPBC ⋮ A wide-spectrum language for object-based development of real-time systems ⋮ Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ TCTL-preserving translations from timed-arc Petri nets to networks of timed automata ⋮ Concurrency and Time in Role-Based Access Control ⋮ Fuzzy timed Petri nets - analysis and implementation ⋮ Dynamic Networks of Timed Petri Nets ⋮ A temporal logic for micro- and macro-step-based real-time systems: foundations and applications ⋮ Interval timed coloured Petri net: efficient construction of its state class space preserving linear properties ⋮ Verifying time Petri nets by linear programming ⋮ Equivalence relations for modular performance evaluation in dtsPBC ⋮ Fuzzy timed Petri net definitions, properties, and applications ⋮ A control synthesis approach for time discrete event systems ⋮ Hard real-time tasks' scheduling considering voltage scaling, precedence and exclusion relations ⋮ The tool TINA – Construction of abstract state spaces for petri nets and time petri nets ⋮ A time Petri net-based approach for synchronization, analysis and management of multimedia scenarios ⋮ Petri net‐based modeling and performance analysis of transaction scheduling in grid database ⋮ On-the-fly \(TCTL\) model checking for time Petri nets ⋮ Minimal Cost Reachability/Coverability in Priced Timed Petri Nets ⋮ Verification of Timed-Arc Petri Nets ⋮ TIC: a tImed calculus ⋮ Mapping timed cause-effect structures into timed Petri nets ⋮ Performance evaluation in stochastic process algebra dtsdPBC ⋮ Decentralized state estimation and diagnosis of p-time labeled Petri nets systems ⋮ On fluidization of discrete event models: Observation and control of continuous Petri nets ⋮ A COTS-based approach for estimating performance and energy consumption of embedded real-time systems ⋮ Time-based expressivity of time Petri nets for system specification ⋮ A causal semantic for time Petri nets ⋮ Contraction of the ITCPN state space ⋮ Formal Synthesis of Real-Time Embedded Software by Time-Memory Scheduling of Colored Time Petri Nets1 1This work was partially supported by research project grant NSC-90-2215-E-194-009 from the National Science Council, Taiwan, ROC. ⋮ Full simulation coverage for SystemC transaction-level models of systems-on-a-chip ⋮ Approximated timed reachability graphs for the robust control of discrete event systems ⋮ A generic causal model for place latency. ⋮ Model checking of systems with many identical timed processes ⋮ Dealing with zero-time transitions in axiom systems. ⋮ A brief survey and synthesis of the roles of time in Petri nets. ⋮ Efficient verification of a class of time Petri nets using linear programming ⋮ Qualitative simulation of temporal concurrent processes using time interval Petri nets