TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION

DOI10.1142/S0129054193000043MaRDI QIDQ4275182zbMATH OpenFDO

Authors Wojciech Penczek

Publication date 13 January 1994

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054193000043

zbMATH Keywords

automated verificationconcurrencypartial order temporal logicstrace systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 512851
• Publication:4864475
• scientific article; zbMATH DE number 3932379
• Specification and verification using temporal logics
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• scientific article; zbMATH DE number 1059322
• On using temporal logic for refinement and compositional verification of concurrent systems
• Automatic Verification of Sequential Circuits Using Temporal Logic
• scientific article; zbMATH DE number 1487477
• Temporal proof methodologies for timed transition systems

Cited in

(22)

• On undecidability of propositional temporal logics on trace systems
• Automated theorem proving in temporal logic: T-resolution
• Petri nets, traces, and local model checking
• LTL is expressively complete for Mazurkiewicz traces
• Model checking properties on reduced trace systems
• Local temporal logic is expressively complete for cograph dependence alphabets
• From local to global temporal logics over Mazurkiewicz traces.
• Using temporal logics of knowledge for specification and verification -- a case study
• scientific article; zbMATH DE number 6117314 (Why is no real title available?)
• A -calculus with local views for systems of sequential agents
• scientific article; zbMATH DE number 1969331 (Why is no real title available?)
• Verifying increasingly expressive temporal logics for infinite-state systems
• Automated deduction in a graphical temporal logic
• EPTL: a temporal logic for weakly consistent systems (short paper)
• Petri nets, traces, and local model checking
• Distributed Computing - IWDC 2004
• Tools and Algorithms for the Construction and Analysis of Systems
• Adding partial orders to linear temporal logic
• Towards automata for branching time and partial order
• Efficient model checking for LTL with partial order snapshots
• Application of the trace assertion method to the specification, design, and verification of automaton programs
• Pure future local temporal logics are expressively complete for Mazurkiewicz traces

This page was built for publication: TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4275182)